Scribd
Upload
63 views

Sem 3 Comps Data Structure Important Questions

Sem 3 comp

Uploaded by

krishnagupta6446
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
63 views

Sem 3 Comps Data Structure Important Questions

Sem 3 comp

Uploaded by

krishnagupta6446
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/ 29

🎯 HERE YOU GET ALL (MUMBAI UNIVERSITY ) ENGINEERING NOTES 🎯

SECOND YEAR ENGINEERING NOTES (MU) 📚


😊 😊
JOIN TELEGRAM

🎗️ 🎗️
KEEP SHARE THIS LINKS

👇👇👇👇👇👇👇👇👇👇👇👇
JOIN US TELEGRAM ALL LINKS FOR NOTES

⭐ 👉
1.CLICK TO JOIN CHANNEL @engineeringnotes_mu

⭐ 👉
2.CLICK TO JOIN GROUP @engineering_notes_mu

⭐ 3.CLICK TO JOIN 1ST YEAR NOTES BOT 👉 @engineeringnotes_mubot

4.CLICK TO JOIN 2ND YEAR COMPUTER ENGINEERING NOTES BOT


@computerengineeringmu_notes_bot
👉
5.CLICK TO JOIN CODING CHANNEL 👉 @codingnewbeginners

Join Telegram:- @engineeringnotes_mu


Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
Join Telegram:- @engineeringnotes_mu
www.lastmomenttuitions.com #Engineering_Data_Structure

Data Structures Importance [ MU Sem 3 Comps ]

Module 1
1. Linear and non-linear data structures (difference)
2. Abstract Data Types
3. Operations on data structures

Module 2
1. C program to implement Infix to postfix expression
2. Convert the following infix expression to postfix expression using stack
A/B**C+D*E-A*C
3. Give the postfix and prefix form of the infix expressions below
(a + b * c) / (x +y / 2)
4. Write a program in ‘C’ to check for balanced parenthesis in an expression using stack.
5. Write short notes on:
a) Double-ended queue.
b) Priority queue.

Module 3
1. C program implementation of circular linked-list and
- Insert a node in the beginning
- Insert a node in the end
- Count the number of nodes
- Display the list
2. C program implementation of singly/doubly linked-list
- Insert a node at the end of the list
- Deleting a particular element
- Display the linked list
3. Applications of linked list

Module 4
1. Tree traversal in Binary tree (Theory & C programs)
2. C program to count of leaf nodes in a binary tree
3. C program to calculate height of a binary tree.
4. Binary search tree
5. Threaded binary tree
6. B+ tree
7. What is expression tree? Derive an expression tree for (a+(b*c))/((d-e)*f
8. Insert the following elements in AVL tree:
a) 44, 17, 32, 78, 50, 88, 48, 62, 54.
b) 63, 9, 19,18,108, 99, 81, 45
9. Given the frequency for the following symbols, compute the Huffman code for each
symbol.
a)
Symbol A B C D E F

Join Telegram:- @engineeringnotes_mu


www.lastmomenttuitions.com #Engineering_Data_Structure
www.lastmomenttuitions.com #Engineering_Data_Structure

Frequency 9 12 5 45 16 13
b)
Symbol A B C D E

Frequency 24 12 10 8 8

10. Given postorder and inorder traversal of a binary tree, construct original tree.
post order : D E F B G L J K H C A
in order : D B F E A G C L J H K

Module 5
1. Explain depth first search / breadth first search
2. Write a short note on : Topological sorting

Module 6
1. Explain binary search, distinguish between linera & binary search.
2. What is Hashing? Hash the following data in a table of size 10 using linear probing and
quadratic probing. Also find the number of collisions.
63, 82, 94, 77, 53, 87, 23, 55, 10, 44
3. Insert the following values in the hash table of size 10. Show how many collisions occur in
each iteration:
28, 55,71,67,11,10,90,44

Get the Complete Study Materials [ Videos + Importance Paper Solution + Viva Questions ] :
https://lastmomenttuitions.com/course/data-structure/
For More Importance topics of SE Comps MU join our whatsapp community :
https://chat.whatsapp.com/GittIMeAC4YHzbe6QTHud4

Join Telegram:- @engineeringnotes_mu


www.lastmomenttuitions.com #Engineering_Data_Structure

You might also like