Computer (Data Structure & Algorithms) 3
Description: To improve Knowledge in the field of Data Structures & Algorithms | |
Number of Questions: 25 | |
Created by: Varsha Mane | |
Tags: Data Structures Data Structures using C Stacks Queue Tower of Hanoi Trees Hashing Type of Sorts Algorithms Complexity |
The process of visiting each element of the array exactly once is called
How many types of approaches are there to search operations?
Which of the following approaches are used to search operations?
Which of the following searches traverses sequentially to locate items?
The operation of adding an element to existing list of elements is called
The process of arranging the element of the array in some logical order is called
Matrices are often used to organize data for business and
A list of a finite number m × n of homogeneous data elements is called
The process of combining the elements of two similar structures into a single structure is
An square matrix has the same number of rows and columns is called………
How many types of linked list defined in data structures & algorithms?
is used in programming construct?
How many ways a linear linked list can be traversed?
Which of the following ways can be traversed on linear linked list?
In _________, we need to know the location of the element and the location of the preceding element.
How many pointer fields are used in reversing a list?
Which of the following fields are used in reversing a list?
Deleting entire list can be accomplished by performing which of the following steps?
A linear linked list except that the last element points to the first element is called
A linked list which always contains a special node is called
Inserting at the end of the list is done by performing which of the following steps?
Deleting an element of the list is done
To produce the addition of polynomials which of the following steps to be performed?
_____ are lists whose elements are ordered according to the time when they are added to them?
Traverse the list from the beginning and compare each element of the list with the given element, to be searched is called………..