CS301 Spring 2018 Final Term Papers Pattern & Questions 01 September 2018 to 12 September 2018 & Helping Material
Share Your Final Term Papers (Questions/Pattern) & Past Papers as well here to help each other. Thanks
For Important Helping Material related to this subject (Solved MCQs, Short Notes, Solved past Papers, E-Books, FAQ,Short Questions Answers & more). You must view all the featured Discussion in this subject group.
For how you can view all the Featured discussions click on the Back to Subject Name Discussions link below the title of this Discussion & then under featured Discussion corner click on the view all link.
Or visit this link
Please Click on the below link to see…
Share your Helping material related this subject here to help each other. Thanks
question is to rebalanced the avl tree after deletion of one node.
1 post fix mathematical equation to solve.
2 sawal arrays k thay
What is equilance relation properties
1 code tha
cs301 current paper .mcqs waqar and moaz file sa ay kuch handouts sa ay mcqs
Q41. Three characteristics of union by weight method
42. Three characteristics of hashing function
43. Heapilfy the given Array
44. What is function length() method used for also build a complete bst from 5 nodes ?
45. Use buildheap to insert 14 into min heap
46. Build expression tree from this postorder 6561+-*231///
47. Use insertion sort to given elements
48. Avl tree which case is easy for deletion
52. List 4 pixel inclusion criteria
cs301 today current paper
AVL tree mn sy node del krna tha (5 marks)
huffmen code (3 marks)
Creat min heap with given array (5 marks)
void quicksort(int*arr,intN) is ka baki code likhna tha.
(A-B)+C\D postfix expersion mein convert krna tha or sary steps ko
Stack k through Show Krna tha.(5 marks)
what is threded binery tree
what is hashing give example.
85% Mcq's from past papers.
bs itna hi yaad h
Today cs301 paper (11:00)
Almost All mcqs from moaaz file
Subjective 3,4 question from moaaz file
frequency create krna tha "data structure " ka 3 marks
"the cat in the cat" ka b frequency table create krna tha 5 marks ka
ak program aya tha
tree diya tha us ka pre order or post order find krna tha 5 marks
ak tree ka post order find krna tha 3 marks
cs301 today current paper
Binary search tree bnana tha aur us mai se 65 del kr k again bnana tha (1 hi question tha)
1 to 20 digit thy with Alphabets un mai se H aur I k left right child aur parent btana thy
Mcqs almost 70% moaaz wali file se thy.
Union aur find ko describe krna tha
#todays cs301's paper
Mcqs mostly from moaz file
Question of 3 marks
1. 3 trees were given we have to tell wether they fulfil the property of heap or not
2. Union pairs were given and we have to make tree
3. Skip list proprties
4. Tree was given and have to tell level of each node
5. Data was given and have to make frequency table
Questions of 5 marks
6. Bubble sort data was given
7. 3,4,5,7,9,10,13,17 data was given and was asked what is the charactristic os this tree avl tree
What will be solution to solve this tree and why?
8. Data was given and have to make thread tree
9. Same data but thread with dummy
10. Union by hight propeties
Just prepared this file.
All New and Past Papers in one file.