Scribd
Upload
13 views2 pages

Important DS UNIT 4

The document outlines an assessment test for the Data Structure course at ABES Engineering College for the academic session 2024-25. It includes a series of questions covering topics such as Huffman coding, binary trees, AVL trees, B-Trees, and algorithms for searching and inserting nodes. Each question is associated with specific course outcomes and marks, along with references to previous academic years.

Uploaded by

redhawk1522
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
13 views2 pages

Important DS UNIT 4

The document outlines an assessment test for the Data Structure course at ABES Engineering College for the academic session 2024-25. It includes a series of questions covering topics such as Huffman coding, binary trees, AVL trees, B-Trees, and algorithms for searching and inserting nodes. Each question is associated with specific course outcomes and marks, along with references to previous academic years.

Uploaded by

redhawk1522
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

ABES Engineering College, Ghaziabad

Department of Computer Science & Engineering-Data Science

Session: 2024-25 Semester: III Section: A,B,C,D


Subject Code: BCS-301 Subject Name: DATA STRUCTURE

ASSESSMENT TEST

Date of Assessment:

S.NO Question CO Marks Year

1 Suppose character a, b, c, d, e, f has probabilities 0.07, 0.09, 0.12, CO3 7 2023-24


0.22, 0.23, 0.27 respectively. Find an optional Huffman code and
draw the Huffman tree. What is the average code length?
2 If E and I denotes the external and internal path length of a binary CO3 7 2023-24
tree having n internal nodes then show that E=I+2n

Solution:

3 Write a program in C language to implement binary search CO3 7 2023-24


algorithm. Also discuss the average behavior of the algorithm.

4 The order of nodes of a binary tree in inorder and postorder traversal are CO3 10 2022-23
as follows:
In order: B, I, D, A, C, G, E, H, F.
Post order: I, D, B, G, C, H, F, E, A.
(i) Draw the corresponding binary tree.
(ii) Write the pre order traversal of the same tree.

Discuss left skewed and right skewed binary tree. Construct CO3 10 2022-23
5
an AVL tree by inserting the following elements in the order
of their occurrence:
60, 2, 14, 22, 13, 111, 92, 86.
What is B-Tree? Write the various properties of B- Tree. Show the CO3 10 2022-23
6 results of inserting the keys F, S, Q, K, C, L, H, T, V, W, M, R, N, P, A,
B in order into an empty B-Tree of order 5.
What is the significance of maintaining threads in Binary Search Tree? CO3 10 2021-22
7 Write an algorithm to insert a node in thread binary tree.

8 (i) Why does time complexity of search operation in B-Tree is better than CO3 10 2021-22
Binary Search Tree (BST)?
(ii) Insert the following keys into an initially empty B-tree of order 5
a, g, f, b, k, d, h, m, j, e, s, i, r, x, c, l, n, t, u, p
(iii) What will be the resultant B-Tree after deleting keys j, t and d in
sequence?
9 Write an iterative function to search a key in Binary Search Tree CO3 5 2021-22
(BST).
10 If the in order of a binary tree is B, I, D, A, C, G, E, H, F and its CO3 10 2020-21
post order is I, D, B, G, C H, F, E, A then draw a corresponding
binary tree with neat and clear steps from above assumption.
11 Write Short notes of following CO3 10 2020-21
(a) Extended Binary Trees (b) Complete Binary Tree
(c) Threaded Binary Tree.
12 Insert the following sequence of elements into an AVL tree, starting CO3 10 2020-21
with empty tree 71,41,91,56,60,30,40,80,50,55 also find the minimum
array size to represent this tree.
13 What is the difference between a binary search tree and heap? For a CO3 10 2019-20
given sequence of numbers, construct a heap and a BST.
34,23,67,45,12,54,87,43,98,75,84,93,31
14 Can you find a unique tree when any two traversals are given? Using the CO3 10 2019-20
following traversals construct the corresponding binary tree:
INORDER: H K D B I L E A F C M J G
PREODER: A B D H K E I L C F G J M
Also find the post order traversal of obtained tree
15 What is a B-Tree? Generate a B-Tree of order 4 with the alphabets CO3 10 2019-20
(letter) arrive in the sequence as follows:
agfbkdhmjesirxclntup
16 What is height balanced tree? Why height balancing of Tree is required? CO3 7 2018-19
Create an AVL Tree for the following elements:
a, z,b,y,c,x,d,w,e,v,f.
17 Write an algorithm for deletion of an element in binary search Tree. CO3 7 2018-19

18 Construct the binary tree for the following: CO3 7 2018-19


INORDER : Q, B, K, C, F, A, G, P, E, D, H, R
PREODER: G, B, Q, A, C, K, F, P, D, E, R, H
Find the Post Order of the tree.
19 Construct a B-Tree of order 5 created by inserting the following elements CO3 7 2018-19
3,14,7,1,8,5,11,17,13,6,23,12,20,26,4,16,18,24,25,19
Also delete elements 6,23 and 3 from the constructed tree.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy