DSSSB TGT Computer Science Mock 03

Question: Belady’s Anomaly (where increasing the number of page frames results in an increase in page faults) can occur in

Question: A 4-way set-associative cache memory has a total size of 64 KB with a cache block size of 64

Question: What is the minimal boolean expression for the function \(F(A, B, C, D) = \sum m(0, 2, 8, 10,

Question: In Dijkstra’s single-source shortest path algorithm implemented with a Min-Heap (Binary Heap), what is the worst-case time complexity for

Question: Consider the following C code snippet: int arr[] = {10, 20, 30, 40, 50}; int *ptr = arr; int

Question: What is the tight asymptotic time complexity of the recurrence relation \(T(n) = 3T(n/2) + n \log n\)? पुनरावृत्ति

Question: In an AVL tree, the balance factor of every node must be in the range of: एक AVL ट्री

Question: Consider an array of size \(n\) representing a Binary Max-Heap. What is the time complexity to build this Max-Heap

Question: A system uses paging with a page size of 4 KB and a 32-bit logical address space. Each page