This action might not be possible to undo. Are you sure you want to continue?

BooksAudiobooksComicsSheet Music### Categories

### Categories

Scribd Selects Books

Hand-picked favorites from

our editors

our editors

Scribd Selects Audiobooks

Hand-picked favorites from

our editors

our editors

Scribd Selects Comics

Hand-picked favorites from

our editors

our editors

Scribd Selects Sheet Music

Hand-picked favorites from

our editors

our editors

Top Books

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Audiobooks

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Comics

What's trending, bestsellers,

award-winners & more

award-winners & more

Top Sheet Music

What's trending, bestsellers,

award-winners & more

award-winners & more

P. 1

Questions Chapter Wise|Views: 490|Likes: 5

Published by Saravana Priya

See more

See less

https://www.scribd.com/doc/38825180/Questions-Chapter-Wise

03/08/2015

text

original

/ Name Year / Sem : CS 1201 / Data Structures : II / III UNIT – I FUNDAMENTALS OF ALGORITHMS Part – A (2 Marks) 1. Define Algorithm. 2. Define efficiency of an algorithm. 3. How will calculate the space requirement of an algorithm? 4. How will calculate the time taken by a program? 5. Define Big “Oh” notation. 6. Define Big Theta notation 7. Define Amortized analysis. 8. List out the limitation of asymptotic notation. 9. List common running times for algorithms based on big-oh notations . 10. Define Potential method. 11. What are the methods available for amortized analysis ? 12. Define amortized test. 13. Define dynamic table. 14. What are the properties to be considered in table contraction? PART – B 1. a. Explain briefly about analysis of algorithm b. Derive worst case and average case analysis of insertion sort 2. Explain in detail about asymptotic notation 3. Derive time complexity for matrix addition 4. Explain amortized analysis along with their methods. 5. Explain Performance Analysis. UNIT – II FUNDAMENTALS OF DATA STRUCTURES PART – A (2 Marks) 1. Define ADT. Kings College of Engineering 1 (8) (8) (16) (16) (16) (16)

Define Deque. 5. 6. 11. Define circular queue. Define arrays. What are the different types of Linked list? 10. 2. 5. Define priority Queue. (a) Write a ‘C’ program to add two polynomials. What are the different binary tree traversal techniques? Kings College of Engineering 2 . Define push & pop in a stack. 6. PART – B 1. Define Structure. 2. List out the applications of stack. Write a Program in C to create an empty stack and to push an element into it. 3. 7.CS1201-Data Structures 2. List out the applications of queue. 8. Convert the infix expression a*b/c+d to its equivalent postfix expression. (b) Write a C program to implement push operation in stack. (a) Explain the various types of arrays and their manipulation of data using c with example. Explain how queues can be implemented using Arrays. Define tree. 4. 12. 13. Explain the various applications of stacks. What are the types of binary tree? 4. 4. 3. Write a program in C to return the position of an element X in a Linked List L. List the advantages of circular linked list. List out the operations of the list ADT. Define Binary tree. 9. (16) (16) (16) (8) (8) (16) (8) (8) (16) UNIT – III TREES PART – A (2 Marks) 1. 3. (b) Define structure and union and their implementation with example.

Define a graph. Write a C program to perform Merge sort & analyze time complexity of the algorithm. 4. Define directed graph. PART – B 1. List out some of the stable and unstable sorting techniques. Define undirected graph. Kings College of Engineering 3 (16) (16) (16) (16) (8) (8) (16) (16) . Construct an expression tree for the expression A+(B-C)*D+(E*F). What are the basic operations performed in a binary search tree? 8. (b) State & explain the algorithm to perform Insertion Sort. 4. 12. Write a C program to perform Quick sort & analyze time complexity of the algorithm. 5. UNIT – IV GRAPHS AND THEIR APPLICATIONS PART – A (2 Marks) 1. 11. Define hash function. Write a recursive algorithm for binary tree traversal with an Example 6. Define a binary search tree. Write an Huffman coding with example 7. What are the factors to be considered while choosing a sorting technique? 10. 3. 2. 14. Define hashing. Write a program in C to create an empty binary search tree & search for an element X in it. 7. (a) Write a function to delete the minimum element from a binary heap. Explain in detail about Open Addressing. What are the tasks performed while traversing a binary tree? 6. Define Searching. Mention the limitations of insertion sort. 13.CS1201-Data Structures 5. Define a path in a graph. (16) 2. Define sorting. 9. 8. 3.

(b) Explain shortest path algorithm. State the different ways of traversing a graph. Kings College of Engineering 4 . Define Minimum Spanning Tree. (8) (8) (16) (16) 3. Explain the Dijikstra’s Algorithm for finding the shortest path and find the shortest path from v1 to v6. What is Transitive Closure? How it is implemented? 8. 7. (16) 2. How can you minimum spanning trees from graphs? 13. What is the use of modified Warshall’s Algorithm? 11. PART – B 1.CS1201-Data Structures 5. 6. What is a connected component? 9. Define Shortest Path Problem of a graph. (a) Explain the Warshall’s algorithm. Explain depth-First traversal and breadth-first traversal Explain prim’s algorithm for finding minimum spanning tree for the following graph. Define weighted graph. 10. What is the use of Dijkstra’s Algorithm? 12. 4.

(8) (8) 6. What are types of automatic list management? 2.CS1201-Data Structures 5. How the reference count method works? Kings College of Engineering 5 . What is meant by flow problem? Explain with an example. UNIT –V STORAGE MANAGEMENT PART – A (2 Marks) (16) 1. (b) Explain Kruskal’s Algorithm for finding minimum spanning tree for the following graph. (a) Explain an Application of Scheduling.

6. What is mean by garbage collection? 4.(16) ******************************************************** Kings College of Engineering 6 . PART – B 1. 5. List the disadvantage of reference count method. Define Breadth First Traversal. (16) (16) (16) 4. Explain the term compaction. Define first fit. 3. 2. Explain Reference Count Method with an example. 7.CS1201-Data Structures 3. Explain the Dynamic Memory Management with necessary methods. Explain the linked list Representation of a list with an example. Explain Garbage collection with their variations. How the garbage collection is done in automatic list management? 8.

- Read and print without ads
- Download to keep your version
- Edit, email or read offline

C and Data Structures Unit Wise Important Questions

CS1201- DS-QB

CS2201 Data Structure Tutorial

Cs33- Data Structures Questions and Answers

Rajalakshmi Engineering College. Department of Electrical and Electronics Engineering.

Data Structures

CS2201-QB

IT2201-QB

C Program examples, program list

Are you sure?

This action might not be possible to undo. Are you sure you want to continue?

CANCEL

OK

You've been reading!

NO, THANKS

OK

scribd