QUESTION BANK. Prepared by,mrs.d.maladhy AP/IT,RGCET. Page 1

Transcription

1 UNIT I 1.Write statements to declare integer Pointer and Float Pointer. Also write the statement to convert float pointer.(apr/may 2016) 2. What is a Stack? Mention the order followed to add or delete an element. (APR/MAY 2016) 3. What is meant by Underflow? (APR/MAY 2016) 4.Define ADT. (APR/MAY 2016) 5.Define Sparse Matrix with an example(apr/may 2016) 6.Write down the applications of Stack(APR/MAY 2016) 7.What do you mean by multilinked list?give example(apr/may 2016) 8.Convert the given expression into postfix from (a*b)+(c*d)/e. (APR/MAY 2016) 9.What do you mean by multilinked list(apr/may 2016) 10.Define ADT(NOV 2015) 11.List some applications of stack(nov 2015) 12.Distinguish Linear DataStructures and primitive Datastructures with examples. (NOV 2015) 13.Write the procedure to delete the last element of a singly linked list(nov 2015) 14.How circular List is Implemented?(NOV/DEC 2014) 15.State any two applications of linked list. (NOV/DEC 2014) 16.State the operations performed in using stack and queue(nov/dec 2014) 17.What is Circular Linked List(APR 2016) 1.Give the detailed description on Postfix operation illustrate with an expression.also write the program to evaluate it. (APR/MAY 2016) 2.Summarize the concept of recursion with tower of Hanoi Problem(APR/MAY 2016) 3.Given two polynomial expression A(x)=6x 3 +8x 2-3x+2,B(x)= -2x 3 +4x-8 Explain the following: a)data Structure for representing A(x),B(x) b)addition of A(x),B(x). (APR/MAY 2016) Page 1

2 4.Explain about the linked list representation of various Stack operations. (APR/MAY 2016) 5.Explain about various operations in a doubly linked list with pseudo codes and neat diagrams. (APR/MAY 2016) (NOV/DEC 2016) 6.Write an algorithm to convert infix expression to postfix expressions with an example(nov 2015) 7.Write an algorithms to perform the following operations on a singly linked list (NOV 2015) (NOV/DEC 2016) (APR 2016) a)insert new node at beginning b)insert new node at middle c)delete node at last d)count the number node 8.What are primitive data structure and Linear data Structures?Illustrate with examples.also explain the significance of Abstract Data structures and its uses. (NOV/DEC 2014) 9.State and explain the algorithm used to perform addition of two polynomials using Linked list(nov/dec 2014) 10.Explain the representation of polynomials and sparse matrices with an application of its uses. (NOV/DEC 2014) 11.What is a stack?explain two different representations of stack.list the operations performed on a stack and write functions for implementing these operations. (NOV/DEC 2014) (NOV/DEC 2016) (APR 2016) 12.Compare singly and doubly linked list to perform insertion and deletion operations(nov/dec 2014) 13.List the application of Stack(APR 2016) UNIT II 1. Distinguish Ascending Priority Queue and Descending Priority Queue(APR/MAY 2016) 2. What is circular Queue.( NOV 2015) 3. What do you mean by priority queue.( NOV 2015) (APR 2016) 4. Define Dequeue(APR 2016) 5. Write down applications of queue? Page 2

