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

Welcome to Scribd! Start your free trial and access books, documents and more.Find out more

**DEPARTMENT OF INFORMATION TECHNOLOGY
**

Subject: DATA STRUCTURES AND ALGORITHMS(IT2201) YEAR/SEM : II Year/ III sem

Question Bank

UNIT I – LINEAR STRUCTURES(2 MARKS) 1. Define ADT. 2. Give the structure of Queue model. 3. What are the basic operations of Queue ADT? 4. What is Enqueue and Dequeue? 5. Give the applications of Queue. 6. What is the use of stack pointer? 7. What is an array? 8. Define ADT (Abstract Data Type). 9. Swap two adjacent elements by adjusting only the pointers (and not the data) using singly linked list. 10. Define a queue model. 11. What are the advantages of doubly linked list over singly linked list? 12. Define a graph 13. What is a Queue? 14. What is a circularly linked list? 15. What is linear list? 16. How will you delete a node from a linked list? 17. What is linear pattern search? 18. What is recursive data structure? 19. What is doubly linked list?

PART- B (16 MARKS)

1. Explain the implementation of stack using Linked List. 2. Explain Prefix, Infix and postfix expressions with example. 3. Explain the operations and the implementation of list ADT. 4. Give a procedure to convert an infix expression a+b*c+(d*e+f)*g to postfix notation 5. Design and implement an algorithm to search a linear ordered linked list for a given alphabetic key or name. 6. (a) What is a stack? Write down the procedure for implementing various stack operations(8) (b) Explain the various application of stack? (8)

What is Pre order traversal? 6. What is Post order traversal? 7. A full node is a node with two children. (a) Given two sorted lists L1 and L2 write a procedure to compute L1_L2 using only the basic operations (8) (b) Write a routine to insert an element in a linked list (8) 8. Define (i) inorder (ii) preorder (iii) postorder traversal of a binary tree. How a binary tree is represented using an array? Give an example 17. can both insert and find min be implemented in constant time? 20. What is meant by depth first order? 4. and removes the minimum element in the priority queue. Give the prefix. 19. Explain Tree concept? 2. which finds. 12. 8. Suppose that we replace the deletion function. 11. 10. Explain the implementation of different Hashing techniques. Define AVL trees. 18. 13. What is meant by traversal? 3. What is a queue? Write an algorithm to implement queue with example. Define Hashing. . Define Double Hashing. What is meant by Binary Heap? 14. 2. UNIT II – TREE STRUCTURES(2 MARKS) 1. What is binary search tree? PART B (16 MARKS) 1. infix and postfix expressions corresponding to the tree given in figure. return. with find min. Prove that the number of full nodes plus one is equal to the number of leaves in a non empty binary tree. What is an expression tree? 21.7. Explain the operation and implementation of Binary Heap. Mention some applications of Priority Queues. What is In order traversal? 5. Define complete binary tree. Define Binary tree. What is meant by BST? 9. 3. Give example for single rotation and double rotation. 16. 15.

(4) 6. Given input {4371. Explain in detail (i) Single rotation (ii) double rotation of an AVL tree. Explain the efficient implementation of the priority queue ADT 8.9679. (a) How do you insert an element in a binary search tree? (8) (b) Show that for the perfect binary tree of height h containing2h+1-1 nodes.6173. (8) 5. the sum of the heights of the nodes 2h+1 -1-1(h+1).4199.1323.1989} and a hash function h(X)=X(mod10). show the resulting: (a) Separate chaining table (4) (b) Open addressing hash table using linear probing (4) (c) Open addressing hash table using quadratic probing (4) (d) Open addressing hash table with second hash function h2(X) =7-(X mod 7). 7.4344. Explain how to find a maximum element and minimum element in BST? Explain detail about Deletion in Binary Search Tree? .4.

