Data Structures and Algorithms Online Test

Back

Data Structures and Algorithms

Description: DS
Number of Questions: 15
Created by: Manjit Singh
Tags: DS Data Structures and Algorithms

Start the Quiz

Which of the following operations in one-dimensional array is the accessing of each element of the array exactly once to do some operation?

Searching
Traversing
Sorting
Insertion
Deletion

Which of the following operations on queue removes the front item from the queue and does not accept any arguments nor returns the item?

Queue()
enqueue(item)
dequeue()
isEmpty()
size()

Which of the following conditions indicates that the queue is full of items or overflow?

FRONT=0, REAR=0
REAR = REAR + 1
FRONT = FRONT - 1
REAR = MAX-1
FRONT = -1

Which of the following operations in ordered lists is used to test whether a given object instance is in the container or not?

Insert
Withdraw
Find
isMember
Exit

Which of the following components of Abstract Data give(s) the description on how to manipulate information in the storage structures to obtain the results defined for the operations?

Operations
Storage structures
Algorithms
Tuples
Attributes

Which of the following applications of stack is an expression in which an operator follows the two operands?

Infix expression
Postfix expression
Prefix expression
Arithmetic expression
Relational expression

Which of the following types of data structure is the one in which each node points to the next node and also to the previous node?

Singly linked list
Circular list
Doubly linked list
Tree
Array

Which of the following forms of binary tree is the one in which every non-leaf node has non-empty left and right subtrees?

Complete binary tree
Strictly binary tree
Directed tree
Binary tree
Siblings

Which of the following elements of a tree is a node which has both a parent and at least one child node?

Root
Leaf
Non-leaf
Parent
Internal nodes

Which of the following forms of sorting is applied when the entire collection of data to be sorted is small enough that the sorting can take place within main memory?

Internal sorting
External sorting
Bubble sort
Selection sort
Insertion sort

In binary search algorithm, consider the case if(ele < a[Mid]). Which of the following conditions is applicable?

High=Mid-1
Low=Mid+1
High=Mid+1
High=Low-1
Low=High

Consider an array of MxN order. Which of the following formulae gives the location of the element in Row-major ordering of elements?

Loc(a[i][j]) = Base(a) + w[ (i-1) +N(j-1)]
Loc(a[i][j]) = Base(a) + w[N(i-1) +(j-1)]
Loc(a[i][j]) = Base(a) + w[M(i-1) +(j-1)]
Loc(a[i][j]) = Base(a) + w[ M(i-1) +N(j-1)]
Loc(a[i][j]) = Base(a) + w[ (i-1) +(j-1)]

Which of the following is searching a hash table extremely fast just to find the hash value for the item that you're looking for, then goes to that index and start searching the array until you find what you are looking for or you hit a blank spot?

Linear search
Binary search
Hash search
Interpolation search
Recursive binary search

Which of the following is a data structure in which insertion and deletion takes place at both the ends?

Simple queue
Circular queue
Priority queue
Dequeue
Stack

Which of the following terms in a tree data structure specifies the length of the longest downward path to a leaf from a particular node?

Degree
Height
Depth
Leaf node
Graph

- Hide questions

Data Structures and Algorithms

Find more quizzes from top tags