Scribd
Upload
81 views2 pages

Important Questions

This document contains a summary of 10 units covering fundamental data structures and algorithms topics. It includes definitions and examples of algorithm analysis, sorting algorithms, hash tables, stacks, queues, linked lists, binary trees, binary search trees, and AVL trees. Operations for each data structure are provided along with examples of insertion, deletion and traversal.

Uploaded by

santhosh naidu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
81 views2 pages

Important Questions

This document contains a summary of 10 units covering fundamental data structures and algorithms topics. It includes definitions and examples of algorithm analysis, sorting algorithms, hash tables, stacks, queues, linked lists, binary trees, binary search trees, and AVL trees. Operations for each data structure are provided along with examples of insertion, deletion and traversal.

Uploaded by

santhosh naidu
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

UNIT - 1

1. Define an algorithm. Describe commonly used asymptotic notations and give their
Significance.
2. Write about a priori analysis used to find efficiency of algorithm.
3. Explain with an example polynomial Vs exponential algorithms.
4. Distinguish between best, worst and average case complexities of the linear search
algorithm.
5. Write an algorithm to search an element in an array using Fibonacci search.
6. Write an algorithm for binary search, Use the algorithm to search 32 in the following list
of elements. Explain the process in each step 12,16,17,19,20,22,24,29,30,32,37.
7. Compare the advantages and disadvantages of bubble, insertion and selection sort using
the
Following list of numbers. 23, 56, 14, 34, 58, 97, 72, 69, 36. With time complexity.
8. . What is Hashing? Explain Different Hash function method in detail. Explain each one
9. Draw a hash table with size of 9. Use division method as hash function Insert the keys: 5,
29, 20, 0, 27 and 18 into your table (in that order). And use open addressing to resolve the
collision.
a. linear probing b. quadratic probing c. double hashing

UNIT - II

1. What is Stack? Why it is known as LIFO? Write algorithm of PUSH, POP, and
TOP/PEEP operation on Stack.
2. What is the principle of queue? Write algorithm of ENQUEUE and DEQUEUE
operations on queue.
3. Consider a circular queue of size 5. Perform the following operations in the specified
order and write front & rear values after every operation and also display the contents
i) Insert 10, 20, and 30 and ii) delete 2 elements
iii) Insert 50, 60, 70 and 80 IV) delete 2 elements
4. Write a program to create a circular queue using array and perform insertion, deletion,
and traversing operations.
5. List out and Briefly explain the “types of queues” and “applications of queues”.
6. Differentiate between stack and Queues.
7. Write an algorithm to convert the expression, into Postfix form and trace the algorithm
for the infix expression (A+(B/C*D)-E^F)*G
8. Write the algorithms for postfix evaluation. Evaluate the following post fix expression. 5
6 2 + * 8 4 /- using stack.
9. What are priority queues? Explain

Note: read the lab programs implementing stack, queue and circular queue using arrays.
UNIT – III

1. Explain the drawbacks of sequential Data Structures ( ARRAYS ) and merits of linked
Data Structures(LINKED LISTS) with neat sketches
2. What are the advantages, disadvantages and applications of Linked Lists?
3. Write a program to print the elements in a reverse order in a singly linked list.
4. Write a program to implement stack using a linked list.
5. Explain about the implementation of operations on linked queue.
6. Write an algorithm to reverse a given singly linked list.
7. What are the advantages of doubly linked list over singly linked list? Explain the
applications Of doubly linked lists?
8. What are the operations of a singly linked list? Discuss. (READ THE INSERTION,
DELETION, TRAVERSE AND SEARCH OPEARIONS WITH NEAT PICTORIAL
REPRESENTATIONS).
9. Write a program to implement circular linked list.
10. How do you perform insertion and deletion operations in double linked list? Explain with
Examples.

UNIT - IV

1. Explain various representations of binary trees. (Array representations, linked lists


representations)
2. Explain the Following with neat Example
i) Binary Tree ii) Full Binary Tree iii) Complete Binary Tree
3. Explain about the binary tree traversing techniques.
4. Construct a binary tree for the following in order and preorder traversals
In order: FDHGIBEAC Preorder: ABDFGHIEC
5. What is the difference between Binary Tree and Binary Search Tree? List the
disadvantages of Binary Search Tree giving Examples.
6. With the help of the diagrams construct a binary search tree (BST) with the following
keys: 86,12,42,69,38,57,74,6,49,71. Also delete 42 from the constructed BST.
7. How a node can be deleted from the Binary Search Tree? Explain the method?
8. Give the rotations in the AVL tree when the element has to be inserted.
9. How does the height balance condition managed in AVL tree while insertion, deletion
operations.
10. What is an AVL tree? Construct an AVL tree for the following data:
{55,30,40,10,80,70,65,35,20,15,90}

Please read the 5th unit completely with graph terminology, algorithms and solve one or
two random problems to understand the concepts.

You might also like