MCQOPTIONS
Bookmark
Saved Bookmarks
→
Computer Science Engineering (CSE)
→
Software Design Modeling
→
The data structure suitable for scheduling proces...
1.
The data structure suitable for scheduling processes is
A.
list
B.
heap
C.
queue
D.
stack
Answer» D. stack
Show Answer
Discussion
No Comment Found
Post Comment
Related MCQs
The bit is used to indicate the validity of the page.
BUS arbitration approach uses the involvement of the processor.
The read and write operations usually start at of the sector.
The cache bridges the speed gap between and
The multiplier is stored in
In LRU, the referenced blocks counter is set to’0′ and that of the previous blocks are incremented by one and others remain same, in the case of
In a 4M-bit chip organisation has a total of 19 external connections.then it has address if 8 data lines are there.
In the output interface of the parallel port, along with the valid signal is also sent.
The is used to coordinate the operation of the multiplier.
The only difference between the EEPROM and flash memory is that the latter doesn’t allow bulk data to be written.
Reply to Comment
×
Name
*
Email
*
Comment
*
Submit Reply
Your experience on this site will be improved by allowing cookies. Read
Cookie Policy
Reject
Allow cookies