3 6. What is circular queue? Give its advantages? 7. How to delete an element at the beginning of Dequeue 8. Define Input restricted Dequeue 9. Define Output restricted Dequeue 10. Write the conditions to test Queue is empty, queue is full for a linear queue implemented in linear array. (NOV/DEC 2014) 11. Difference between Queue and Double Ended Queue(NOV/DEC 2016) 1.Give a detailed note on queue using linked list.also narrate the procedure for inserting and deleting nodes from a list with suitable illustration. (APR/MAY 2016) 2.With C++ program,excplain the various manipulations that can be applied to a queue. (APR/MAY 2016) 3.Explain about double ended queues and their operations. (APR/MAY 2016) 4.Explain the operations of priority queue..( NOV 2015) (NOV/DEC 2016) 5.Write an algorithm for insertions and deletion operations in a circular queue..( NOV 2015) (NOV/DEC 2014) 6. Explain circular queue with suitable example. (NOV/DEC 2016) (APR 2016) 7.Explain any two applications of queues. (NOV 2015) (NOV/DEC 2016) 8.with example explain priority queue and Double ended Queue. (NOV 2015) (NOV/DEC 2014) 9.Give the limitations of Queue(APR 2016) UNIT-III 1.Define the term, Completely binary tree (APR/MAY 2016) 2.What is an AVL Tree?Write its running time. (APR/MAY 2016) 3. Write about AVL rotations. (APR/MAY 2016) 4. Write down the array implementations of binary trees. (APR/MAY 2016) Page 3

4 5.Define Binary search tree..( NOV 2015) 6.Differentiate B-Tree and B+ Tree.( NOV 2015) (NOV/DEC 2014) (NOV/DEC 2016) 7. What is a tree? 8.Define the following terminologies in tree? 9.Define binary tree and write down its node declarations? 10.List some of the possible types of binary Tree? 11.Consider the following binary search tree(nov/dec 2014) D B F A E G Reconstruct the binary tree after deleting the character D 12. Differentiate B-Tree and Trie indexing (NOV/DEC 2014) 13. Write a pseudocode to print the values at the leaf nodes of a binary tree that is stored in an array. (NOV/DEC 2014) 14. What is Tries Structure(NOV/DEC 2016) 15. Perform RR rotation in AVL tree with an example(apr 2016) 16. Give some of the applications of B-Tree(APR 2016) 1. Compare and contrast B-tree with B+tree through suitable examples. (APR/MAY 2016) 2. List down the various tree traversal notation and explain with examples and program segments (APR/MAY 2016) (NOV/DEC 2016) 3. Explain with neat diagram, the insertion operation in BST. (APR/MAY 2016) (NOV/DEC 2016) 4. Explain about various binary tree traversals with neat diagram. (APR/MAY 2016) (NOV/DEC 2016) 5. Construct an expression tree for the expression.( NOV 2015) A+(B-C)*D+(E*F) 6.Explain in detail about the insertion into AVL Tree..( NOV 2015) (NOV/DEC 2016) Page 4

5 7.Discuss Trie indexing.construct a Trie structute for the following list of words: (NOV 2015) BEGIN,BALL,CALL,CHIEF,DALL,DEMAND,ELSE,ELEPHANT,END,FREE,FORMAT. 8.a)Show the stages of growth of an order 4 B-Tree when the following keys are inserted in the order given as 84,82,29,99,65,12,50,28,58,71,92,75,19,55.( NOV 2015) b)show the changes in the B-Tree constructed by 8.a) when the following keys are deleted in the given order 28,50,75.( NOV 2015) 9.a)Construct an AVL tree for the following set of numbers 1,2,3,4,5,6,7,8,9,10,11,12,13.( NOV 2015) b)write tha algorithm for AVL tree construction and discuss a applications of AVL tree..( NOV 2015) 10.Traverse the given tree using inorder,preorder and postorder traversal. (APR 2016) compare binary tree and binary search tree with example. (APR 2016) 12.Insert the numbers into a binary search tree 8,5,10,15,20,18,3. (APR 2016) UNIT-IV 1.Write the difference between internal sorting and external sorting. (APR/MAY 2016) 2.Define max heap.also write the time complexity of heapsort. (APR/MAY 2016) 3. What is the basic idea of shell sort.( NOV 2015) 4..How will you measure the efficiency of sorting.( NOV 2015) 5. What is the average efficiency of heap sort? (NOV/DEC 2016) 6. Name some of the external sorting methods? 7. Sort the following using radix sort(nov/dec 2016) Page 5

