Model Exam Questions 1 -25

 

                                    HSST Computer Science Model Examination – 2018

                                   013/2018 Question Paper Code : A

1. Two atomic operations permissible on Semaphores are ________ and _______
a) wait, stop
b) wait, hold
c) hold, signal
d)wait, signal

2. 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

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

4. A light weight process is

a) program

b) thread

c) mutex

d) semaphore

5. The cylinder skew problem is concerned with

a) Semaphore

b) Thrashing

c) Interleaving

d) Critical section

6. what is RAID ?

a) Redundant Array of Independent Disks

b) Reduced Array of Independent Disks

c) Redundant Array of Important Disks

d) None of these
7. Implementation technique where multiple instructions are overlapped in execution.

a) Hyper Threading
b) Pipelining
c) Parallel processing
d) None of these

8. What is the advantage of DRAM ?

a) Very dense

b) Low cost per bit

c) Simple memory cell structure

d) All of these

9.Volatile computer memory that provides high-speed data access to a processor and stores frequently used computer programs

a) Registers

b) Cache

c) Buffer
d) RAM

10. RS- 232 is used for

a) serial communication transmission of data

b) parallel communication transmission of data

c) securing data transmission among devices

d) encrypting data between hosts.

11. Method that allows an input/output (I/O) device to send or receive data directly to or from the main memory, bypassing the CPU to speed up memory operations.

a) Caching

b) Buffering

c) Direct Memory Access

d) Parallel Memory Access

12. A Compact Disk made of ________ layers

a) Two

b) Three

c) Four
d) Only one

13. High Speed in ECL is possible because transistors are used in difference amplifier configuration, in which they are never driven into ...............

a) Race condition

b) Saturation

c) Delay

d) High impedance

14) 1 GB is equal to

a) 2³⁰ bits

b) 2³⁰ bytes

c) 2²⁰ bits

d) 2²⁰ bytes

15. The depth of a complete binary tree is given by
a) D_n = n log₂n
b) D_n = n log₂n+1
c) D_n = log₂n
d) D_n = log₂n+1

16) When converting binary tree into extended binary tree, all the original nodes in binary tree are
a) internal nodes on extended tree
b) external nodes on extended tree
c) vanished on extended tree
d) None of above

17) Which of the following sorting algorithm is of divide-and-conquer type?
a) Bubble sort
b) Insertion sort
c) Quick sort
d) All of above

18) Which of the following data structure can't store the non-homogeneous data elements?
a) Arrays
b) Records
c) Pointers
d) None

19) Best time complexity of Heap sort is

a)O(n log(n))
b)O(n)
c)O(n^2)

d)O(log n )

20) Two main measures for the efficiency of an algorithm are
a) Processor and memory
b) Complexity and capacity
c) Time and space
d) Data and space

21. The output of the following statements is

char ch[6]={‘e’, ‘n’, ‘d’, ‘\0’, ‘p’};

printf(“%s”, ch);

a) endp

b) end0p

c) end

d) error
22. Which of the following cannot be passed to a function in C++?

a) Constant

b) Structure

c) Array

d) Header file

23. Which of the following storage classes have global visibility in C/C++?

a) Auto

b) Extern

c) Static

d) Register

24. ............... operator links a class to a member.

a) : :

b) .

c) ->                 

d) *

25. Among the following, the Java package which is used by the compiler itself and need not be explicitly imported is:
a) java.lang

b) java.awt
c) java.math

d) java.applet

Model Exam Questions 26 - 50