Join Us ::

Menu Home Classes GK Engineering Past Papers Current Affairs Technical GAT Subject Programming Medical Papers

Computer Science :: All Aptitude Test ::

Home » GAT Subject » Computer Science » Aptitude Test - 28
1.Routine is not loaded until it is called. All routines are kept on disk in a relocatable load format. The main program is loaded into memory & is executed. This type of loading is called _________ ?
A. Static loading
B. Dynamic loading
C. Dynamic linking
D. Static loading
2.Unix Operating System is an __________. ?
A. Time Sharing Operating System
B. Multi-User Operating System
C. Multi-tasking Operating System
D. Time Sharing Operating System
3.Which file system does DOS typically use ?
A. FAT16
B. FAT32
C. NTFS
D. FAT16
4.The program is known as _________ which interacts with the inner part of called kernel. ?
A. Compiler
B. Device Driver
C. Protocol
D. Compiler
5. Identify the odd thing in the services of operating system.?
A. Accounting
B. Protection
C. Error detection and correction
D. Accounting
6.Cryptography technique is used in ________. ?
A. Job Scheduling
B. Protection
C. Polling
D. Job Scheduling
7.Which of the following is not advantage of multi programming?
A. Increased throughput
B. Shorter response time
C. Decreased operating system overhead
D. Increased throughput
8.Which technique was introduced because a single job could not keep both the CPU and the I/O devices busy?
A. Time-sharing
B. Spooling
C. Preemptive scheduling
D. Time-sharing
9.Which of the following variable wait within the to enable a process....?
A. a condition is defined by a condition variable
B. objects Boolean objects can be used by condition variables
C. semaphore must be used
D. a condition is defined by a condition variable
10.In which the access takes place when different processes try to access the same data concurrently and the outcome of the execution depends on the specific order, is called?
A. dynamic condition
B. race condition
C. essential condition
D. dynamic condition
11.Which of the following option is suitable when a process is executing in its critical section, then no other processes can be executing in their critical section?
A. critical exclusion
B. synchronous exclusion
C. d asynchronous exclusion
D. critical exclusion
12.Synchronization tool is?
A. thread
B. pipe
C. semaphore
D. thread
13. A semaphore is a shared integer variable that can not?
A. drop below zero
B. be more than zero
C. drop below one
D. drop below zero
14.Which of the following for Mutual exclusion can be provided by the:
A. mutex locks
B. binary semaphores
C. both mutex locks and binary semaphores
D. mutex locks
15.Process synchronization can be done on which of the following levels:
A. hardware
B. software
C. both hardware and software
D. hardware
16.A monitor is a module and monitor which of the following can encapsulates:
A. shared data structures
B. procedures that operate on shared data structure
C. synchronization between concurrent procedure invocation
D. shared data structures
17.Which of the following process can be affected by other processes during execution in the system?
A. init process
B. child process
C. parent process
D. init process
18. How can we avoid deadlock:
A. resource allocation must be done at once
B. there must be a fixed number of resources to allocate
C. all deadlock process must be aborted
D. resource allocation must be done at once
19.Where the Paging is implemented ……?
A. Software
B. Operating System
C. Hardware
D. Software
20.Which one of the following is not true about Kernel?
A. The kernel is made of various modules which can not be loaded in the running operating system
B. Kernel remains in the memory during the entire computer session
C. the kernel is the program that constitutes the central core of the operating system
D. The kernel is made of various modules which can not be loaded in the running operating system
21.The page fault is the ……?
A. Reference to a page belonging to another program
B. Access to a page not currently in memory
C. error in a specific page
D. Reference to a page belonging to another program
22.Peterson’s solution is restricted to ___ processes that alternate execution between their critical sections and remainder sections?
A. One
B. Two
C. Three
D. One
23.We use the mutex lock to protect critical regions and thus prevent race conditions.the term mutex is short for:
A. mutual exception
B. mutual exclusion
C. mutually explained
D. mutual exception
24.Select the correct statements regarding mutex lock to prevent race condition:
A. 1 and 3
B. 2 and 4
C. 3 and 4
D. 1 and 3
25. The main disadvantage of the Mutex Lock is:
A. No waiting
B. mutex locks can not be used to solve classical synchronization problems
C. none of the above
D. No waiting
26.In Spinlocks :
A. no context switch is required when a process must wait on a lock
B. locks are expected to be held for short times
C. employed on multiprocessor systems
D. no context switch is required when a process must wait on a lock
27.A semaphore S is an integer variable that, apart from initialization, is accessed only through two standard atomic operations:
A. exec() and exit()
B. exec() and signal()
C. wait() and exit()
D. exec() and exit()
28.where two or more processes are waiting indefinitely for an event that can be caused only by one of the waiting processes is called:
A. MutexLocks
B. deadlocked
C. spinlocks
D. MutexLocks
29.Indefinite blocking may occur if we remove processes from the list associated with a semaphore in ________ order.
A. LIFO (last-in, first-out)
B. FIFO (First-in, first-out)
C. LIFO and FIFO
D. LIFO (last-in, first-out)
30.In Priority Inversion Which of following Stands TRUE:
A. A scheduling challenge arises when a higher-priority process needs to read or modify kernel data that are currently being accessed by a lower-priority process
B. Since kernel data are typically protected with a lock, the higher-priority process will have to wait for a lower-priority one to finish with the resource
C. The situation becomes more complicated if the lower-priority process is preempted in favor of another process with a higher priority
D. A scheduling challenge arises when a higher-priority process needs to read or modify kernel data that are currently being accessed by a lower-priority process
Related Subjects

Date to Date Current Affairs 2022

PakMCQs.net

Quick Links

GAT Subject



   Computer Science    English Mcqs    Agriculture    

Engineering



   Computer Science    Civil Engineering    

Technical



   Networking    Electronics    Database    

Past Papers



   Model Papers    FPSC Papers    
Our Team | Career | Contact | JoinUs | Privacy Policy | DMC

© 2020-2025 by Pak-MCQs.net All Rights Reserved.

Email: [email protected]