All Questions

510 questions and answers

1225 views

State the steps involved in query processing. Why is the query optimization needed?

Query processing refers to the range of activities involved in extracting data from a database. The activities include translation of queries in high-level database languages into expressions that can be used at the physical level of the file system,

Super Admin
added 3 years ago
1182 views

Explain how to reduce a relationship set of an E-R diagram into relational schema.

There are several processes and algorithms available to convert ER Diagrams into Relational Schema. Some of them are automated and some of them are manual. We may focus here on the mapping diagram contents to relational basics.

Super Admin
added 3 years ago
965 views

Write short notes: B tree

A B-tree is a tree structure where every node corresponds to a disk page and which satisfies the following properties:

Super Admin
added 3 years ago
1130 views

What is a minimum spanning tree ? Describe Huffman’s Algorithm.   

A spanning tree of a graph is just a subgraph that contains all the vertices and is a tree. Huffman’s algorithm is a method for building an extended binary tree with a minimum weighted path length from a set of given weights.

Demo Teacher
added 2 years ago
1070 views

What are the differences between AVL Tree & Binary Search Tree ?

A binary search tree (BST) is a binary tree data structure which has the following properties: ->each node has a value;

Demo Teacher
added 2 years ago
1071 views

Find the time complexity of Binary Search Algorithm. 

In binary search each step of the algorithm divides the list of items being searched in half of the list. So we can say that

Demo Teacher
added 2 years ago