Home › Quizzes › Data Base Management System

Data Base Management System

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

30 Questions Published
Play Quiz Practise this topic out loud

Questions

Question 1 Multiple Choice (Single Answer)

What is the time required to search an element in a linked list of length 'n'?

  1. O(log2 n)
  2. O(n)
  3. O(1)
  4. O(n2)
Question 2 Multiple Choice (Single Answer)

Consider a linked list of 'n' elements which is pointed by an external pointer. What is the time taken to delete the element, which is successor of the element pointed to by a given pointer?

  1. O(1)
  2. O(log2 n)
  3. O(n)
  4. O(n log2 n)
Question 3 Multiple Choice (Single Answer)

In what kind of storage structure for strings, can one easily insert, delete, concatenate and rearrange sub-strings?

  1. Fixed length storage structure
  2. Variable length storage with fixed maximum
  3. Linked list storage
  4. Array type storage
Question 4 Multiple Choice (Single Answer)

Consider a linked list of 'n' elements. What is the time taken to insert an element after pointed by some pointers?

  1. O(1)
  2. O(log2 n)
  3. O(n)
  4. O(n log2 n)
Question 5 Multiple Choice (Single Answer)

Which of the following statements is false?

  1. Every tree is a bipartite graph.
  2. A tree contains a cycle.
  3. A tree with 'n' nodes contains 'n-1' edges.
  4. A tree is a connected graph.
Question 6 Multiple Choice (Single Answer)

An undirected graph G with 'n' vertices and 'e' edges is represented by adjacency list. What is the time required to generate all the connected components?

  1. O(n)
  2. O(e)
  3. O(e + n)
  4. O(e2)
Question 7 Multiple Choice (Single Answer)

Pre-order is nothing but

  1. depth first order
  2. breadth first order
  3. topological order
  4. linear order
Question 8 Multiple Choice (Single Answer)

Which traversal technique lists the notes of a binary search tree in ascending order?

  1. Post order
  2. In order
  3. Pre order
  4. None of these
Question 9 Multiple Choice (Single Answer)

Consider an undirected graph G with 'n' vertices and 'e' edges. What is the time taken by Depth First Search (DFS), if the graph is represented by: (i) adjacency matrix, and (ii) adjacency list?

  1. O(n2), O(n)
  2. O(n2), O(e)
  3. O(e), O(n2)
  4. O(e + n), O(e)
Question 10 Multiple Choice (Single Answer)

Consider a sorted binary insertion tree. What must be done to produce a sorted array of numbers (for printing) from the sorted binary insertion tree?

  1. Pre oder traversal
  2. Post order traversal
  3. In order traversal
  4. Top-down traversal
Question 11 Multiple Choice (Single Answer)

The concatenation of two lists is to be performed in O (1) time. Which of the following implementations of a list should be used?

  1. Singly linked list
  2. Doubly linked list
  3. Circular doubly linked list
  4. Array implementation
Question 12 Multiple Choice (Single Answer)

Which of the following algorithms solves all pairs shortest path problem?

  1. Greedy
  2. Depth-First Search
  3. Dyanamic Programming
  4. Divide & Conquer
Question 13 Multiple Choice (Single Answer)

Which of the following algorithms solves the quick sort problem?

  1. Greedy
  2. Depth-First Search
  3. Dyanamic Programming
  4. Divide & Conquer
Question 14 Multiple Choice (Single Answer)

Which of the following algorithms solves the minimum weight spanning tree problem?

  1. Greedy
  2. Depth-first Search
  3. Dynamic Programming
  4. Divide & Conquer
Question 15 Multiple Choice (Single Answer)

Selection sort's worst case space complexity is

  1. O
  2. O(n)
  3. O (logn)
  4. None of these
Question 16 Multiple Choice (Single Answer)

Bubble sort's worst case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 17 Multiple Choice (Single Answer)

A full binary tree with 'n' non-leaf nodes contains

  1. log2 n nodes
  2. n + 1 nodes
  3. 2 n nodes
  4. 2n + 1 nodes
Question 18 Multiple Choice (Single Answer)

Which of the following algorithms solves the connected components problem?

  1. Greedy
  2. Depth-First Search
  3. Dynamic Programming
  4. Divide & Conquer
Question 19 Multiple Choice (Single Answer)

Insertion sort's worst case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 20 Multiple Choice (Single Answer)

Quick sort's worst case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 21 Multiple Choice (Single Answer)

Insertion sort's average case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 22 Multiple Choice (Single Answer)

Bubble sort's average case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 23 Multiple Choice (Single Answer)

Merge sort's worst case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 24 Multiple Choice (Single Answer)

Selection sort's average case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 25 Multiple Choice (Single Answer)

A graph G with 'n' nodes is bipartite if it contains

  1. n edges
  2. a cycle of odd length
  3. no cycle of odd length
  4. n2 edges
Question 26 Multiple Choice (Single Answer)

A complete binary tree with the property that the value at each node is at least as large as the values at its children, is known as

  1. Binary search tree
  2. AVL tree
  3. Completely balanced tree
  4. Heap
Question 27 Multiple Choice (Single Answer)

A full binary tree with 'n' leaves contains

  1. n nodes
  2. log2 n nodes
  3. 2n-1 nodes
  4. 2n nodes
Question 28 Multiple Choice (Single Answer)

Merge sort's average case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
Question 29 Multiple Choice (Single Answer)

In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?

  1. Binary search tree
  2. AVL tree
  3. Complete tree
  4. Threaded binary tree
Question 30 Multiple Choice (Single Answer)

Quick sort's average case space complexity is

  1. 0
  2. O(n)
  3. O(logn)
  4. None of these
← Back to Quizzes