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: Sara Dalvi | |
| 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 Letter A Synonyms Letter B Letter C General Awareness and Computer Applications Computer Applications (New) Database Management System |
What is the time required to search an element in a linked list of length 'n'?
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?
In what kind of storage structure for strings, can one easily insert, delete, concatenate and rearrange sub-strings?
Consider a linked list of 'n' elements. What is the time taken to insert an element after pointed by some pointers?
Which of the following statements is false?
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?
Pre-order is nothing but
Which traversal technique lists the notes of a binary search tree in ascending order?
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?
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?
The concatenation of two lists is to be performed in O (1) time. Which of the following implementations of a list should be used?
Which of the following algorithms solves all pairs shortest path problem?
Which of the following algorithms solves the quick sort problem?
Which of the following algorithms solves the minimum weight spanning tree problem?
Selection sort's worst case space complexity is
Bubble sort's worst case space complexity is
A full binary tree with 'n' non-leaf nodes contains
Which of the following algorithms solves the connected components problem?
Insertion sort's worst case space complexity is
Quick sort's worst case space complexity is
Insertion sort's average case space complexity is
Bubble sort's average case space complexity is
Merge sort's worst case space complexity is
Selection sort's average case space complexity is
A graph G with 'n' nodes is bipartite if it contains
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
A full binary tree with 'n' leaves contains
Merge sort's average case space complexity is
In which tree, for every node the heights of its left sub-tree and right sub-tree differ at least by one?
Quick sort's average case space complexity is