DSSSB TGT CS Mock 03 – Question 110
Question: What is the minimal boolean expression for the function \(F(A, B, C, D) = \sum m(0, 2, 8, 10,
Question: What is the minimal boolean expression for the function \(F(A, B, C, D) = \sum m(0, 2, 8, 10,
Question: A 4-way set-associative cache memory has a total size of 64 KB with a cache block size of 64
Question: Belady’s Anomaly (where increasing the number of page frames results in an increase in page faults) can occur in
Question: In a 5-stage instruction pipeline (IF, ID, EX, MEM, WB), an instruction produces a result that is immediately needed
Question: Which of the following conditions is NOT a necessary condition for a deadlock to occur in an operating system?
Question: A system uses paging with a page size of 4 KB and a 32-bit logical address space. Each page
Question: Consider an array of size \(n\) representing a Binary Max-Heap. What is the time complexity to build this Max-Heap
Question: In an AVL tree, the balance factor of every node must be in the range of: एक AVL ट्री
Question: What is the tight asymptotic time complexity of the recurrence relation \(T(n) = 3T(n/2) + n \log n\)? पुनरावृत्ति
Question: निर्देश (प्रश्न 16 – 20): निम्नलिखित गद्यांश को ध्यानपूर्वक पढ़कर नीचे दिए गए प्रश्न का उत्तर दीजिए: आधुनिक युग