SSC IMD Scientific Assistant – Full Length Mock 01

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: What is the time complexity to insert a new node at the end of a singly linked list if

Question: Which of the following interrupts has the highest priority in the 8085 microprocessor? 8085 माइक्रोप्रोसेसर में निम्नलिखित में से

Question: Consider a 2D array \(A[1..10, 1..15]\) stored in row-major order with base address 1000. Each element occupies 4 bytes.

Question: A computer system has a cache access time of 10 ns and a main memory access time of 100