August 2023

Let 𝑇 be a full binary tree with 8 leaves

Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π‘Ž and 𝑏 of 𝑇 are chosen uniformly and independently at random

Q. Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π‘Ž and 𝑏 of 𝑇 are chosen uniformly and independently at random. The expected value of the distance between π‘Ž and 𝑏 in 𝑇 (i.e., the number of edges in the unique path […]

Let 𝑇 be a full binary tree with 8 leaves. (A full binary tree has every level full.) Suppose two leaves π‘Ž and 𝑏 of 𝑇 are chosen uniformly and independently at random Read More Β»

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock.

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock.

Q. A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. To service a cache miss, the memory controller first takes 1 cycle to accept the starting address of the block, it then takes 3 cycles to

A certain processor deploys a single-level cache. The cache block size is 8 words and the word size is 4 bytes. The memory system uses a 60-MHz clock. Read More Β»

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers

Q. The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers. The disk block size is 4 kB, and the disk block address is 32-bits long. The maximum possible file size is (rounded off to 1 decimal place) ____________GB. Solution: No. of Disk block pointers = 4kB/32bits

The index node (inode) of a Unix-like file system has 12 direct, one single-indirect and one double-indirect pointers Read More Β»

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below

Q. Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below: Process P1 P2 P3 P4 Arrival time 0 1 3 4 CPU burst time 3 1 3 Z These processes are run on a single processor using preemptive Shortest Remaining Time First scheduling

Consider the following four processes with arrival times (in milliseconds) and their length of CPU bursts (in milliseconds) as shown below Read More Β»

Consider the following snapshot of a system running n concurrent processes. Process i is holding xi instances of a resource R, 1 ≀ i ≀ n. Assume that all instances of R are currently in use

Consider the following snapshot of a system running 𝑛 concurrent processes. Process 𝑖 is holding 𝑋𝑖 instances of a resource R, 1 ≀ 𝑖 ≀ 𝑛. Assume that all instances of R are currently in use

Q. Consider the following snapshot of a system running 𝑛 concurrent processes. Process 𝑖 is holding 𝑋𝑖 instances of a resource R, 1 ≀ 𝑖 ≀ 𝑛. Assume that all instances of R are currently in use. Further, for all 𝑖, process 𝑖 can place a request for at most π‘Œπ‘– additional instances of R

Consider the following snapshot of a system running 𝑛 concurrent processes. Process 𝑖 is holding 𝑋𝑖 instances of a resource R, 1 ≀ 𝑖 ≀ 𝑛. Assume that all instances of R are currently in use Read More Β»

New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023

New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023

New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023: The Income-tax Department has witnessed a remarkable surge in the filing of Income Tax Returns (ITRs) for Assessment Year (AY) 2023-24. The department thanks taxpayers and tax professionals for their prompt compliance, which has resulted in a new record of

New record of over 6.77 crore Income Tax Returns (ITRs) filed till 31st July, 2023 Read More Β»

India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure

India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure

India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure: The manufacturing sector in India saw a minor slowdown in July, with the Purchasing Managers’ Index (PMI) dipping to 57.7 from 57.8 in June and 58.7 in May. However, the figure still indicates expansion in the sector. The buoyant demand, both domestic and

India’s Manufacturing PMI Eases to 3-Month Low in July Amid Inflationary Pressure Read More Β»

There are n unsorted arrays: A1, A2, …, An. Assume that n is odd. Each of A1, A2, …, An contains n distinct elements. There are no common elements between any two arrays

There are n unsorted arrays: A1, A2, …, An. Assume that n is odd. Each of A1, A2, …, An contains n distinct elements. There are no common elements between any two arrays

Q. There are n unsorted arrays: A1, A2, …, An. Assume that n is odd. Each of A1, A2, …, An contains n distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of A1, A2, …, An is (A) O(n) (B) O(n

There are n unsorted arrays: A1, A2, …, An. Assume that n is odd. Each of A1, A2, …, An contains n distinct elements. There are no common elements between any two arrays Read More Β»

Scroll to Top