Let　F　be　a　graph.　A　hypergraph　is　called　Berge　F　if　it　can　be　obtained　by　replacing　each　edge　in　F　by　a　hyperedge　containing　it.　Given　a　family　of　graphs　F,　we　say　that　a　hypergraph　H　is　Berge　F-free　if　for　every　F　epsilon　F,　the　hypergraph　H　does　not　contain　a　Berge　F　as　a　subhypergraph.　In　this　paper　we　investigate　on　the　connections　between　spectral　radius　of　the　adjacency　tensor　and　structural　properties　of　a　linear　hypergraph.　In　particular,　we　obtain　a　spectral　version　of　Turan-type　problems　over　linear　k-uniform　hypergraphs　by　using　spectral　methods.