DSSSB TGT Computer Science Mock 02

Question: What is the time complexity to find the optimal parenthesization of a chain of \(n\) matrices using Dynamic Programming

Question: Which of the following is NOT one of the four necessary Coffman conditions for a Deadlock to occur in

Question: Match the logic gates in Column A with their universal/functional properties in Column B: Column A (Gate) Column B

Question: In Boolean algebra, what is the dual of the expression \(X + YZ\)? बूलियन बीजगणित में, व्यंजक \(X +

Question: Which flag in the 8085 microprocessor is set when an arithmetic operation produces a carry from bit \(D_3\) to

Question: Which graph traversal algorithm uses a Queue data structure? कौन-सा ग्राफ ट्रैवर्सल एल्गोरिदम कतार (Queue) डेटा संरचना का उपयोग

Question: Which collision resolution technique in hash tables maintains a linked list of records that hash to the same slot?

Question: A full binary tree with \(L\) leaves has how many internal nodes (nodes of degree 2)? \(L\) पत्तियों (Leaves)

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\)