cs301 Final Term Papers

cs 301 today paper
mcqs are mostly from past paper
1. sorting with insertion sort techniq

2. rebalance krna tha tree ko ik node del krny k bd
3. min and max heap ko define krna tha
4. num diye hoye thy tree bnana tha
5. worst time likhna tha bubble r selection sort ka
6. ik coding wala tha
7. Give any three characteristics of Union by Weight method. O
8. How we can generate a maze .Give an algorithm.
define the characteristic of skip list
• Search and update require linear time

• Fast Searching of Sorted Chain Provide alternative to BST (binary search trees) and
related tree structures.
• Balancing can be expensive.
• Relatively recent data structure:
•
Define the Union operation of disjoint set.

Today's my cs301 paper
handouts sa zyada questions aye thy, skip list insertion,in ma sa mcqs
zyada aye thy
Subjective
Q1 insertion sort 5 marks
Q2 union function
Q3 built complete binary tree with 4 nodes
Q4 consider the following threaded binary tree....You have to give the
values that should be in the four variables given below, for the node
37
1. LTH (Left flag) Child
2. RTH (Right flag) Thread
3. Left node pointer (->L)

4. Right node pointer (->R)
5:For smaller list linear insertion sort is perform well but for large
list Quick sort suitable to apply/justify
why?
6:cases of rotation in AVl tree

Cs301 Current Paper 2019
Time 8:am
90% objective from Past papers...
50% Subjective from Past papers
Like page to get Daily Updates
Some Subjective Questions are below
1) Construct BST ( binary search tree )
2) Equivalence Relation
3) Expression tress
4) AVL tree
5) convert linked list into BST
6) Find MIN Heap
7) Describe 2i , 2i+1
CS301 Paper 2019
Short question
Which data structure is used in Huffman encoding.
Binary tree
Characteristics of union by size method
Characteristics of skip list
A minh heap tree fig( delete the top value ) re construct it

A ALV tree delete top value then re construct it
Difference between binary tree and binary search tree
A perfect binary tree have h hight then prove that
2 power k+1 _ 1 node ………
MCQ 18 t0 20 from old papers out of 40
2020
.Find leaf and non leaf node of tree of depth 7.
2.find sum of height of tree have level 5.
3.Discuss two cases in which hashing is not suitable.
4.Write names of six basic operation of BST.
5.write steps of level order traversing.
6.Draw a balanced AVL tree after inserting a node.
7.Aik theorem proof karna tha.
Cs301 Today paper 15-02-20

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.
Today CS301 paper 15-02-20
Mcqs mostly from past papers
subjective.
1.Application of Hashing
2.Transitivity relationship
3.Deleta a node from the max heap and draw again.
4.Frequency table
5.The program has 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 variables 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 the company to a customer s write
a) What are basic operations must select for the database 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.
CS301 today paper…. 16-02-20
32 mcqs from Moaz PDF and pictures…
3 properties of AVL tree…(3 marks)
Maze table pseudo code (5 marks)
Max heap insert node 40 in the tree(3 marks)

Max heap insert tree and rearrange it (5 marks)
Draw skip list from S0 to S3….given number from left to right…..(2 3 4 5 7 8 9)”mene
paint se draw kia tha…(5 marks)
Delete node 2 and rotate AVL tree …..tell balance and each step of rotation (5 marks)
Post fix question (little bit complex like it).
3*4/(1+5)+8*(2-8)
Similar it form lekin number ni yad Kia thy (5 marks)
Operation perform on table ADT (3 marks) 1) Insert 2) Find 3) remove
Cs301 today paper 16-02-20
1. Find the leaf and non-leaf node of the tree of depth 7.
Nodes which have no children are leaf nodes
2.find sum of the height of the tree has level 5.
3. Discuss two cases in which hashing is not suitable.

4. Write the names of six basic operations of BST.
5.write steps of level order traversing.
6. Draw a balanced AVL tree after inserting a node.
7.Aik theorem-proof Karna Tha.
Cs301 today paper 19-02-20
Paper MCQs mostly past papers sy thy subjective BST. Sorting, Max heap and min
heap ki statements, min-heap first 4 order delete then make a new tree.
AVL trees, Maze generation algorithm, skip list characteristics, Threaded binary tree, Min heap,
Bubble sort. how to search value from binary search array is type ka question tha.
17-02-2020
MCQS :
60% from past papers.
Subjective :
1) Generate maze? write an algorithm.
2) Benefit of reference & where we can use it?
3) In Huffman encoding,
a) Which data structure is used?
Binary Tree
b) what frequency of the node which result by joining two nodes?
2
4) What does a quad node stores?
5. Write a code fragments that print out all values in list that are greater than 10.
6) Write and explain the code for 'union' & ' find' operation of parents array in disjoint
sets.
7) Draw a new heap which is created by removing one item.
8) Make purse tree for following expression (3+(4*5)).
9) Write missing code of insertion sort inside For loop.
Cs301: 1.AVl tree ma aik node delete karni

2. Heap ko array ma implement karna
3. ADT table kin factors pay depend karta?
4: insertion sort ka missing code complete karna( from books)
5: 80% mcqs from past.
Min heap and max heap ma say aya tha
Huffman encoding Aur union ma say b aya tha
BST Operations:
max,min,search,insert, delete,

cs301 Final Term Papers

Uploaded by

Copyright:

Available Formats

cs301 Final Term Papers

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

cs301 Final Term Papers

Uploaded by

Copyright:

Available Formats

cs 301 today paper

mcqs are mostly from past paper

1. sorting with insertion sort techniq

8. How we can generate a maze .Give an algorithm.

define the characteristic of skip list

• Search and update require linear time

Define the Union operation of disjoint set.

3. Left node pointer (->L)

6:cases of rotation in AVl tree

Characteristics of union by size method

Characteristics of skip list

A minh heap tree fig( delete the top value ) re construct it

2.find sum of height of tree have level 5.

3.Discuss two cases in which hashing is not suitable.

4.Write names of six basic operation of BST.

5.write steps of level order traversing.

6.Draw a balanced AVL tree after inserting a node.

7.Aik theorem proof karna tha.

Cs301 Today paper 15-02-20

Max heap insert node 40 in the tree(3 marks)

3. Discuss two cases in which hashing is not suitable.

Cs301: 1.AVl tree ma aik node delete karni

You might also like