Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Strange Photos Academic Projects New Member FAQ  



My Profile
Active Members
TodayLast 7 Days more...



Awards & Gifts
Online Exams

Fresher Jobs


Our fresher job section is exclusively for fresh graduates! Find jobs for freshers in major Indian cities including Bangalore, Chennai, Hyderabad, Pune or Kochi

Resources


Find educational articles, blogs, discussion threads and other resources.

Colleges


Find details about any college in India or search for courses.

website counter



Download Model question papers & previous years question papers

Posted By: Girish Patil       Member Level: Diamond       Posted Date: 05 Jan 2008

2007 Shivaji University B.E Computer Science COMPUTER ALGORITHM Question paper



Course: B.E Computer Science   University: Shivaji University




H-266
THIRD YEAR OF COMPUTER SCIENCE AND ENGINEERING (PART-1) EXAMINATION, 2007
SHIVAJI UNIVERSITY, KOLHAPUR
COMPUTER ALGORITHM

Day and Date: Friday, 29-11-2007 Total Marks: 100
Time: 10.00p.m. To 1.00p.m.

Instructions:

Instructions:
1) Solve any THREE questions from SECTION-1
2) Solve any THREE questions from SECTION-2
3) Figures to right indicates full marks

SECTION-1

Q.1.
a) Explain time and space complexity with example. [Marks 8]

b) Explain asymptotic notations in detail. [Marks 8]



Q.2
a) Prove the complexity of binary search algorithm is O (log n). [Marks 8]

b) Explain merge sort algorithm and show that its complexity is O(n logn) [Marks 8]

Q.3
a) Define spanning tree. Explain Kruskals algorithm to find minimum spanning tree with example. [Marks 8]

b) Explain Greedy approach to solve Job Sequencing problem. [Marks 8]

Q.4 Write a short notes on (any three): [Marks 18]

a) Huffman code
b) Quick sort algorithm
c) Analysis of algorithm









SECTION-2

Q. 6)
a) Explain any two traversal techniques of binary tree with suitable example. [Marks 8]

b) Define articulation point. Explain biconnected components of graph with suitable example. [Marks 8]



Q.6)
a) Explain the solution for all pairs shortest path problem using dynamic programming approach [Marks 8]

b) Explain Hamilton cycle with suitable example [Marks 8]

Q.7)
a) Explain sum of subsets and its solution using Backtracking approach. [Marks 8]

b) Reliability design with suitable example. [Marks 8]

Q.8) Write a short notes on (any three): [Marks 18]

a) AND-OR graphs
b) Graph coloring
c) Flow shop scheduling







Return to question paper search

Next Question Paper: ENGINEERING PHYSICS

Previous Question Paper: M.Sc. Applied Psychology - Advanced Social Psychology

Related Question Papers:


  • Software engineering


  • Computer Organization


  • heat & MT


  • COMPUTER NETWORKS


  • First Year Engineering Examination,2005 ,ENGINEERING PHYSICS-I


  • Categories


    Submit Previous Years University Question Papers and make money from adsense revenue sharing program

    Are you preparing for a university examination? Download model question papers and practise before you write the exam.



    Watch TV Channels
  • Watch Asianet TV online
  • Kairali TV in Internet
  • Surya TV online
  • Amritha TV Channel

  • Contact Us    Privacy Policy    Terms Of Use   

    SpiderWorks Technologies Pvt Ltd. 2006 - 2007 All Rights Reserved.