Information Technology GK

03/06/2021

6. Which of the following is not an inherent application of stack?
a) Reversing a string
b) Evaluation of postfix expression
c) Implementation of recursion
d) Job scheduling

ans..d

28/05/2021

1. The process of producing useful information for the user is called
a) Controlling
b) Outputting
c) Inputting
d) Processing
asn
b

28/05/2021

28/05/2021

5. Which of the following describes the correct format of an input instruction?
a) IN 82
b) INPUT 82
c) INP 82
d) 82 INP

ans
a
a

27/05/2021

5. The postfix form of W*X+Y/Z is?
a) *WX/YZ+
b)WX*YZ/+
c) W*XY+/Z
d) WXYZ+/*
ans (b)

27/05/2021

13. Elements in an array are accessed _____________
a) randomly
b) sequentially
c) exponentially
d) logarithmically

18/09/2019

1. What is the reusable resource?
a) that can be used by one process at a time and is not depleted by that use
b) that can be used by more than one process at a time
c) that can be shared between various threads
d) none of the mentioned

Answer: a

2. Which of the following condition is required for deadlock to be possible?
a) mutual exclusion
b) a process may hold allocated resources while awaiting assignment of other resources
c) no resource can be forcibly removed from a process holding it
d) all of the mentioned

Answer: d

3. A system is in the safe state if
a) the system can allocate resources to each process in some order and still avoid a deadlock
b) there exist a safe sequence
c) all of the mentioned
d) none of the mentioned

Answer: a

4. The circular wait condition can be prevented by
a) defining a linear ordering of resource types
b) using thread
c) using pipes
d) all of the mentioned

Answer: a

5. Which one of the following is the deadlock avoidance algorithm?
a) banker’s algorithm
b) round-robin algorithm
c) elevator algorithm
d) karn’s algorithm

Answer: a

6. What is the drawback of banker’s algorithm?
a) in advance processes rarely know that how much resource they will need
b) the number of processes changes as time progresses
c) resource once available can disappear
d) all of the mentioned

Answer: d

7. For effective operating system, when to check for deadlock?
a) every time a resource request is made
b) at fixed time intervals
c) every time a resource request is made at fixed time intervals
d) none of the mentioned

Answer: c

8. A problem encountered in multitasking when a process is perpetually denied necessary resources is called
a) deadlock
b) starvation
c) inversion
d) aging

Answer: b

9. Which one of the following is a visual ( mathematical ) way to determine the deadlock occurrence?
a) resource allocation graph
b) starvation graph
c) inversion graph
d) none of the mentioned

Answer: a

10. To avoid deadlock
a) there must be a fixed number of resources to allocate
b) resource allocation must be done only once
c) all deadlocked processes must be aborted
d) inversion technique can be used

Answer: a

17/08/2019

1. A monitor is a type of :
a) semaphore
b) low level synchronization construct
c) high level synchronization construct
d) none of the mentioned

Answer: c

2. A monitor is characterized by :
a) a set of programmer defined operators
b) an identifier
c) the number of variables in it
d) all of the mentioned

Answer: a

3. A procedure defined within a ________ can access only those variables declared locally within the _______ and its formal parameters.
a) process, semaphore
b) process, monitor
c) semaphore, semaphore
d) monitor, monitor

Answer: d

4. The monitor construct ensures that :
a) only one process can be active at a time within the monitor
b) n number of processes can be active at a time within the monitor (n being greater than 1)
c) the queue has only one process in it at a time
d) all of the mentioned

Answer: a

5. The operations that can be invoked on a condition variable are :
a) wait & signal
b) hold & wait
c) signal & hold
d) continue & signal

Answer: a

6. The process invoking the wait operation is :
a) suspended until another process invokes the signal operation
b) waiting for another process to complete before it can itself call the signal operation
c) stopped until the next process in the queue finishes ex*****on
d) none of the mentioned

Answer: a

7. If no process is suspended, the signal operation :
a) puts the system into a deadlock state
b) suspends some default process’ ex*****on
c) nothing happens
d) the output is unpredictable

Answer: c

10/08/2019

1. An un-interruptible unit is known as :
a) single
b) atomic
c) static
d) none of the mentioned

Answer: b

2. The TestAndSet instruction is executed :
a) after a particular process
b) periodically
c) atomically
d) none of the mentioned

Answer: c

3. Semaphore is a/an _______ to solve the critical section problem.
a) hardware for a system
b) special program for a system
c) integer variable
d) none of the mentioned

Answer: c
4. The two atomic operations permissible on semaphores are :
a) wait
b) stop
c) hold
d) none of the mentioned

Answer: a

5. Spinlocks are :
a) CPU cycles wasting locks over critical sections of programs
b) Locks that avoid time wastage in context switches
c) Locks that work better on multiprocessor systems
d) All of the mentioned

Answer: d

6. The main disadvantage of spinlocks is that :
a) they are not sufficient for many process
b) they require busy waiting
c) they are unreliable sometimes
d) they are too complex for programmers

Answer: b
7. The wait operation of the semaphore basically works on the basic _______ system call.
a) stop()
b) block()
c) hold()
d) wait()

Answer: b

8. The signal operation of the semaphore basically works on the basic _______ system call.
a) continue()
b) wakeup()
c) getup()
d) start()

Answer: b

9. If the semaphore value is negative :
a) its magnitude is the number of processes waiting on that semaphore
b) it is invalid
c) no operation can be further performed on it until the signal operation is performed on it
d) none of the mentioned

Answer: a

10. The code that changes the value of the semaphore is :
a) remainder section code
b) non – critical section code
c) critical section code
d) none of the mentioned

Answer: c

10/08/2019

1. The bounded buffer problem is also known as :
a) Readers – Writers problem
b) Dining – Philosophers problem
c) Producer – Consumer problem
d) None of the mentioned

Answer: c

2. In the bounded buffer problem, there are the empty and full semaphores that :
a) count the number of empty and full buffers
b) count the number of empty and full memory spaces
c) count the number of empty and full queues
d) none of the mentioned

Answer: a

3. In the bounded buffer problem :
a) there is only one buffer
b) there are n buffers ( n being greater than one but finite)
c) there are infinite buffers
d) the buffer size is bounded

Answer: b

4. To ensure difficulties do not arise in the readers – writers problem, _______ are given exclusive access to the shared object.
a) readers
b) writers
c) readers and writers
d) none of the mentioned

Answer: b

5. The dining – philosophers problem will occur in case of :
a) 5 philosophers and 5 chopsticks
b) 4 philosophers and 5 chopsticks
c) 3 philosophers and 5 chopsticks
d) 6 philosophers and 5 chopsticks

Answer: a

6. A deadlock free solution to the dining philosophers problem :
a) necessarily eliminates the possibility of starvation
b) does not necessarily eliminate the possibility of starvation
c) eliminates any possibility of any kind of problem further
d) none of the mentioned

Answer: b
7. All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward.
Suppose a process executes in the following manner :

signal(mutex);....
critical section....
wait(mutex);
In this situation :
a) a deadlock will occur
b) processes will starve to enter critical section
c) several processes maybe executing in their critical section
d) all of the mentioned

Answer: c

8. All processes share a semaphore variable mutex, initialized to 1. Each process must execute wait(mutex) before entering the critical section and signal(mutex) afterward.
Suppose a process executes in the following manner :

wait(mutex);....
critical section....
wait(mutex);
a) a deadlock will occur
b) processes will starve to enter critical section
c) several processes maybe executing in their critical section
d) all of the mentioned

Answer: a

04/08/2019

1. Concurrent access to shared data may result in
a) data consistency
b) data insecurity
c) data inconsistency
d) none

Answer c

2. A situation where several processes access and manipulate the same data concurrently and the outcome of the ex*****on depends on the particular order in which access takes place is called
a) data consistency
b) race condition
c) aging
d) starvation

Answer b

3. The segment of code in which the process may change common variables, update tables, write into files is known as
a) program
b) critical section
c) non – critical section
d) synchronizing

Answer b

4. The following three conditions must be satisfied to solve the critical section problem
a) Mutual Exclusion
b) Progress
c) Bounded Waiting
d) All of the mentioned

Answer d

5. Mutual exclusion implies that
a) if a process is executing in its critical section, then no other process must be executing in their critical sections
b) if a process is executing in its critical section, then other processes must be executing in their critical sections
c) if a process is executing in its critical section, then all the resources of the system must be blocked until it finishes ex*****on
d) none of the mentioned

Answer a
6. Bounded waiting implies that there exists a bound on the number of times a process is allowed to enter its critical section
a) after a process has made a request to enter its critical section and before the request is granted
b) when another process is in its critical section
c) before a process has made a request to enter its critical section
d) none of the mentioned

Answer a

7. A minimum of _____ variable(s) isare required to be shared between processes to solve the critical section problem.
a) one
b) two
c) three
d) four

Answer b

04/08/2019

1. Which module gives control of the CPU to the process selected by the short-term scheduler?
a) dispatcher
b) interrupt
c) scheduler
d) none of the mentioned
Answer: a

2. The processes that are residing in main memory and are ready and waiting to execute are kept on a list called
a) job queue
b) ready queue
c) ex*****on queue
d) process queue

Answer: b

3. The interval from the time of submission of a process to the time of completion is termed as
a) waiting time
b) turnaround time
c) response time
d) throughput

Answer: b

4. Which scheduling algorithm allocates the CPU first to the process that requests the CPU first?
a) first-come, first-served scheduling
b) shortest job scheduling
c) priority scheduling
d) none of the mentioned

Answer: a

5. In priority scheduling algorithm
a) CPU is allocated to the process with highest priority
b) CPU is allocated to the process with lowest priority
c) Equal priority processes can not be scheduled
d) None of the mentioned

Answer: a
6. In priority scheduling algorithm, when a process arrives at the ready queue, its priority is compared with the priority of
a) all process
b) currently running process
c) parent process
d) init process

Answer: b

7. Time quantum is defined in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

Answer: b

8. Process are classified into different groups in
a) shortest job scheduling algorithm
b) round robin scheduling algorithm
c) priority scheduling algorithm
d) multilevel queue scheduling algorithm

Answer: d

9. In multilevel feedback scheduling algorithm
a) a process can move to a different classified ready queue
b) classification of ready queue is permanent
c) processes are not classified into groups
d) none of the mentioned

Answer: a

10. Which one of the following can not be scheduled by the kernel?
a) kernel level thread
b) user level thread
c) process
d) none of the mentioned

Answer: b