Free Printable Quiz Time

1.

Q1. An example of a binary number which is equal to its 2’s complements is...............

a)

a. 1100

b)

b. 1001

c)

c. 1000

d)

d. 1111

2.

Q2. Match the Following

A. Disk Schedulin 1. Round RObin

B. Batch Processing 2. Scan

C. Time Sharing 3. FIFI

D. Interrupt Processing 4. FIFO

a)

a. A-3, B-4, C-2, D-1

b)

b. A-4, B-3, C-2, D-1

c)

c. A-2, B-4, C-1, D-3

d)

d. A-3, B-4, C-1, D-2

3.

Making sure that all the data packets of a message are delivered to the destination is ……………….control

a)

Error

b)

Loss

c)

Sequence

d)

Duplications

4.

In which of the following storage replacement strategies, is a program placed in the largest available hole in memory?

a)

Best Fit

b)

First Fit

c)

Worst Fit

d)

Buddy

5.

Weighed Graph:

a)

Is a bi-directional graph

b)

Is directed graph

c)

Is graph in which number associated with arc

d)

Eliminates table method

6.

Code Optimization is responsibility of:

a)

Application Programmer

b)

System Programmer

c)

Operating System

d)

All of the above

7.

Remote computing system involves the use of time sharing systems and:

a)

Real time processing

b)

Batch Processing

c)

Multiprocessing

d)

All of the above

8.

Specialization is a ……………Process

a)

Top-Down

b)

Bottom-Up

c)

Both (a) and (b)

d)

None of the these

9.

Polymorphism means

a)

A template functions

b)

Runtime type identifications within a class hierarchy

c)

Another name of Operator Overloading

d)

Virtual Inheritance

10.

What operation is supported in constant time by the doubly linked list but not by singly linked list?

a)

Advance

b)

Backup

c)

First

d)

Retrieve

11.

How much extra space is used by heap sort?

a)

O(1)

b)

O(logn)

c)

O(n)

d)

O(n^p)

12.

Data Mining can be used as ………….tool.

a)

Software

b)

Hardware

c)

Research

d)

Process

13.

A data warehouse is always …………….

a)

Subject oriented

b)

Object Oriented

c)

Program oriented

d)

Compile oriented

14.

A v A = A is called

a)

Identity law

b)

De-Morgan’s Law

c)

Idempotent Law

d)

Complement Law

15.

Which of the following is divisible by 4?

a)

100101100

b)

1110001110001

c)

11110011

d)

10101010101010

16.

A Half adder is also known as

a)

AND circuit

b)

NAND circuit

c)

NOR Circuit

d)

Ex-OR Circuit

17.

Data members and members functions of a class by default is respectively

a)

Private and Public

b)

Public

c)

Public and Private

d)

Private

18.

The bitwise OR of 35 with 7 in C will be:

a)

35

b)

7

c)

42

d)

39

19.

A schema describes:

a)

Data elements

b)

Records and files

c)

Record relationship

d)

All of the above

20.

Encryption and Decryption are the functions of the …………..layer of OSI Model

a)

Transport

b)

Session

c)

Router

d)

Presentation

21.

…………….Provide a method to recover data that has been delivered but not get used:

a)

Segmentation

b)

Concatenation

c)

Translation

d)

Synchronization

22.

Which of the following is an example of client-server model:

a)

DNS

b)

FTP

c)

TELNET

d)

All of the above

23.

The data unit in the TCP/IP application Layer is called a…………….

a)

Message

b)

Segment

c)

Datagram

d)

Frame

24.

The initial configuration of the queue is a,b,c, d. ‘a’ is at the front. To get the configuration d,c,b,a. How many deletions and addition required.

a)

2 deletions, 3 additions

b)

3 deletions, 2 additions

c)

3 deletions, 4 additions

d)

3 deletions, 3 additions

25.

Banker’s Algorithm is used for …………………….purpose

a)

Deadlock Avoidance

b)

Deadlock Removal

c)

Deadlock Prevention

d)

Deadlock continuations

26.

Which of the following file retrieval methods use hypermedia?

a)

HTML

b)

Veronica

c)

Datagram

d)

