Quiz - DBMS

Q.1 Which is not the component of database system?

A. Database
B. Users
C. Database Query
D. All of the above

Ans - C
Explanation - The database system can be divided into four components- Users, Database, DBMS, Database Application

Q.2 The database architecture which is used for User interface programs and application programs that run on the client side.

A. One tier architecture
B. Two tier architecture
C. Three tier architecture
D. Four tier architecture

Ans - B

Q.3 An interface that provides an API to allow client side program to call
the dbms.

A. ODBC
B. JDBC
C. OBDC
D. JBDC

Ans - A
Explanation - Open Database Connectivity



Q.4 Which architecture is commonly used architecture for web application?

A. One Tier Architecture
B. Two Tier Architecture
C. Three Tier Architecture
D. Four Tier Architecture

Ans - C
Explanation- In the three tier architecture middle layer known as application server which send partially processed data between the client and database server

Q.5 The database model in which entities are organised in graph and some entities can be accessed through several path.

A. Relational Model
B. Heirarchy Model
C. Network Model
D. None of the above

Ans - C

Q.6 The rule to define the requirement for the DBMS to become Relational database management system.

A. Boyce-Codd
B. E. F. Codd
C. G.F. Codd
D. B.E.Codd

Ans - B

Q.7 Number of Rules in Codd's 12 rules?

A. 11
B. 12
C. 13
D. 8.5

Ans - C

Q.8 Which is correct statement ?

A. A tuple and true relation both cannot have duplicate tuples.
B. A tuple cannot have duplicate tuples while a true relation have duplicate tuples
C. A tuple have duplicate tuples while true relation cannot have duplicate tuples
D. None of the above

Ans - C

Q. 9 Referential integrity constraints work on the concept of

A. Primary Key
B. Candiadate key
C. Super Key
D. Foreign key

Ans - D

Data Structure - Quiz

Q.1 Total number of instruction executed in the worst case is n^2+4n-4 time complexity of the algorithm is in

A. theta(n^2)

B. O(n^2)

C. O(n)

D.theta(n)

Ans � A

Q.2The algorithm which compares all element one by one and sort them on the basis of their values is called

A. Quick sort

B. Bubble sort

C. Merge sort

D. heap sort

Ans � B

Q.3For performing enqueue we require how many stack/s?

A. one

B. two

C. three

D. four

Ans � A

Q.4For the given algorithm

for(i=0; i < N; i++)

{

  statement;

}

The time complexity will be

A. Linear

B. Constant

C. Quadratic

D. Logarithmic

Ans � A

Q.5For the given algorithm

while(low <= high) 

{

  mid = (low + high) / 2;

  if (target < list[mid])

    high = mid - 1;

  else if (target > list[mid])

    low = mid + 1;

  else break;

}

The time complexity will be

A. Linear

B. Constant

C. Quadratic

D. Logarithmic

Ans � D

Q.6For the given algorithm

for(i=0; i < N; i++) 

{

  for(j=0; j < N;j++)

  { 

    statement;

  }

}

The time complexity will be

A. Linear

B. Constant

C. Quadratic

D. Logarithmic

Ans � C

Q.7_____ is the set of functions that grow slower than or at the same rate as expression.

A. Theta(expression) 

B. Omega(expression) 

C. O(expression)

D. None of the above

Ans � C

Q.8 ________consist of all the functions that lie in both O(expression) and Omega(expression).

A. Theta(expression) 

B. Omega(expression) 

C. O(expression)

D. None of the above

Ans � A

Q.9 Integer, Float, Boolean, Char are

A. Primptive data structure

B. Abstract data structure

C. Non primptive data structure

D. Flow Chart

Ans- A

Q.10 The space required to store the executable version of the program.

A. Data Space

B. Instruction Space

C. Environment Space

D. Program Space

Ans � B

Quiz on Operating system

Q.1 First Come First Serve Algorithm is

a. Preemptive

b. Non preemptive

c. Computative

d. None of the above

Ans - b

Q.2  FCFS scheme is not useful in scheduling interactive users because it cannot guarantee

a. Good response cycle

b. Schedule of Processes

c. Good response time

d. Good throughput

Ans � c

Q.3 The average waiting time under round robin scheduling is often.

a. quite short

b. quite long

c. medium

d. none of the above

Ans- b

Q.4  The _______ is a certain store that allows the operating systems to locate key information about a process.

a. Operating system

b. Memory

c. Process Control Block

d. Play store

Ans - c

Q.5 The PCB contains important information about the specific process which does not include

a. Register

b. Clock

c. processor

d. Pointer

Ans- b

Q.6 Which of the following statement/s is/are true about threads?

1. Like processes, threads within a processes execute sequentially.

2. Unlike processes, thread can create children.

3. like processes, threads are not independent of one another.

a. All

b. Only 1

c. Only 2 &3

d. Only 1&3

Ans - b

Q.7  Use of threads in designing  Operating system

a. to make a great server

b. for interprocess communication

c. to not to take advantage of multiprocessor

d. to not to switch context

Ans � a

Q.8 Each thread has its own

a. Queue

b. Stack

c. Tree

d. None of the above

Ans - b

Q.9 The process of actually determining that a deadlock exists and identifying the processes and resources involved in the deadlock is called as

a. Deadlock avoidance

b. Deadlock  prevention

c. Deadlock detection

d. All of the above

Ans � c

Q.10 The complexity of deadlock detection algorithm is 

a. O(N)

b. O(N^2)

c. O

d. O(N^3)

Ans- b