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.
|
Download Model question papers & previous years question papers
|
Posted By: jegadesh Member Level: Gold Posted Date: 08 Dec 2007
|
2006 Anna University B.E Electronics and Communication CS1151 – DATA STRUCTURES Question paper
|
|
|
B.E./B/Tech. DEGREE EXAMINATION,
NOVEMBER/DECEMBER 2006
Third Semester
Computer Science and Engineering
CS1151 – DATA STRUCTURES
(Common to B.E. (Part – Time) Second Semester Regulation 2005)
(Regulation 2004)
Time: Three hours Maximum: 100 Marks
Answer ALL questions
PART A – (10 ´ 2 = 20 marks)
1. Define time and space complexities.
2. What are the problem solving techniques?
3. Define ADT.
4. List out any two applications of stack and queue.
5. What is priority queue?
6. Explain shell sort algorithm.
7. Sort the following using merge sort: 15, 25, 70, 07, 11, 65, 81, 57
8. Define minimum spanning tree.
9. Discuss about external sorting.
10. Write the adjacency list of the following graph.
PART B– (5 ´ 16 = 80 marks)
11. (a) (i) Explain the top down design.
(ii) How do you analyze an algorithm?
Or
(b) Write algorithm to:
(i) Count the number of nodes in a singly linked list. (4)
(ii) Reverse a singly linked list. (4)
(iii) Concatenate 2 singly linked lists. (4)
(iv) Copy one singly linked list to another. (4)
12. (a) Explain in detail the various hashing techniques.
Or
(b) Write ADT routines for AVL tree operations.
13. (a) Explain the priority queue implementations. Write necessary algorithms.
Or
(b) (i) Write algorithm for implementation of queue.
(ii) Explain the ADT operations for array implementation of stack.
14. (a) Write and explain the quick sort algorithm. Give an example.
Or
(b) Write and explain heap sort algorithm with an example.
15. (a) Write and explain weighted and unweighted shortest path algorithm.
Or
(b) (i) Explain the Prim’s algorithm. Find out minimum spanning tree for the
following Graph:
Return to question paper search
|
|
|
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
|