Curriculum Vitae
Name
: Rituraj Saxena
Telephone
: 91-7830660513
Email
: rsrituraj793@gmail.com
Address
: 6/8A Shastri Nagar Khandari Agra PinCode-282002
CAREER OBJECTIVE:
To give my job career a solid start by joining eminent and highly professional comp
Model Question Paper 1
Time: 3 Hours
Max marks: 100
Data Structures and Algorithms
-PART A (5 X 2= 10 Marks)
Answer all questions
1.
The frequency count of the statement A in the following program
fragment is -.
for i = 1 to n do
for j = 3 to n do
y = y+i
7.4.3
DELETION FROM B-TREE
Let the key to be deleted is present in a node x. The various cases of deleting keys from B-Tree are:
1. If x is a leaf node, and if after removing the key, none of the property is violated, then just
remove the key.
2. If x is
7.4
B-TREE OR M-WAY TREE OR MULTI-WAY TREE
B-trees are balanced search trees designed to work well on magnetic disks or other direct access
secondary storage devices. Databases can be implemented with the help of B-tree. Since a database
is of very large
7.3.2
DELETION FROM AVL TREE
When deleting a node in a binary search tree, we either delete a leaf node or a node with only one
child.
In an AVL tree, if a node has only one child then that child is a leaf. Hence, in an AVL tree we
either delete a leaf n
7.3
AVL (ADELSON-VELSKII AND LANDIS) TREE
The binary search tree has a bad height of O(n), so searching operation complexity is O(n) as shown
below:
Left skewed BST
Right skewed BST
Because in BST, the searching operation takes time equal to the height of
7.2.6
DELETION FROM BINARY SEARCH TREE
In the below pseudocode, z points to the node which is to be deleted. The deletion process is divided
into three cases:
1. If the node z to be deleted has no child, then parent of z points to NULL instead of z.
2. If
7.2.4
PREDECESSOR & SUCCESSOR IN BST
In a binary search tree, if all the keys are distinct then the predecessor of a node x is the node with
the largest key smaller than key[x]. Similarly, the successor of a node x is the node with the smallest
key greate
7.2.2
SEARCHING IN BINARY SEARCH TREE
The binary tree search procedure finds a node with a given key. It returns a pointer to the node
having the given key value, if it exists, otherwise returns NULL.
TREE-SEARCH(x, k)
(Recursive version)
1. if x = NULL o
7.2
BINARY SEARCH TREE
Search tree are data structures that support several dynamic-set operations. The dynamic-set
operations are SEARCH, MINIMUM, MAXIMUM, PREDECESSOOR, SUCCESSOR, INSERT
and DELETE. These operations on a binary search take time proporti
7.0
TREE
A tree is a non-primitive, non-linear data structure which consists of elements called nodes and
these nodes are arranged in some sequence. Tree is used to show the hierarchical relationship
between the nodes such that
(a) There is a special elem
IBPS SO IT Officer Syllabus
1.
Database Management System (DBMS): Questions will be
asked from RDBMS, E- R Diagrams, Normalization, Overview of
SQL queries, Transaction Management.
2.
Data Communication & Networking, IP Addressing
(Subnetting), Network, A