🔔 YJ Notes ke saath updated rahein! Naye notes aur exam updates ke liye notifications ON karein.
🧪
💻
Basic Computer Instructor Data Structures Quiz
Computer 📌 Data Structures
10:00
TIME LEFT
Progress:
0/8
Question 1 of 8
What will be post order traversal of a binary Tree T, if preorder and inorder traversals of T are given by ABCDEF and BADCFE respectively? / एक बायनरी ट्री T का पोस्ट ऑर्डर ट्रेवर्सल क्या होगा, यदि T का प्रीऑर्डर तथा इनऑर्डर ट्रेवर्सल क्रमशः ABCDEF तथा BADCFE हैं?
💡 Explanation: Preorder se root node 'A' milta hai. Inorder me 'A' ke baayein 'B' hai aur daayein 'DCFE' hain. Isko solve karne par Post-order traversal 'BDFECA' nikalta hai.
Question 2 of 8
What is the outcome of the prefix expression +, -, *, 3, 2, 7, 8, 4, 1? / उपसर्ग अभिव्यक्ति +, -, *, 3, 2, 7, 8, 4, 1 का परिणाम क्या है?
💡 Explanation: Prefix expression ko right to left solve karte hain. Isko step-by-step evaluate karne par ant me iska parinaam (outcome) 4 aata hai.
Question 3 of 8
Consider the given binary search tree, if the root node will be deleted, the new root can be - / दिए गए बाइनरी सर्च ट्री पर विचार करें, यदि root node (50) डिलीट कर दिया जाए, तो नया रूट हो सकता है -
💡 Explanation: BST me root node delete hone par uski jagah ya to left subtree ka maximum (43) leta hai ya right subtree ka minimum (59). Diye gaye options ke aadhar par 43 ya 48 me se sahi vikalp A banta hai kyunki 43 iska left-predecessor ho sakta hai.
Question 4 of 8
What would be the prefix notation for the given equation? (a+(b/c) *(d^e)-f) / दी गई equation का prefix notation क्या होगा?
💡 Explanation: Operator precedence aur associativity ka upyog karke (a+(b/c)*(d^e)-f) ko infix se prefix me badalne par '-+a*/bc^def' banta hai.
Question 5 of 8
Consider the stack implemented using array: #define SIZE 11; struct STACK { int arr[SIZE]; int top = -1; }; What would be the maximum value of top that does not cause the overflow of the stack? / शीर्ष (top) का अधिकतम मूल्य क्या होगा जो स्टैक के अतिप्रवाह (overflow) का कारण नहीं बनता है?
💡 Explanation: Array ka size 11 hai, to index 0 se 10 tak jayega. Isliye top ki maximum value 10 ho sakti hai. 10 ke baad data daalne par stack overflow ho jayega.
Question 6 of 8
Choose true statement: I- Binary search is faster than linear search. II- Binary search may not be applied on all the input lists on which linear search can be applied. / सत्य कथन का चयन करें :
💡 Explanation: Binary search ki time complexity O(log n) hoti hai jo linear search O(n) se tez hai. Lekin binary search ke liye list ka sorted hona zaroori hai, jabki linear search kisi bhi list par chal sakti hai.
Question 7 of 8
LB and UB are lower bound and upper bound of a linear array LA. Consider following algorithm - 1. Repeat for K = LB to UB apply PROCESS to LA[K] 2. Exit. The algorithm _______ the array LA. / यह एल्गोरिथम, ऐरे LA को क्या करती है?
💡 Explanation: Array ke lower bound se upper bound tak har ek element par jaakar koi process apply karna 'Traversal' (ट्रेवर्स करना) कहलाता है.
Question 8 of 8
What will be the output list after completing first pass of bubble sort on input array 32, 51, 27, 85, 66, 23, 13, 57? / इनपुट ऐरे पर बबल सॉर्ट का प्रथम पास पूर्ण करने के उपरांत आउटपुट लिस्ट क्या होगी?
💡 Explanation: Bubble sort ke pehle pass me sabse bada element (85) end me pahunch jata hai adjacent elements ko swap karte hue. Sahi kram '32, 27, 51, 66, 23, 13, 57, 85' banta hai.
📝
Complete Quiz Summary
All answers reviewed below