6 23,17,31 8. What is the main idea behind merge sort? 9.List any four applications of Data Sorting(NOV 2014) 10.Sort the following set of numbers using Heap sort. (NOV 2015) 90,100,20,12,50,15,45 11.Specify the Time Complexity of insertion sort and merge sort(nov/dec 2016) 12.Write the worst case and best case analysis of merge sort.. (APR 2016) 13.List the advantages of quick sort.. (APR 2016) 1. With program coding,explain the procedure of doing bubble sort for a given set of n numbers. (APR/MAY 2016) (NOV/DEC 2016) 2. Explain the concept of radix sort with suitable example and program(apr/may 2016) 3. State and explain the algorithm of Heap Sort.Also analyse the complexity.( NOV 2015) (NOV/DEC 2016). (APR 2016) 4. State and explain the algorithm of Quick Sort.Also analyse the complexity.( NOV 2015) (NOV/DEC 2016). (APR 2016) 5. What is the mechanism behind merge sort? Discuss the algorithm along with its complexity. 6. Write down the insertion sort algorithm with example. Discuss the best, average and worst case analysis of the same. (APR 2012) 7. Compare and contrast the four sorting techniques, bubble sort, quick sort, merge sort and radix sort. (APR 2011) 8. Discuss the shell sort and radix sort with a neat example. (NOV/DEC 2014) Page 6

7 UNIT-V 1.What is meant by hash collision?name the methods that are used to deal in crisis. (APR/MAY 2016) 2.Write the condition of a spanning forest for a given graph(apr/may 2016) 3.Define Spanning Tree. (APR/MAY 2016) 4.What is Hash table..( NOV 2015) 5.Define the terms of BFS and DFS..( NOV 2015) 6. Write the two applications of graph.( NOV 2015) 7. Write limitations of hash table.( NOV 2015) 8. What do you mean by collision in hashing? 9.What are the collision resolution methods? 10.What do you mean by separate chaining? 11.Write the advantage of separate chaining? 12.What are the types of collision resolution strategies in open addressing? (NOV/DEC 2014) 13.What do you mean by Probing? 14.What do you mean by quadratic probing? 15.What do you mean by double hashing? 16.List the limitations of linear probing 17.List the needs of for non-linear data structures.give the representation used for graph data Structure..( NOV 2014) 18.Give the merits and demerits of depth first search. (NOV/DEC 2014) 19.Define Topological sorting(nov/dec 2014) (NOV/DEC 2016) 20.Mention any two hashing functions(nov/dec 2016) Page 7

8 21.Give the adjacency matrix for the following directed graph.. (APR 2016) V1 V2 V4 V3 1.Describe the concept of hash function.also explain any two hash methods in detail. (APR/MAY 2016) 2.Give a detailed note on Depth first search traversal with suitable example and program(apr/may 2016) 3.Explain the Minimum Spanning Tree.( NOV 2015) 4.Explain the various application of Depth First Search.( NOV 2015) 5. Give a detailed note on Graph traversal with suitable example and program(apr/may 2016) 6. Explain single source shortest path (Dijikstra) algorithm. 7.What is a minimum spanning tree? How is it related to finding the shortest paths? State the implementation of Prim s algorithm for minimum spanning tree. (APR 2011) (NOV/DEC 2014) 8.Find the minimum cost spanning tree for given graph using Kruskal s algorithm. (NOV/DEC 2016) 9.Define hash function. Explain the routine for simple hash function. (NOV/DEC 2014) 10.Discuss in detail the issues in hash tables. (APR 2012) 11.What do you mean by hashing? Explain the various hashing functions. (NOV 2011) 12.Explain open addressing collision resolution technique: a. Linear probing b. Quadratic probing c. Double hashing 13.Explain the routines for separate chaining hash table. 14.Classify hashing functions and explain each with an example. (NOV/DEC 2014) Page 8

9 15.Explain the two graph traversal methods with its algorithm(nov/dec 2016) 16.Explain any two representations of graph(nov/dec 2016) 17.Write the routine for performing breadth first search. (APR 2016) 18.What do you mean by topological sorting?write the routine to perform topological sorting with example. (APR 2016) Page 9