HTTP

27.

Which of the following transmission media is used in Bluetooth Technology.

a)

Radio Link

b)

Microwave links

c)

VSAT Communication

d)

Fiber Optic

28.

In what tree, for every node the height of its left subtree and right subtree differ at least by one

a)

Binary Search Tree

b)

AVL Tree

c)

Threaded binary tree

d)

Complete tree

29.

A locked file can be

a)

Accessed by only one users

b)

Modified by users with the correct password

c)

Is used to hide sensitive information

d)

Both (b) and (c)

30.

(101011)₂ = (53)_b then b is equal to

a)

4

b)

8

c)

10

d)

16

31.

The data hiding is taken care by

a)

Abstraction

b)

Encapsulations

c)

Modularity

d)

Inheritance

32.

If the Postfix form of a string is ABC+-D* the actual string is

a)

(A-(B+C))*D

b)

((A-B)+C)*D

c)

((A+B)-C)*D

d)

(A+(B-C))*D

33.

Multivalued dependency among attribute is checked at which level?

a)

2NF

b)

3NF

c)

4NF

d)

5NF

34.

What is the time required to insert an element in a stack with linked implementation?

a)

O(log₂n)

b)

O(n)

c)

O(nlog₂n)

d)

O(1)

35.

The dynamic binding occurs during the

a)

Compile Time

b)

Run Time

c)

Linking Time

d)

Pre-Processing Time

36.

Moving Process from main memory to disk is called:

a)

Caching

b)

Termination

c)

Swapping

d)

Interruption

37.

Which of the following is not an Unix Commands?

a)

ls

b)

whoami

c)

cat

d)

put

38.

What is the Full form of NTFS?

a)

New Technology File System

b)

New Technology Format Software

c)

New Topology Format Secure

d)

New Topology Format System

39.

Which one of the following is not a software process model?

a)

Linear Sequential Model

b)

Prototyping Model

c)

The Spiral Model

d)

COCOMO Model

40.

Another Name of IEEE 802.11a is

a)

WECA

b)

Fast Ethernet

c)

Wifi 5

d)

802-11g

41.

Which is the correct definition of a valid process transition in an Operating System?

a)

Wake up: Ready -> Running

b)

Dispatch: Ready -> Running

c)

Block: Ready -> Running

d)

Timer run out: Ready -> Blocked

42.

The hexadecimal equivalent of (10111)₂x (1110)₂is

a)

150

b)

241

c)

142

d)

101011110

43.

The number of edges in a complete graph with N vertices is equal to

a)

N(N-1)

b)

2N-1

c)

N-1

d)

N(N-1)/2

44.

The Network 198.78.41.0 is a

a)

Class A

b)

Class B

c)

Class C

d)

Class D

45.

Binary Search Tree is an example of

a)

Divide and conquer technique

b)

Greedy Algorithm

c)

Back Tracking

d)

Dynamic Programming

46.

………………….. is one of Pre-emptive scheduling algorithm?

a)

SJF

b)

Round-Robin

c)

FCFS

d)

Option FCFS and SJF

47.

An Operating system is

a)

Collection of hardware components

b)

Collection of input and output device

c)

Collection of software routines

d)

All of the above

48.

Which of the following is a physical data structure?

a)

Array

b)

Linked list

c)

Stack

d)

Tables

49.

The equivalent postfix expression for d/(e+f)+b*c

a)

defbc/++*

b)

def+/bc+*

c)

def+/bc*+

d)

None of the above

50.

Abstraction is ……… step of attribute in a software design

a)

First

b)

Final

c)

Last

d)

Middle

51.

In an object oriented software design, Inheritance is a kind of…

a)

Relationship

b)

Module

c)

Testing

d)

Optimization

52.

The First Operating system of Micro-processor is

a)

ATLAS

b)

CP/M

c)

SAGE

d)

T.H.E

53.

Preorder is also known as

a)

DFS

b)

BFS

c)

Topological order

d)

Liner Order

54.

A subclass having more than one super class is called ………..

a)

Quiz Time - Learn eQuick

Total questions: 80

Worksheet time: 3600secs

Similar Resources on Wayground