0

Computer (Data Structure & Algorithms) 3

Description: To improve Knowledge in the field of Data Structures & Algorithms
Number of Questions: 25
Created by:
Tags: Data Structures Data Structures using C Stacks Queue Tower of Hanoi Trees Hashing Type of Sorts Algorithms Complexity
Attempted 0/25 Correct 0 Score 0

The process of visiting each element of the array exactly once is called

  1. analysis traversal operation

  2. traversal operation

  3. search operation

  4. linear search operation


Correct Option: B

How many types of approaches are there to search operations?

  1. 2

  2. 3

  3. 4

  4. 5


Correct Option: A

Which of the following approaches are used to search operations?

  1. Linear search

  2. Binary search

  3. Both (1) & (2)

  4. None of these


Correct Option: C

Which of the following searches traverses sequentially to locate items?

  1. Binary search

  2. Logical search

  3. Search field

  4. Linear search


Correct Option: D

The operation of adding an element to existing list of elements is called

  1. insert operation

  2. analysis of binary search

  3. sorted operation

  4. none of these


Correct Option: A

The process of arranging the element of the array in some logical order is called

  1. delete operation

  2. sort operation

  3. insert operation

  4. none of these


Correct Option: B

Matrices are often used to organize data for business and

  1. fortran language

  2. scientific applications

  3. binary coding

  4. none of these


Correct Option: B

A list of a finite number m × n of homogeneous data elements is called

  1. linear array

  2. multi dimensional array

  3. single array

  4. two-dimensional array


Correct Option: D

The process of combining the elements of two similar structures into a single structure is

  1. bubble sort

  2. sort operation

  3. merge operation

  4. insert operation


Correct Option: C

An square matrix has the same number of rows and columns is called………

  1. Diagonal matrix

  2. Single matrix

  3. Special matrix

  4. Equal matrix


Correct Option: C

How many types of linked list defined in data structures & algorithms?

  1. 5

  2. 3

  3. 6

  4. 4


Correct Option: D

is used in programming construct?

  1. Linear linked list

  2. Doubly linked list

  3. Circular linked

  4. All the above


Correct Option: D

How many ways a linear linked list can be traversed?

  1. 2

  2. 3

  3. 4

  4. 5


Correct Option: A

Which of the following ways can be traversed on linear linked list?

  1. In-order traversal

  2. Reverse-order traversal

  3. Both (1) & (2)

  4. None of these


Correct Option: C

In _________, we need to know the location of the element and the location of the preceding element.

  1. auxiliary search

  2. unsorted search

  3. sorted search

  4. none of these


Correct Option: A

How many pointer fields are used in reversing a list?

  1. 4

  2. 3

  3. 2

  4. 1


Correct Option: B

Which of the following fields are used in reversing a list?

  1. Previous

  2. Current

  3. Next

  4. All of these


Correct Option: D

Deleting entire list can be accomplished by performing which of the following steps?

  1. Assign the start pointer to a temporary variable

  2. Advance the start pointer to the next node

  3. Deallocate the memory occupied by the node pointed to by p t r.

  4. All of these


Correct Option: D

A linear linked list except that the last element points to the first element is called

  1. circular linked list

  2. doubly linked list

  3. both (1) & (2)

  4. none of these


Correct Option: A

A linked list which always contains a special node is called

  1. circular linked list

  2. header node

  3. doubly linked list

  4. linear linked list


Correct Option: B

Inserting at the end of the list is done by performing which of the following steps?

  1. Assign NULL value to the next pointer field of the new node.

  2. Assign address of the new node to start.

  3. Both (1) & (2)

  4. None of these


Correct Option: C

Deleting an element of the list is done

  1. at the beginning of the list

  2. at the end of the list

  3. after a given element

  4. all of these


Correct Option: D

To produce the addition of polynomials which of the following steps to be performed?

  1. The terms of the polynomials are scanned from left to right.

  2. The terms with powers that occurs only in one polynomials are simply copied into resulting polynomial.

  3. The coefficients of terms with same powers are added and then the new term is copied into the resulting polynomial.

  4. All of these


Correct Option: D

_____ are lists whose elements are ordered according to the time when they are added to them?

  1. Stacks and queues

  2. Stacks and arrays

  3. Queues and arrays

  4. Stacks and linked list


Correct Option: A

 Traverse the list from the beginning and compare each element of the list with the given element, to be searched is called………..

  1. Sorted list

  2. Linear list

  3. Linked list

  4. Unsorted list


Correct Option: D
- Hide questions