Scribd
Upload
7 views3 pages

Dsa 2022

The document is an examination paper for the Third Semester B.Tech Degree in Data Structures and Algorithms, consisting of multiple parts. Part A includes short answer questions on topics like efficiency measures, big-O notation, data structures, and algorithms. Part B requires detailed answers to selected questions from various modules, covering algorithms for linked lists, binary trees, sorting methods, and hashing techniques.

Uploaded by

Indeevar P.S.
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
7 views3 pages

Dsa 2022

The document is an examination paper for the Third Semester B.Tech Degree in Data Structures and Algorithms, consisting of multiple parts. Part A includes short answer questions on topics like efficiency measures, big-O notation, data structures, and algorithms. Part B requires detailed answers to selected questions from various modules, covering algorithms for linked lists, binary trees, sorting methods, and hashing techniques.

Uploaded by

Indeevar P.S.
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/ 3

(Pages : 3) P-6356

Reg. No.:
Name :

Third Semester B.Tech Degree Examination, November 2022


(2018Scheme)
18.306 DATA STRUCTURES AND ALGORITHMS (FR)
Time:3 Hours Max. Marks: 100

PART-A

Answer all questions :

1. What are the measures of efficiency for aprogram?


2. Write a short note on big-0notation.
3. Compare linked list and array data structure.
4. Give applications of stack.
5. Define stack, queue.
6. Why is garbage collection important?
7. Draw binary tree of the expression
tree. (A-B)+C*(D/E) write the array of the binary
8 Explain hashing.
Explain Boundary Tag system
10. Write the algorithm for merge sort.
(10 x 2 = 20 Marks)

P.T.0.
PART - B

Answer any one full question from each module, Each question carries 20 marks.
Module -|
11. Write an algorithm to inserting a node in to a singly linked list.
(a) inserting at the front
(b) inserting at the end
(c) inserting at any position
20
OR

1. Explain Programming Style. 20

Module-||
13. (a) Generate a binary tree from its inorder and
preorder Travesal
Inorder : DHHEAIFJCG
Predorder: ABDEHCFIJG
12
(b) Explain Linear Representing of a binary tree.
8

OR
44. á) Assume that a stack is
represented using linked list. Write
following operations. algorithms for the
) PUSH
(i) POP
10
(b Write an iterative algorithm to
perform inorder traversal ofa binary tree.
(c) What is a binary search Tree (BST)?
nodes. Give example of a BST with five

2
P-6356
Module -||
20
% Explain Buddy System
OR

15
16. (a) Explain Compaction
5
(b) Explain internalfragmentation
Module -IV
10
17a Write an algorithm for merge sort
(b) Trace the working of the quick sort algorithm on the following 10

90, -40, 48, 33, 57, 25, 10, 84


OR

18. Given the values {2341,4234,2839,430,22,397,3920} a hash table of size 7 and a


hash function h(x)=x mod 7, show the resulting table after inserting the values in
the given order with each of the following collision strategy.
(a) Separate Chaining
(b) Linear probing

(c) Double hashing with second hash function h1(x)=(2x-1)mod 7. 20

(4x 20 = 80 Marks)

P-6356

You might also like