October 29, 2011

CS1151 DATA STRUCTURES question papers May/Jun 2007 question papers Previous Year Question Paper Download


CS1151 DATA STRUCTURES question papers May/Jun 2007  Anna university question papers Previous Year Question Paper Download

B.E/B.Tech DEGREE EXAMINATION May/Jun 2007
Third semester
Computer Science and Engineering
CS1151 - DATA STRUCTURES
(Regulation 2004)
Time: 3 hours                                                    Maximum marks: 100
Answer ALL questions
PART A (10 x 2 =20 marks)

1. Write the basic idea behind the Divide and conquer strategy.

2. What is O-notation?

3. What is an ADT?

4. List the characteristics of stacks

5. What is binary search tree?

6. What is hashing?

7. Develop pseudo code that will illustrate the process logic in Insertion sort.

8. What is the best case time complexity of the Quick sort algorithm?

9. What is an adjacency list? When is it used?

10. What is an activity node graph ?

PART B (5 x 16 = 80)

11. (a)  (i)  Outline in brief about Top-down design.

  (ii) Foumulate an algorithm to convert a decimal integer to its corresponding octal representation.

(or)

(b)  (i)  Discuss in detail about the Implementation of algorithms.

(ii)  Given the character representation of an integer, convert it to its conventional decimal format.

(a)  (i)  Write a program in C to return the position of an element X in a list L.

(ii)  State and explain the algorithm to perform Radix sort.

(or)

(b)  (i)  Write a program in C to create an empty stack and to push an element into it.

(ii)  Explain how queues can be implemented using Arrays.

13.  (a)  (i) Construct an expression tree for the expression A + (B-C) * D + (E * F).

(ii)  Write a program in C to create an empty binary tree and to search for an element X in it.

(or)

(b)  (i) Explain in detail the Linear probing technique.

(ii) Write a function to delete the minimum element from a Binary heap. Routine to perform Deletion in a binary heap:

14(a)  State and explain the algorithm to perform Heap sort. Also analyze the time complexity of the algorithm.

(or)

(b) Write a C program to perform Merge sort. Also analyze the time complexity of the algorithm.

15. (a)  (i) Formulate an algorithm to find the shortest path using Dijkstra’s algorithm.

(ii)  Construct a Minimum Spanning Tree for the graph shown below.

                        
     

1. MST using Prim’s algorithm

2.MST using Kruskal’s algorithm

(or)

(i)  Explain the Prim’s algorithm with an example.

(ii) Write short notes on Biconnectivity.

FEEL USEFUL PLEASE GIVE +1

0 comments :

Post a Comment

Get Syllabus in your Mail

Labels

Accenture Admission Notice - 2010 Admission Notification Anna University Anna University Chennai Anna University Question Papers Anna University Trichy Apparel Technology and Management Aptitude Questions Arts and Science Colleges Biomedical Engineering C and CPP Ebooks Calicut University CBSE Question papers Civil Engineering Civil Service Exams Colleges in India Colleges Result Computer Science Engineering Core Jobs CS R2008 CSE CSIR NET EBooks Download ECE EEE EIE Electives Electrical and Electronics Engineering Electronics and communication Electronics and Instrumentation Engineering Engineering Engineering Colleges in Maharashtra Engineering Colleges in TamilNadu Engineering Admissions Engineering Colleges Engineering Colleges in Karnataka Engineering Jobs Engineering Syllabus Entrance Exam Dates Entrance Exam Results Entrance Examination Exam Time Table Experiencer First Year Syllabus Freshers Full Time Jobs Government jobs in india Hardware and Networking Jobs Hotel Management and Catering Technology IGNOU Information Technology INTEVIEW QUESTIONS IT Jobs JNTU Question Papers Jobs in Bangalore Jobs in Chennai Jobs in Coimbatore Jobs in Delhi Jobs in Hyderabad Jobs in India Jobs in Kerala Jobs in Noida Jobs in Tamilnadu Jobs in TATA Karnataka Educations Lab Manuals Mechanical Engineering Medical Colleges Placement Papers Plus 2 Preparation for exams Private Jobs in India Question Papers Question Papers Download Results Announcement Semester 1 Semester 2 Semester 3 Semester 4 Semester 5 Semester 6 Semester 7 Semester 8 Syllabus Syllabus Download Tamil Movie TCS Placement Papers Teaching Jobs TECH MAHINDRA Textile Technology Top colleges University Results UPSC VICEVESVARAYA TECHNOLOGICAL UNIVERSITY waec Walk-in Interview Web Designers

Followers

Archive

 

Privacy Policy
http://topengineeringcollegesintamilnadu.blogspot.com use third-party advertising companies to serve ads when you visit our website. These companies may use information (not including your name, address, email address, or telephone number) about your visits to this and other websites in order to provide advertisements about goods and services of interest to you. If you would like more information about this practice and to know your choices about not having this information used by these companies, click here.