SRI INDU COLLEGE OF ENGINEERING &

TECHNOLOGY
Total points 22/25

II BTECH I SEMESTER MID - I EXAMINATION--DECEMBER 2020

Email address *

vamshimulgoori2001@gmail.com

0 of 0 points

Branch & Batch : *

CSE - 1st Batch

Hall ticket number : *

19D41A05E2

Section : *

Name : *

Vamshi Muluguri

(R18CSE2101) Data Structures 22 of 25 points

Answer all Questions each question carries one mark DUration :
50 min

What is the hash function used in Double Hashing? * 0/1

(h1(k) – i*h2(k))mod m

h1(k) + h2(k)

(h1(k) + i*h2(k))mod m

(h1(k) + h2(k))mod m

Linked list is considered as an example of ___________ type of memory 1/1

allocation *

Dynamic

Static

Compile time

Heap

What is a hash table? * 1/1

A structure that maps values to keys

A structure that maps keys to values

A structure used for storage

A structure used to implement stack and queue

 What does ‘stack overflow’ refer to? * 1/1

accessing item from an undefined stack

adding items to a full stack

removing items from an empty stack

index out of bounds exception

Feedback

adding items to a full stack

hash table has following advantage over a linked list? * 1/1

faster access of data

easy to implement

very efficient for less number of entries

exhibit good locality of reference

If several elements are competing for the same bucket in the hash table, 1/1
what is it called? *

Diffusion

Replication

Collision

Duplication

How many possible cases are used to perform delete elements from 1/1
binary search tree *

Which of the following problems occur due to linear probing? * 1/1

Primary collision

Secondary collision

Separate chaining

Extendible hashing
What is the space complexity for deleting a linked list? * 1/1

O(1)

O(n)

Either O(1) or O(n)

O(logn)

What are the worst case and average case complexities of a binary 1/1
search tree? *

O(n), O(n)

O(logn), O(logn)

O(logn), O(n)

O(n), O(logn)

Which of the following data structure is true for non contiguous data 1/1
structure ? *

Array

Structure

Linked List

None
The data structure required for Breadth First Traversal on a graph is? * 1/1

Stack

Array

Queue

Tree

Which of the following is false about a binary search tree? * 1/1

The left child is always lesser than its parent

The right child is always greater than its parent

The left and right sub-trees should also be binary search trees

In order sequence gives decreasing order of elements

What is the speciality about the inorder traversal of a binary search tree? 0/1
*

It traverses in a non increasing order

It traverses in an increasing order

It traverses in a random fashion

It traverses based on priority of the node

 Which data structure is used for implementing recursion? * 1/1

Queue

Stack

Array

List

Feedback

Stack

Which of the following is false about a doubly linked list? * 1/1

We can navigate in both the directions

It requires more space than a singly linked list

The insertion and deletion of a node take a bit longer

Implementing a doubly linked list is easier than singly linked list

 if the global depth is greater than local depth then the operation must be 0/1
performed in directory array is *

increment local depth by one

decrement local depth by one

expand the directory

reduce the directory

Which of the following statement(s) about stack data structure is/are 1/1
NOT correct? *

Linked List are used for implementing Stacks

Top of the Stack always contain the new node

Stack is the FIFO data structure

Null link is present in the last node at the bottom of the stack

Feedback

Stack is the FIFO data structure

What type of has function used to implement hash table? * 1/1

Division method

Mid square method

Multiplicative method

all of the above

Which of the following operations can be performed on an extendable 1/1

hash structure? *

Lookup

Insertion

Deletion

All of the mentioned

For finding a node in a …………………, at each stage we ideally reduce the 1/1
number of nodes we have to check by half. *

binary tree

binary search tree

AVL tree

splay tree
Which of the following schemes does linear probing come under? * 1/1

rehashing

extended hashing

separate chaining

open addressing

which mathematical-model have collection of operations and data * 1/1

Data Structure

Abstract Data Type

Primitive Data Type

Algorithm
 Which of the following is not the type of queue? * 1/1

Ordinary queue

Single ended queue

Priority queue

Circular queue

Feedback

Single ended queue

Which of the following is not a collision resolution strategy for open 1/1
addressing? *

Linear probing

Quadratic probing

Double hashing

Rehashing

This content is neither created nor endorsed by Google. - Terms of Service - Privacy Policy

 Forms