Define Graph. What is meant by Shortest Path Algorithm? 7. 4. UNION(A. Define minimum spanning tree . 11011011. 6. Define NP. A) g. 4. 10010110. What is minimum spanning tree? 10. MEMBER(1. MIN(A)? UNIT IV – GRAPHS PART A (2 MARKS) 1. 00000010. 11. What is meant by Dijkstra’s Algorithm? 9. 3. What is meant by directed graph? 3. 2.B.complete problems 12. 3} and B = {3. 10111110. C) b. UNIT III. Give a diagrammatic representation of an adjacency list representation of a graph. A) e. 9. DELETE(1. What is topological sort? 14. 8. DIFFERENCE(A. B. 2. 5}. Describe in detail the basic operations on sets. what are the results of a. 10011110. 10011011. What is meant by Single-Source Shortest path problem? 8. What is breadth-first search? 15. 10. 11110000. A) f. B. 5. 2. What is meant by acyclic graph? 6. 01010001. 4.1. Show the result of inserting the keys 10111101. INTERSECTION(A. C) c. 7. INSERT(1. 00001011. 01101111 into an initially empty extendible hashing data structure with m = 4. What is space requirement of an adjacency list representation of a graph 13. What is meant by topological sort? 5. 11001111. 01100001. Mention the types of algorithm. If A = {1.HASHING AND SETS What is hashing? What is Collision? What is open addressing? What is a hash function? What is separate chaining? What is linear probing? Explain Hashing. 00101011. 01111111. C) d.

16. Define undirected graph What is depth-first spanning tree What is Bi connectivity? What is Euler Circuit? What is a directed graph? What is meant by ‘Hamiltonian Cycle’? Define (i)indegree (ii)outdegree PART . What is dynamic programming? 7. 21. 5. Write an algorithm to exchange the values of two variables 9 Write an algorithm to find N factorial (written as n!) where n>=0. Write an algorithm to find the factorial of a given number? 4. What is meant by algorithm? What are its measures? 2. 3. Give any four algorithmic techniques. Explain how to find shortest path using Dijkstra’s algorithm with an example. 19. Define the worst case & average case complexities of an algorithm 5.B (16 MARKS) 1. 6. Write at least five qualities & capabilities of a good algorithm 8. Explain Prim’s & Kruskal‘s Algorithm with am example. What is divide & conquer strategy? 6. Describe Dijkstra’s algorithm with an example. Explain in detail the simple topological sort pseudo code 7. 18. Explain the application of DFS. 3. 4. Write notes on NP-complete problems 1. PART B (16 MARKS) UNIT V – ALGORITHM DESIGN AND ANALYSIS PART A (2 MARKS) . 22. 2. Find a minimum spanning tree for the graph using both Prim’s and Kruskal’s algorithms. 20. 17.

1. 4. (a) Explain in detail the types on analysis that can be performed on an algorithm (8) (b) Write an algorithm to perform matrix multiplication algorithm and analyze the same (8) 2. Explain in detail about Greedy algorithm with an example(16). Explain in detail about Divide and conquer algorithm with an example also mark the difference between Greedy and divide and conquer algorithm. 3. 13. 5. Describe the backtracking problem using knapsack problem . 8.1. Write an algorithm to generate and print the first n terms of the Fibonacci series where n>=1 the first few terms are 0. Explain the Base conversion algorithm to convert a decimal integer to its corresponding octal representation. .(16). 1.(16). 6. 8. Design an algorithm to evaluate the function sin(x) as defined by the infinite series expansion sin(x) = x/1!-x3/3! +x5/5!-x7/7! +…… 3. 2. 7. 5. Design an algorithm that accepts a positive integer and reverse the order of its digits.

- Branch-And-bound Procedure for the Multi-mode Resource-constrained Project Scheduling Problem With Minimum and Maximum Time Lags
- Adv Algorithms
- Brandon
- 7 Deadlock
- A List Based Threshold Accepting Algorithm for Capacitated VRP
- lec-1 (1)
- Algorithmic and Architectural Optimization of a 3D Reconstruction Medical Images Algorithm for a Hardware Implementation
- Algorithms in Everyday Mathematics
- CS271 AI Final Project
- The Client Assignment Problem for Continuous Distributed Interactive Applications Analysis, Algorithms, And Eva
- Module a Power Point > ModA1_ch09_eng
- Report
- Low-Energy Symmetries on Machine Learning
- Investigation of I/O Automata
- Analysis of Threshold Based Centralized Load Balancing Policy for Heterogeneous Machines
- A Case of Redundancy
- Circulated Mutual Key Agreement and Verification Procedure for Active Peer Groups_Abstract
- ch11.ppt
- Tapiser Highly-Available, Relational Modalities
- p117-andoni
- 1-s2.0-S0957415805001376-main
- Implementation of Decision Tree Algorithm After Clustering Through Weka
- Decoupled Newton Load Flow
- IJCSE12-04-07-101
- Proficient Path Optimization by Fusion of Intelligent Water Drop and Ford-Fulkerson’s Algorithm in VANET Milieu
- Problem Solving 3 Logic
- lecture27-closures.pdf
- IJETTCS-2013-12-30-003
- Signature Tree Generation
- data structure basic and sorting

Are you sure?

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

We've moved you to where you read on your other device.

Get the full title to continue

Get the full title to continue reading from where you left off, or restart the preview.

scribd