Howdy, Stranger!
It looks like you're new here. If you want to get involved, click one of these buttons!
Quick Links
Categories
Our Friends
Who's Online 0
CS301 Assignment no 2 Solution and Discussion
ansarali
Posts: 25,240
Instructions
Please read the following instructions carefully before solving & submitting assignment:
It should be clear that your assignment will not get any credit (zero marks) if:
o The assignment is submitted after due date.
o The submitted code does NOT compile.
o The submitted assignment is other than .CPP file.
o The submitted assignment does NOT open or file is corrupted.
o The assignment is copied (from other student or ditto copy from handouts or internet).
Uploading instructions
For clarity and simplicity, You are required to Upload/Submit only ONE .CPP file.
Note: Use ONLY Dev-C++ IDE.
Objective
The objective of this assignment is
o To make you familiar of Programming with Stack Data Structure.
o Evaluating Postfix expression using Stack
For any query about the assignment, contact at [email protected]
GOOD LUCK
Comments
19 Mcqs from past mostly .
1. Three association of data structure 3 marks
2. if delete the root node then which node take place 3 marks
3. AVL tree add two nodes and balance 5 marks
4. binary tree 5 marks
5. code was given and we have to modify it by taking prime number output.
Question 1 Inorder was given write
the left child .
2. What are the function of current and head
pointers.
3. A program was given about reference and
identity the errors in program.
4.Make a node x between p and q node In
link list .and also write the c++ statement to
add the node and current pointer point to x .
5 .A tree was given and make a binary
search tree with in order traversal .
Objective kuch past ppr sy thy
Huffman coding
chaining hash table
arry implemetation
Union by height
or ak output likhna tha
Q1.biner tree bnawa tha OS k levels btao.
Q2.carictrics of avl tree.
Q3.if node leaf and non leafe in binry tree then what the hight of tree of its depth is 7?
Q.4hight of nodes if hight is 5?
Q.6 [2 9 7 5 8] sort it.
Q.7 ik tree tha osko array mn conert krna tha.
Q8.crictristics of union method
Mostly mcqs and questions are from moazz files.
1. AVL tree se aik node delete kr k rotation kr k balance krna tha 5 marks
2. Binary tree agar sorted data ka bnana ho to kiya issue aata hai aur oska solution kya hai? 5Marks
3. Frequency table bnana tha text ka 3 marks
4. Insertion sort se data sort krna tha with all steps 3marks
5. Threaded tree banana tha 5 marks
6. Path compression se find kese easy hota hai explain krna tha 3 marks
Mcqs mostly from past papers
subjective.
1.Application of Hashing
2.Transitivity relationship
3.Deleta a node from max heap and draw again.
4.Frequency table
5.Program given and write about variable
6.bubble sort after two iterations. 5 Marks
7.Threded binary tree given and for one node write its four varaibles values
a.left flag
B.Right flag
C.left pointer node.
D.Right pointer node.
5 Marks
8. AVL tree after deleting one node draw Balance tree. 5 marks
9.For furniture selling compay to customer s write
a) What are basic operation must select for the databese system
b)On what basic points the data structure is select for this company. 5 Marks
10.Write and Explain Union and Find operation for Dynamic Equivalence Problem.