Programming for Data Structures and Algorithms Past Paper PDF

**[QUESTION BANK]** Course Name/Code**: Programming for Data structures And Algorithm / U20CSCJ02** **[UNIT I]** [ **PART -- A**] +-----------------------------------+-----------------------------------+ | | 10. **Explain Abstract Data Type | |...

**[QUESTION BANK]** Course Name/Code**: Programming for Data structures And Algorithm / U20CSCJ02** **[UNIT I]** [ **PART -- A**] +-----------------------------------+-----------------------------------+ | | 10. **Explain Abstract Data Type | | | (ADT).** | +===================================+===================================+ | | 1. **Explain the operations of | | | ADT?** | +-----------------------------------+-----------------------------------+ | | 2. **Outline Data Structure?** | +-----------------------------------+-----------------------------------+ | | 3. **Outline the applications of | | | data structures** | +-----------------------------------+-----------------------------------+ | | 4. **Explain** non-linear data | | | structure? Give example. | +-----------------------------------+-----------------------------------+ | | 5. **Explain** linear data | | | structure? Give example. | +-----------------------------------+-----------------------------------+ | | 6. **Show the disadvantages of | | | array-based implementation?** | +-----------------------------------+-----------------------------------+ | | 7. **Outline the advantages of | | | ADT.** | +-----------------------------------+-----------------------------------+ | | 8. **Explain the different forms | | | of representing arithmetic | | | expressions?** | +-----------------------------------+-----------------------------------+ | | 9. Outline the areas in which | | | data structures are applied | | | extensively. | | | | | | **[PART -- B]** | +-----------------------------------+-----------------------------------+ | | 1. **Explain the classification | | | diagram of data structures | | | and write notes on Primitive | | | Data Structures** | +-----------------------------------+-----------------------------------+ | | 2. **Classify the** o**perations | | | on linear Data Structures.** | +-----------------------------------+-----------------------------------+ | | 3. **Compare linear data | | | structures from non-linear | | | data structures.** | +-----------------------------------+-----------------------------------+ | | 4. Explain Linear Data structure | | | with examples | +-----------------------------------+-----------------------------------+ | | 5. Explain Non Linear Data | | | structure with examples | +-----------------------------------+-----------------------------------+ | | 6. Compare list and array. | +-----------------------------------+-----------------------------------+ | | 7. Explain the Built-in Data | | | types with example | +-----------------------------------+-----------------------------------+ | | 8. Explain derived Data types | | | with example | +-----------------------------------+-----------------------------------+ | | 9. Explain Time and Space | | | Complexity of an Algorithms | +-----------------------------------+-----------------------------------+ | | 10. Outline on Asymptotic | | | Notations | +-----------------------------------+-----------------------------------+ **[PART -- C]** +-----------------------------------+-----------------------------------+ | | 7. Explain various types of data | | | structures | +===================================+===================================+ | | 1. Explain in detail analysis of | | | algorithms | +-----------------------------------+-----------------------------------+ | | 2. Outline data abstraction. | | | Write the ADT for the data | | | structure in which the same | | | | | | Condition can used appropriately, | | | for checking overflow and | | | underflow. Define all basic | | | functions of this ADT. | +-----------------------------------+-----------------------------------+ | | 3. Illustrate data structure and | | | give example of each type? | +-----------------------------------+-----------------------------------+ | | 4. Explain the classifications | | | of Asymptotic Notations | +-----------------------------------+-----------------------------------+ | | 5. Summarize the Array? Describe | | | the storage structure of | | | Array. Also Explain Various | | | types of Array in detail. | +-----------------------------------+-----------------------------------+ | | 6. Explain in detail about Built | | | in and derived | | | | | | Data types | +-----------------------------------+-----------------------------------+ **[UNIT II]** **[PART -- A]** +-----------------------------------+-----------------------------------+ | | 10. **Outline the Linked List?** | +===================================+===================================+ | | 1. **Classify the types of | | | Linked Lists?** | +-----------------------------------+-----------------------------------+ | | 2. **Explain singly Linked | | | List?** | +-----------------------------------+-----------------------------------+ | | 3. **Outline the use of header | | | in a linked list?** | +-----------------------------------+-----------------------------------+ | | 4. **Show the Structure | | | definition of Singly** | | | | | | **Linked List.** | +-----------------------------------+-----------------------------------+ | | 5. **Compare Enqueue and | | | Dequeue?** | +-----------------------------------+-----------------------------------+ | | 6. **Outline the basic | | | operations of stack?** | +-----------------------------------+-----------------------------------+ | | 7. **Explain the applications of | | | Circular doubly linked | | | list.** | +-----------------------------------+-----------------------------------+ | | 8. **Show the classifications of | | | queue?** | +-----------------------------------+-----------------------------------+ | | 9. **Classify the different ways | | | to implement priority | | | queue?** | | | | | | [ ] | +-----------------------------------+-----------------------------------+ **[PART -- B]** +-----------------------------------+-----------------------------------+ | | 10. **Compare array and linked | | | list** | +===================================+===================================+ | | 1. **Explain the advantages of | | | linked lists over arrays*?*** | +-----------------------------------+-----------------------------------+ | | 2. **Explain the disadvantages | | | of linked list over array?** | +-----------------------------------+-----------------------------------+ | | 3. **Outline the basic | | | operations that can be | | | performed on a stack** | +-----------------------------------+-----------------------------------+ | | 4. **Compare stack and queue | | | with Example** | +-----------------------------------+-----------------------------------+ | | 5. **Outline the applications of | | | doubly linked list.** | +-----------------------------------+-----------------------------------+ | | 6. **Compare singly linked list | | | with doubly linked list.** | +-----------------------------------+-----------------------------------+ | | 7. **Summarize some applications | | | of stack.** | +-----------------------------------+-----------------------------------+ | | 8. **Illustrate the difference | | | between Linear Linked List | | | and Circular Linked List.** | +-----------------------------------+-----------------------------------+ | | 9. **Explain a Priority Queue | | | mean?** | +-----------------------------------+-----------------------------------+ **[PART -- C]** +-----------------------------------+-----------------------------------+ | | 1. Summarize about stack ADT in | | | detail. Explain any one | | | application of stack. | +===================================+===================================+ | | 2\. Explain an algorithm to | | | perform following operations in | | | a doubly linked list. | | | | | | 1\) Insert a node at the end of | | | the list | | | | | | 2\) Delete the last node in the | | | list. | +-----------------------------------+-----------------------------------+ | | | +-----------------------------------+-----------------------------------+ | | 4\. Explain the insertion | | | operation in linked list. How | | | nodes are inserted after a | | | specified node. | +-----------------------------------+-----------------------------------+ | | 5\. Demonstrate an algorithm for | | | Push and Pop operations on | | | Stack using Linked list | +-----------------------------------+-----------------------------------+ | | 6\. Explain the linked list | | | implementation of stack ADT in | | | detail? | +-----------------------------------+-----------------------------------+ | | 7\. Outline about DeQueue? | | | Explain its operation with | | | example? | +-----------------------------------+-----------------------------------+ **[UNIT III]** **[PART -- A]** +-----------------------------------+-----------------------------------+ | | 10. **Construct a Tree. Give an | | | example.** | +===================================+===================================+ | | 1. **Make use of a path in a | | | tree.** | +-----------------------------------+-----------------------------------+ | | 2. **Construct a Binary Tree ADT | | | with an example.** | +-----------------------------------+-----------------------------------+ | | 3. **Make use of Traversal** | +-----------------------------------+-----------------------------------+ | | 4. **Develop a Binary Search | | | Tree.** | +-----------------------------------+-----------------------------------+ | | 5. **Develop a balanced search | | | tree.** | +-----------------------------------+-----------------------------------+ | | 6. **Make use of AVL tree** | +-----------------------------------+-----------------------------------+ | | 7. **Identify the drawbacks of | | | AVL trees?** | +-----------------------------------+-----------------------------------+ | | 8. **Develop a B-tree?** | +-----------------------------------+-----------------------------------+ | | 9. **Make use of splay tree.** | +-----------------------------------+-----------------------------------+ **[PART -- B]** [ ] +-----------------------------------+-----------------------------------+ | | 10. **Develop node, degree, | | | siblings, depth/height, | | | level** | +===================================+===================================+ | | 1. **Utilize some applications | | | of Trees.** | +-----------------------------------+-----------------------------------+ | | 2. **Build the properties of a | | | Binary Tree.** | +-----------------------------------+-----------------------------------+ | | 3. **Construct AVL rotation. | | | Mention the two types of | | | rotations** | +-----------------------------------+-----------------------------------+ | | 4. Develop an algorithm for | | | traversal in the binary tree. | +-----------------------------------+-----------------------------------+ | | 5. Identify the types of | | | representation of binary | | | tree? | +-----------------------------------+-----------------------------------+ | | 6. Construct detail about splay | | | trees and its rotations | +-----------------------------------+-----------------------------------+ | | 7. Make use of B Tree and B+ | | | Tree. | +-----------------------------------+-----------------------------------+ | | 8. Build the given tree using | | | Inorder, Preorder, Postorder | | | traversal | +-----------------------------------+-----------------------------------+ | | 9. Develop C functions to | | | perform deletion in Binary | | | search tree | +-----------------------------------+-----------------------------------+ **[PART -- C]** [ ] +-----------------------------------+-----------------------------------+ | | 7. Construct the AVL tree | | | insertion and deletion with | | | suitable example | +===================================+===================================+ | | 1. Make use of algorithms used | | | to perform single and double | | | rotation on AVL tree. | +-----------------------------------+-----------------------------------+ | | 2. Develop B-Tree with suitable | | | example. | +-----------------------------------+-----------------------------------+ | | 3. Utilize the tree traversal | | | techniques with an example. | +-----------------------------------+-----------------------------------+ | | 4. Build the insert and delete | | | an element into a binary | | | search tree and write down | | | the code for the insertion | | | routine with an example. | +-----------------------------------+-----------------------------------+ | | 5. Build a binary search tree | | | for the following numbers | | | start from an empty binary | | | search tree. | | | 45,26,10,60,70,30,40 Delete | | | keys 10,60 and 45 one after | | | the other and show the trees | | | at each stage. | +-----------------------------------+-----------------------------------+ | | 6. Build a Binary search tree | | | and construct a Binary search | | | Tree for the following | | | sequence of | | | numbers:45,36,76,23,89,115,98 | | | ,39,41,56,69,48. | +-----------------------------------+-----------------------------------+ **[UNIT IV]** **[PART -- A]** +-----------------------------------+-----------------------------------+ | | 10. Develop sorting and types of | | | sorting | +===================================+===================================+ | | 1. Make use of internal and | | | external sorting? | +-----------------------------------+-----------------------------------+ | | 2. Develop a bubble sort | +-----------------------------------+-----------------------------------+ | | 3. Utilize the insertion sort | | | with the array? | +-----------------------------------+-----------------------------------+ | | 4. Build the steps for selection | | | sort? | +-----------------------------------+-----------------------------------+ | | 5. Make use of shell sort? | +-----------------------------------+-----------------------------------+ | | 6. Build the steps for quick | | | sort? | +-----------------------------------+-----------------------------------+ | | 7. Identify the advantages and | | | Disadvantages of insertion | | | sort | +-----------------------------------+-----------------------------------+ | | 8. Make use of hashing function | +-----------------------------------+-----------------------------------+ | | 9. Develop the importance of | | | hashing | +-----------------------------------+-----------------------------------+ **[PART -- B]** +-----------------------------------+-----------------------------------+ | | 10. Build the process of | | | selection sort | +===================================+===================================+ | | 1. Construct Sort | | | 20,35,40,100,3,10,15 using | | | insertion sort. | +-----------------------------------+-----------------------------------+ | | 2. Build the function in C for | | | insertion sort? | +-----------------------------------+-----------------------------------+ | | 3. Build the function in c for | | | shellsort? | +-----------------------------------+-----------------------------------+ | | 4. Make use of Extendible | | | Hashing and Rehashing? | +-----------------------------------+-----------------------------------+ | | 5. Construct the Sort for the | | | following data using | | | selection sort. Data: 5, 6, | | | 1, 8,2,9,10,15,7,13 what is | | | hash value? Explain any three | | | methods used to find hash | | | value. Draw binary search | | | tree for 10(root), 20, 4, 6, | | | 70, 40, 30, 60. | +-----------------------------------+-----------------------------------+ | | 6. Develop a program in C to | | | sort 10 element using | | | insertion sorts. | +-----------------------------------+-----------------------------------+ | | 7. Utilize the four types of | | | Hash Table. Explain any one | | | in brief. | +-----------------------------------+-----------------------------------+ | | 8. Make use of two advantages of | | | Radix Sort and Insertion | | | Sort. | +-----------------------------------+-----------------------------------+ | | 9. Develop linear probing method | | | with suitable example. | +-----------------------------------+-----------------------------------+ **[PART -- C]** [ ] +-----------------------------------+-----------------------------------+ | | 7. Make use of an algorithm to | | | implement Bubble sort with | | | suitable example | +===================================+===================================+ | | 1. Develop an algorithm to | | | implement insertion sort with | | | suitable example | +-----------------------------------+-----------------------------------+ | | 2. Construct an algorithm to | | | implement selection sort with | | | suitable example. | +-----------------------------------+-----------------------------------+ | | 3. Identify how to sort the | | | elements by using insertion | | | sort and derive time | | | complexity for the same. | +-----------------------------------+-----------------------------------+ | | 4. Develop an algorithm to | | | implement merge sort with | | | suitable example | +-----------------------------------+-----------------------------------+ | | 5. Identify how to sort the | | | elements by using selection | | | sort and derive the time | | | complexity for the same. | +-----------------------------------+-----------------------------------+ | | 6. Develop a procedure for | | | sorting a given list of | | | elements using Quick sort | | | method. Show the division of | | | the list in the quick sort | | | for a list of 10 numbers | | | | | | **[UNIT V]** | +-----------------------------------+-----------------------------------+ **[PART -- A]** +-----------------------------------+-----------------------------------+ | | 10. Analyze the Graph. | +===================================+===================================+ | | 1. Compare the directed graph | | | and an undirected graph? | +-----------------------------------+-----------------------------------+ | | 2. Distinguish BFS and DFS. | +-----------------------------------+-----------------------------------+ | | 3. Analyze the Activity node | | | graph | +-----------------------------------+-----------------------------------+ | | 4. Examine the shortest path? | +-----------------------------------+-----------------------------------+ | | 5. Analyze the biconnectivity | +-----------------------------------+-----------------------------------+ | | 6. Categorize the two traversal | | | strategies used in traversing | | | a graph | +-----------------------------------+-----------------------------------+ | | 7. Examine the graph when it | | | said to be weakly connected? | +-----------------------------------+-----------------------------------+ | | 8. Analyze strongly connected in | | | a graph? | +-----------------------------------+-----------------------------------+ | | 9. Compare a simple graph and | | | weighted graph? | +-----------------------------------+-----------------------------------+ **[PART -- B]** [ ] +-----------------------------------+-----------------------------------+ | | 10. Categorize any two | | | representations of graphs? | | | What do you mean by in-degree | | | and out-degree of a graph? | +===================================+===================================+ | | 1. Analyze an algorithm for | | | Topological Sort of a graph.  | +-----------------------------------+-----------------------------------+ | | 2. Discover the various ways in | | | which a graph can be | | | represented bringing out the | | | advantages and disadvantages | | | of each representation. | +-----------------------------------+-----------------------------------+ | | 3. Analyze a procedure to do DFS | | | in a graph. | +-----------------------------------+-----------------------------------+ | | 4. Discover the algorithm for | | | BFS graph traversal. | +-----------------------------------+-----------------------------------+ | | 5. Discover the algorithm for | | | DFS and Demonstrate DFS using | | | suitable example. | +-----------------------------------+-----------------------------------+ | | 6. Categorize the various graph | | | traversal techniques | +-----------------------------------+-----------------------------------+ | | 7. Examine strongly connected | | | components? | +-----------------------------------+-----------------------------------+ | | 8. Discover about Biconnectivity | +-----------------------------------+-----------------------------------+ | | 9. Analyze an algorithm for | | | Topological Sort of a graph | +-----------------------------------+-----------------------------------+ **[PART -- C]** [ ] +-----------------------------------+-----------------------------------+ | | 7. Categorize the various | | | representation of graph with | | | example in detail? | +===================================+===================================+ | | 1. Discover Breadth First Search | | | algorithm with example? | +-----------------------------------+-----------------------------------+ | | 2. Compare Depth first and | | | breadth first traversal? | +-----------------------------------+-----------------------------------+ | | 3. Analyze an algorithm to | | | determine the biconnected | | | components in the given | | | graph. | +-----------------------------------+-----------------------------------+ | | 4. Classify the various | | | applications of Graphs. | +-----------------------------------+-----------------------------------+ | | 5. Examine how to represent | | | graph storage using Adjacency | | | matrix | +-----------------------------------+-----------------------------------+ | | 6. Assume any algorithm for all | | | pairs shortest path problem. | +-----------------------------------+-----------------------------------+