DB Challenge
DB Challenge Quiz
Test your knowledge with our engaging DB Challenge Quiz! Dive into a variety of topics ranging from memory systems to resource management. This quiz is designed for students and professionals alike seeking to enhance their understanding of database concepts.
- Multiple choice questions
- Covering essential database and memory management topics
- Immediate feedback on your answers
Hyponymy
It may be defined as the relationship between a generic term and instances of that generic term. Here the generic term is called hypernym and its instances are called hyponyms. For example, the word color is hypernym and the color blue, yellow etc. Are hyponyms.
Hyponymy
It may be defined as the relationship between a generic term and instances of that generic term. Here the generic term is called hypernym and its instances are called hyponyms. For example, the word color is hypernym and the color blue, yellow etc. Are hyponyms.
The genetic term of Hyponymy
Hypernym
Homonym
1. Which of the following is NOT a valid deadlock prevention scheme?
Request and all required resources be allocated before execution.
Never request a resource after releasing any resource
Number the resources uniquely and never request a lower numbered resource than the last one requested.
2.A graphics card has on board memory of 1 MB. Which of the following modes can the card not support?
1600 x 400 resolution with 256 colours on a 17 inch monitor
1600 x 400 resolution with 16 million colours on a 14 inch monitor
800 x 800 resolution with 256 colours on a 14 inch monitor
3. Consider a virtual memory system with FIFO page replacement policy. For an arbitrary page access pattern, increasing the number of page frames in main memory will
Always decrease the number of page faults
Always increase the number of page faults
Some times increase the number of page faults
4.Which of the following requires a device driver?
Disk
Register
Cache
5. Consider a disk pack with 16 surfaces, 128 tracks per surface and 256 sectors per track. 512 bytes of data are stored in a bit serial manner in a sector. The capacity of the disk pack and the number of bits required to specify a particular sector in the disk are respectively:
256 Mbyte, 19 bits
253 Mbyte, 19 bits
256 Mbyte, 18 bits
6.Suppose the time to service a page fault is on the average 10 milliseconds, while a memory access takes 1 microsecond. Then a 99.99% hit ratio results in average memory access time of
9.999 microseconds
1.9999 microseconds
1.9999 milliseconds
7.Which of the following need not necessarily be saved on a context switch between processes?
General purpose registers
Translation look-aside buffer
Both
8.Where does the swap space reside ?
RAM
ROM
Disk
9.Which of the following does not interrupt a running process?
Scheduler process
Timer
A device
10.Which of the following scheduling algorithms is non-preemptive?
Round Robin
First-in-first-out
Multilevel Queue Scheduling
{"name":"DB Challenge", "url":"https://www.quiz-maker.com/QPREVIEW","txt":"Test your knowledge with our engaging DB Challenge Quiz! Dive into a variety of topics ranging from memory systems to resource management. This quiz is designed for students and professionals alike seeking to enhance their understanding of database concepts.Multiple choice questionsCovering essential database and memory management topicsImmediate feedback on your answers","img":"https:/images/course1.png"}
More Quizzes
Computer Skills Assessment
20100
Computer Systems Architecture
442230
Data Structure
13614
OOPS Introduction
3225
Data Structure
10524
Stacks and Queues
5246
Data Structure and Algorithms
1059
Mapping Functions Quiz
15812
Day1
12625
6. MATHEMATICAL ANALYSIS FOR NON-RECURSIVE AND RECURSIVE ALGORITHMS
5264
DS
1050
DB Mania
301526