Scribd
Upload
9 views4 pages

Important Question

Uploaded by

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

Important Question

Uploaded by

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

Q1

(A) Define Abstract Data Type? (ADT) (2 marks)


(B ) Differentiate between linear and non-linear data structures with examples. ?(2 marks)
(C) Differentiate between a Stack and a Queue.? (2 marks)
(D) What is recursion? Give an example ? (2 marks)
(E) What is a hash function? Describe its purpose in hashing. (2 marks)
(E ) What is a leaf node in a binary tree? (2 marks)
(F) Define an A-tree. What is its primary purpose in data structures? (2 marks)
(G) Define recursive traversal in binary trees.? (2 marks)

Unit 1
Q 2 (a) Write the pseudocode to implement insertion, deletion, and search operations in a singly
linked list.?(7 marks)
(b) Explain the differences between the array and linked representations of a linear list. Discuss their
advantages and disadvantages ?.(7 marks)
OR
Q3 Explain the concept of time complexity and space complexity in detail. Provide examples to
illustrate how to calculate the time and space complexities of an algorithm. Discuss the significance of
understanding these complexities in algorithm design.?(14 Marks)
Unit 2
Q4 (A) Define Stack and Queue Abstract Data Types (ADTs). Explain the basic operations performed
on them.? (7 marks)
(B) Implement a Max Heap using an array. Write the code for the following operations: Insert, Delete
Max .?(7 marks)
OR
Q5 Define the Stack Abstract Data Type (ADT). Describe its main operations (push, pop, peek) and
provide an example for each operation. Discuss the differences between array-based and linked list-
based implementations of a stack.?
Unit 3
Q 6 (A)What is hashing? Explain the concept of hash functions and their role in hashing. Describe
the properties of a good hash function.
(B) Describe the bubble sort algorithm. Explain how it works, including the best and worst-case time
complexities. Provide an example to demonstrate the bubble sort process on a small array.
OR
Q 7 Discuss the different types of binary tree traversals (inorder, preorder, postorder). Provide
algorithms for both recursive and non-recursive implementations of these traversals, along with an
example to demonstrate each traversal method.?
Unit 4
Q 8 (A) Describe B-trees in detail. Explain their structure and properties. Discuss the algorithm for
insertion of nodes in a B-tree with a simple example.?
(B) Describe B-trees in detail. Explain their structure and properties. Discuss the algorithm for
insertion of nodes in a B-tree with a simple example.
OR
Q9 Provide a comprehensive explanation of graph terminology, including vertices, edges, and types of
graphs (directed, undirected, weighted, unweighted). Discuss the Graph Abstract Data Type (ADT)
and its operations.
Extra:---- Explain the two primary graph traversal methods: Depth-First Search (DFS) and Breadth-
First Search (BFS). Provide algorithms for both methods, along with examples to illustrate how they
traverse a graph.

Q1. (a) Differentiate between merge sort and insertion sort.


(b) Define threaded binary tree.
(c) What is greedy search?
(d) Define asymptotic notation.
(e) Two-dimensional array representation.
(f) What is circular queue? Give example.
(g) What operations characterize the stack abstract data type?
(h) What is the difference between a full binary tree and a complete binary tree?
(i) Describe two advantages and disadvantages of the queue.
(j) Consider the following athematic expression:
((3 + x) * (5/y)) + 7
Draw a binary expression tree.
Unit - I
Q2. Define List ADT. What are the ways of implementing linked list and the ways of implementing
linked list? Explain the steps involved in insertion and deletion into a singly and doubly linked list.
14
(OR)
Q3. Explain the representation of arrays in data structures. Discuss the row-major and column-major
representation for 2D arrays with an example.
7
Unit - II
Q4. (a) Explain operations of a stack with an example.
7
(b)Explain how an infix expression can be converted to a post fix expression with an example
using stack.
7
(OR)
Q5. (a) Explain heap sort. how does the heap sort work? Give an example of max heap.
7
(b) What is a priority queue? Write a program to implement the priority queue.
7
Unit - III
Q6. (a) Define quick sort. Write a program that takes last element as pivot, places the pivot element at
its correct position in sorted array, and place all smaller (smaller than pivot) to left of pivot and all
greater elements to right of pivot.
7
(b) Explain selection sort with an example. Give its complexity.
7
(OR)
Q7. (a) Explain hashing, hash table, a function and collision. Given the input {4371, 1323, 6173,
4199, 4344, 9679, 1989} and a hash function of h(X)=X (mod 10) show the resulting:
a. Separate Chaining hash table
b. Open addressing hash table using linear probing
10
(b)Compare and analyses sequential search and binary search. Explain the complexity of search
algorithm.
4
Unit - IV
Q8. (a) define graph. Also differentiate between BFS and DFS with suitable example
7
(b) What is a spanning tree? Explain how minimal spanning trees are constructed with an
example using Kruskal’s algorithm.
7
(OR)
9. (a) Explain in brief how shortest path is calculated using Dijkstra’s algorithm.
7
(b) What is a binary tree give short notes on types of binary trees. Create a binary tree for the
following numbers start from an empty binary 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.
7

You might also like