VU current papers 2026: what came in the exam

: --- ### *MCQs with Correct Answers* #### *1. Data Structure - Memory* *Q: Linked list kis type ki memory allocation hai?* A. Static Memory Allocation B. *Dynamic Memory Allocation* ✅ C. Contiguous Memory Allocation D. None _Wajah: Linked list mein nodes runtime pe `malloc/new` se bante hain_ #### *2. String Functions* *Q: String ko compare karne ke liye konsa built-in function use hota hai?* A. compstr() B. *strcmp()* ✅ C. strcomp() D. compare() _Wajah: C/C++ mein `strcmp()` standard hai. `compstr()` naam ka koi func nahi_ #### *3. Hashing* *Q: In hashing the size of table is actually the size of ___ ?* A. External Memory B. *Internal Array/Bucket* ✅ C. Linked List D. None _Wajah: Hash table ka size = internal array jisme data store hota hai_ #### *4. Sorting Algorithm* *Q: In sorting algorithms, which is the most effective when almost everything is already sorted?* A. Selection Sort B. Merge Sort C. Bubble Sort D. *Insertion Sort* ✅ _Wajah: Insertion sort best hai for "nearly sorted" data. O(n) ho jata hai_ #### *5. Stack/Queue* *Q: `isempty()` kia check karta hai?* A. Head B. Tail C. *Whether stack/queue is empty or not* ✅ D. Size _Wajah: `isempty()` = true agar koi element nahi hai_ #### *6. Huffman Encoding* *Q: In Huffman encoding, 0 is assigned to?* A. *Left* ✅ B. Right C. Root D. Leaf _Note: Convention hai. Kuch books mein Right bhi use karte hain, but VU mein *Left = 0, Right = 1* parhaya jata hai_ #### *7. Heap - Percolate Down* *Q: Percolate down ka aim kia hai?* A. Insert element at top B. *Restore heap property after deletion* ✅ C. Increase height D. None _Wajah: Jab root delete ho to heap property wapis lane ke liye percolate down karte hain_ #### *8. Set - Union* *Q: New set name of union(6, 7) ?* A. 6 union 7 B. 6 and 7 C. *6* D. *7* E. *{6, 7}* ✅ _Option mein `{6, 7}` nahi hai to dono alag elements hain. Union = {6, 7}_ #### *9. Union by Height/Size* *Q: The union by height method, which tree is attached to root?* A. More leaf with Less leaf B. *Smaller height tree attached to larger height tree* ✅ C. Maximum height to attach to min height D. Random _Wajah: Height kam wale ko zyada wale ke neeche attach karte hain_ #### *10. AVL Tree Rotations* *Q: AVL Tree: Insert 90, 40, 60, 80, 50, 55, 68. Double Left-Right rotation kab occur hoti hai?* A. Jab Left subtree mein Right child heavy ho B. *Jab pehle Left phir Right insertion ho* ✅ C. Jab Right phir Left insertion ho D. None *Q: Double RL rotation kab occur hoti hai?* A. Jab Left phir Right insertion ho B. *Jab pehle Right phir Left insertion ho* ✅ C. Jab dono Left ho D. None --- ### *Quick Revision Sheet* Topic Answer **Linked List Memory** Dynamic **String Compare** `strcmp()` **Hash Table Size** Internal Array **Best for Nearly Sorted** Insertion Sort **isempty()** Checks if empty **Huffman 0** Left **Percolate Down** Restore heap property **Union(6,7)** {6, 7} **Union by Height** Small height → Big height **LR Rotation** Left then Right case **RL Rotation** Right then Left case: --- ### *MCQs with Correct Answers* #### *1. Data Structure - Memory* *Q: Linked list kis type ki memory allocation hai?* A… See more See less

MCQS FROM past papers plus conceptual thay overall easy tha paper.short lecture must watch kst learning ki . subjective mai 1.AVL tree deya tha add two node and then balanced. 2.AVL tree sy node delete krna tha and then balanced. easy tha dono question. 3. array wala code tha iska output lekhna tha. 4. unsorted list deya tha or check krna tha ky ye konsa sorted algorthim mean selection, inseration, bubble in mai sy aik choose krna tha. VU TALK CHANNEL KI 2 preparation video hain must watch karo..90 percent paper isi sy aya tha .MCQS FROM past papers plus conceptual thay overall easy tha paper.short lecture must watch kst learning ki . subjective mai 1.AVL… See more See less

*Objective* easy tha sary mcqs fron AVL tree + Binary search tree and from arry sy thy or accending mei sort krna tha code ko . *Subjecticve* 1.enque and deque waly program ki output nikalni the. 2.Push() and pop() waly program ka output nikalna tha . Concept clear hony chaye about All AVL tree,BNS tree ,..... Wish u all the best🤌 3.Tree mei sy given node ko remove krna tha and agin tree balanced krna tha. 4.arry ko accending order mei sort krna tha with step by step*Objective* easy tha sary mcqs fron AVL tree + Binary search tree and from arry sy thy or accending mei sort krna tha code ko … See more See less

Mcqs sab past papers mn se thy Subjective MN trees e banany thy kuch ko balance krna tha nodes remove krky… See more See less

Overall paper itna mushkil tha MCQS jaty howy past papers k solve kar k gaya tha jis ma sy 12 mcqs ayy subjective part ma AVL tree ma node add karni thi or balance karna tha or sary steps jo tree bnaty huwy howy udar bnany thy ik qs hash function wala tha jis ma (2x+1)mod8 kar k values insert karni huti or is ky ilawa 2 coding waly QS thy Stack or is k ilawa ik or tha paper easy hy bas thori c mehnat ki zrorat hay All the bestOverall paper itna mushkil tha MCQS jaty howy past papers k solve kar k gaya tha jis ma sy 12 mcqs ayy subjective part ma AVL… See more See less

Q1: An AVL tree was given insert 2 values into it and balance the tree sad loif me usko balance na kar pai muje bhool giya tha Q2: A question related to linear probing... Q3: A code-writing question — write code to check/find whether an index/slot is empty something like that muje ata tu nhi tha khairrr Q4: A question related to building a Max Heap tree. Mcqs yad nhi goizzz anywaysss best of luck ya'll..Q1: An AVL tree was given insert 2 values into it and balance the tree sad loif me usko balance na kar pai muje bhool giya tha… See more See less