Community Sites
Create your own community website and start earning today !
It's Free !
 
Communities Members BookmarksPolls Fresher Jobs Funny Pictures MCA 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: Pournami       Member Level: Diamond       Posted Date: 10 May 2008

2006 Cochin University of Science & Technology Computer Science & Engineering B.Tech Degree IV Semester Examination, May 2006, IT/CS 405 DATA STRUCTURES & ALGORITHMS Question paper



Course: B.Tech Computer Science & Engineering   University: Cochin University of Science & Technology




B.Tech Degree IV Semester Examination, May 2006
IT/CS 405 DATA STRUCTURES & ALGORITHMS


Time: 3 Hours Maximum Marks: 100

I a) Develop an algorithm to perform binary search on an array of N numbers. [Marks 10]
b) What are multi dimensional arrays? Give an algorithm for matrix multiplication. [Marks 10]
OR
II a) Implement a linked list with the following operations:
i) Count the number of nodes in the list.
ii) Add a node with a given value to the front of the list.
iii) Delete a node with a given value from the front of the list.[Marks 8]
b) Discuss on doubly linked list. [Marks 12]

III a) Write a program to perform string reversal using stack. [Marks 10]
b) Transform the following infix expressions to postfix expressions:
i) A-B/(C*D+E)
ii) (A-B/C)*(X*Y+Z)
iii) (A+B)*(C-D)-E*F
iv) ((A+B)*(C|B-E)+F)-G [Marks 10]
OR
IV a) Define priority queues. [Marks 5]
b) Distinguish between Queue and Dequeue. [Marks 15]

V Explain how various traversals can be done on trees. [Marks 20]
OR
VI a) Distinguish between complete binary tree and full binary tree. [Marks 10]
b) What is a binary tree? Explain the representation of a binary tree. [Marks 10]

VII a) Write a JAVA code to implement minimum spanning tree. [Marks 10]
b) Explain various graph representation methods. [Marks 10]
OR
VIII Explain graph traversal methods. [Marks 20]

IX Distinguish between bubble sort and selection sort. [Marks 20]
OR
X Explain Quick sort method with an example. [Marks 20]


*****





Return to question paper search

Next Question Paper: B.Tech Degree VIII Semester Examination, May 2006, CS 802 DISTRIBUTED COMPUTING

Previous Question Paper: Term-End Examination AFE-01 : BASICS OF HIV/AIDS

Related Question Papers:


  • B.tech Degree V Semester (Supplementary) Examination, July 2005, IT 501 System Programming


  • B.tech Degree VIII Semester Examination, May 2006, construction Safety and Fire Engineering(2002 ad)


  • B.Tech. Degree V Semester Examination, February 2004, CS501 LANGUAGE PROCESSOR


  • B.Tech Degree IV Semester Examination, May 2006, CS 404 COMPUTER ARCHITECTURE AND ORGANISATION


  • software


  • 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.