Data Base Management System Online Test

Back

Data Base Management System

Description: Complete study material for DBMS, RDBMS, Data Base Management System, Relational Data Base Management System, Primary Key, Foreign Key, Data, Information to prepare for B.Sc-IT, M.Sc-IT, BCA, MCA, MCa Entrance
Number of Questions: 30
Created by:
Tags: DBMS Data Base RDBMS Relational Data Base Primary Key B.Sc-IT M.Sc-IT MCA BCA MCA Entrance Basic Computer C C++ ASP PHP HTML database management system notes advantages of database management system Data Base Management System Relational Data Base Management System Data Structures

Start the Quiz

Which data structure is needed to convert infix notations to postfix notations?

Linear list
Queue
Tree
Stack

A linear list in which elements can be added or removed at either end but not in the middle is known as

queue
deque
stack
tree

Recursive procedures are implemented by

queues
stacks
strings
none of these

The infix expression A+(B-C)*D is correctly represented in prefix notation as

A+B-C*D
+A*-BCD
A-B+C*D
-A+*BCD

A list of data items, usually words or bytes, with the accessing restriction that elements can be added or removed at one end of the list only, is known as

stack
memory
linked list
heap

In what order are the elements of a pushdown stack accessed?

First In First Out (FIFO)
Last In Last Out (LILO)
Last In First Out (LIFO)
None of the above

Which of the following is a tabular listing of contents of certain registers and memory locations at different times during the execution of a program?

Loop program
Program trace
Sub-routine program
Byte sorting program

The initial configuration of queue is a,b,c,d ('a' is at the front). To get the configuration d, c, b, a, one needs a minimum of

2 decletions and 3 additions
3 deletions and 2 additions
3 deletions and 3 additions
3 deletions and 4 additions

If memory for the run-time stack is only 150 cells (words), how big can N be in factorial (N) before encountering stack overflow?

24
66
15
None of these

The following sequence of operations is performed on a stack push (1), push (2), pop, push(1), push(2), pop, pop, pop, push(2), pop. The sequence of the popped out values is

2, 2, 1, 1, 2
2, 2, 1, 2, 2
2, 1, 2, 2, 1
2, 1, 2, 2, 2

A stack is a concept

LIFO
FIFO
LILO
None of these

Queues serve a major role in

simulation of recursion
simulation of arbitrarily linked list
simulation of limited resource allocations
expression evaluation

A priority queue Q is used to implement a stack S that stores characters. PUSH (C) is implemented as INSERT (Q, C, K), where K is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN (Q). For a sequence of operations, the keys chosen are in

non-increasing order
non-decreasing order
strictly increasing order
strictly decreasing order

A queue is a concept

LIFO
FIFO
LILO
None of these

The Postfix equivalent of the prefix * + a b - c d, is

ab+cd-*
abcd+-*
ab+cd*
ab+-cd*

The postfix expression for the infix expression A+B*(C+D)/F+D*E, is

AB+CD+F/D+E
ABCD+F/+DE+
A*B+CD/F*DE++
A+*BCD/F*DE++

Stacks can't be used to

evaluate an arithmetic expression in postfix form
implement recursion
convert a given arithmetic expression in infix form to its equivalent postfix form
allocate resources (like CPU) by the operating system

The infix priorities of +, *, ^, / could be

5, 1, 2, 7
7, 5, 2, 1
1, 2, 5, 7
5, 2, 2, 4

Stack is useful for implementing

radix sort
breadth first search
recursion
none of these

Selection sort's average time complexity is

O (n²)
O (nlogn)
O (logn)
O (n)

The process of accessing data stored in a tape is similar to manipulating data on a

stack
queue
list
heap

Bubble sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Insertion sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Merge sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Quick sort's average time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Selection sort's worst-case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Bubble sort's worst-case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Merge sort's worst-case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Insertion sort's worst-case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

Quick sort's worst-case time complexity is

O(n²)
O(nlogn)
O(logn)
O(n)

- Hide questions

Data Base Management System

Find more quizzes from top tags