PYQBOOK

Filter Questions

Exam

Branch

Paper-Name

Subject

Topic

Found 475 question(s)

Q96 NAT GATE CS Medium 1 Mark 2024

COA → I/O Interface

A keyboard is used at 1 keystroke per second. In polling, it polls every 10 ms consuming 100 μs each poll, plus 200 μs to process a stroke (T1 is fraction of sec spent). In interrupt, it takes 1 ms to service/process per keystroke (T2 is fraction of sec spent). The ratio T1/T2 is

Enter Numerical Answer:

Q97 MSQ GATE CS Medium 2 Marks 2024

COA → Cache Memory

Consider two set-associative cache memory architectures: WBC, which uses the write back policy, and WTC, which uses the write through policy. Both of them use the LRU (Least Recently Used) block replacement policy. The cache memory is connected to the main memory. Which of the following statements is/are TRUE?

Choose All Applicable:

A) A read miss in WBC never evicts a dirty block

B) A read miss in WTC never triggers a write back operation of a cache block to main memory

C) A write hit in WBC can modify the value of the dirty bit of a cache block

D) A write miss in WTC always writes the victim cache block to main memory before loading the missed block to the cache

Q98 NAT GATE CS Medium 2 Marks 2024

COA → Amdahl's Law

The baseline execution time of a program on a 2 GHz single core machine is 100 ns. The code corresponding to 90% of the execution time can be fully parallelized. The overhead for using an additional core is 10 ns when running on a multicore system. The number of cores that minimize the execution time of the program is

Enter Numerical Answer:

Q99 NAT GATE CS Medium 1 Mark 2024

COA → Pipelining

Consider a 3-stage pipelined processor having a delay of 10 ns, 20 ns, and 14 ns for the first, second, and third stages. Assume no other delay and no pipeline hazards. One instruction is fetched every cycle. The total execution time for executing 100 instructions on this processor is ___ ns.

Enter Numerical Answer:

Q100 NAT GATE CS Hard 2 Marks 2024

DBMS → Indexing

A database of fixed-length records is stored as an ordered file. It has 25,000 records, each 100 bytes, with a 15-byte primary key. The data file is block-aligned. It is indexed by a primary index file (block-aligned ordered file). Block size is 1024 bytes, and a block pointer is 5 bytes. The system uses binary search on the index file (taking ceil(log2 b) accesses for b blocks). Given a key, the number of block accesses required to identify the data block containing the record in the worst case is

Enter Numerical Answer:

1
2
3
.....
18
19
20
21
22
.....
93
94
95