SSC IMD SA Mock 01 – Question 120
Question: What is the allowable balance factor for every node in an AVL Tree? एक AVL ट्री में प्रत्येक नोड
Question: What is the allowable balance factor for every node in an AVL Tree? एक AVL ट्री में प्रत्येक नोड
Question: In a max-heap of size \(n\) stored in an array (1-indexed), the parent of an element at index \(i\)
Question: What is the worst-case time complexity of searching for an element in a Binary Search Tree (BST)? एक बाइनरी
Question: Which graph traversal algorithm uses a Queue data structure? कौन-सा ग्राफ ट्रैवर्सल एल्गोरिदम कतार (Queue) डेटा संरचना का उपयोग
Question: What is the equivalent postfix expression for the infix expression:\(A + B \times C – D / E\) इन्फिक्स
Question: Which data structure is primarily used by compilers for syntax parsing and expression evaluation? सिंटैक्स पार्सिंग और व्यंजक मूल्यांकन
Question: In a circular queue implemented using an array of size \(N\), what is the condition to detect that the
Question: The maximum number of nodes in a binary tree of depth (height) \(h\) (where the root is at depth
Question: A computer system has a cache access time of 10 ns and a main memory access time of 100
Question: Which of the following cache write policies writes updated data simultaneously to both the cache and the main memory?