Computer (Data structure & Algorithms) 3
Q-1 The process of visiting each element of the array exactly once is called ………..
(a) Analysis traversal operation (b) Traversal operation
(c) Search operation (d) Linear search operation
Q-2 How many types of approaches to search operations?
(a) 2 (b) 3
(c) 4 (d) 5
Q-3 Which amongst the following are approaches used to search operations?
(a) Linear search (b) Binary search
(c) Both a & b (d) None of these
Q-4 Which of the following search traverses a sequentially to locate items?
(a) Binary search (b) Logical search
(c) Search field (d) Linear search
Q-5 The operation of adding an element to existing list of elements is called……………..
(a) Insert operation (b) Analysis of binary search
(c) Sorted operation (d) None of these
Q-6 The process of arranging the element of the array in some logical order is called……………..
(a) Delete operation (b) Sort operation
(c) Insert operation (d) None of these
Q-7 The process of combining the elements of two similar structures into a single structure is…………
(a) Bubble sort (b) Sort operation
(c) Merge operation (d) Insert operation
Q-8 A list of a finite number m ´ n of homogeneous data elements is called…………
(a) Linear array (b) Multi dimensional array
(c) Single array (d) Two-dimensional array
Q-9 Matrices are often used to organize data for business and………
(a) Fortran language (b) Scientific applications
(c) Binary coding (d) None of these
Q-10 An square matrix has the same number of rows and columns is called………
(a) Diagonal matrix (b) Single matrix
(c) Special matrices (d) Equal matrices
Q-11 How many types of linked list defined in data structures & algorithms?
(a) 5 (b) 3 (c) 6 (d) 4
Q-12 Which of the following types are used in programming construct?
(a) Linear linked list (b) Doubly linked list
(c) Circular linked (d) All the above
Q-13 How many ways a linear linked list can be traversed?
(a) 2 (b) 3 (c) 4 (d) 5
Q-14 Which amongst the following ways can be traversed on linear linked list?
(a) In-order traversal (b) Reverse-order traversal
(c) Both a & b (d) None of these
Q-15 Traverse the list from the beginning and compare each element of the list with the given element, to be searched is called………..
(a) Sorted list (b) Linear list
(c) Linked list (d) unsorted list
Q-16 In ……………..we need the location of the element & the location of the preceding element.
(a) Auxiliary search (b) Unsorted search
(c) Sorted search (d) None of these
Q-17 How many pointer fields are used in reversing a list?
(a) 4 (b) 3
(c) 2 (d) 1
Q-18 Which of the following fields are used in reversing a list?
(a) Previous (b) Current
(c) Next (d) All of these
Q-19 Deleting entire list can be accomplished by performing which of the following steps?
(a) Assign the start pointer to a temporary variable
(b) Advance the start pointer to the next node
(c) Deallocate the memory occupied by the node pointed to by p t r.
(d) All of these
Q-20 A linear linked list, except that the last element points to the first element is called………
(a) Circular linked list (b) Doubly linked list
(c) Both a & b (d) None of these
Q-21 A linked list which always contains a special node is called………
(a) Circular linked list (b) Header node
(c) Doubly linked list (d) Linear linked list
Q-22 To produce the addition of polynomials which of the following steps to be performed?
(a) The terms of the polynomials are scanned from left to right
(b) The terms with powers that occurs only in one polynomials are simply copied into
resulting polynomial.
(c) The coefficients of terms with same powers are added and then the new term is copied
into the resulting polynomial.
(d) All of these
Q-23 Inserting at the end of the list is done by performing which of the following steps?
(a) Assign NULL value to the next pointer field of the new node.
(b) Assign address of the new node to start.
(c) Both a & b
(d) None of these
Q-24 Deleting an element of the list is done by performing which of the following positions?
(a) At the beginning of the list
(b) At the end of the list
(c) After a given element
(d) All of these
Q-25 ………..Are lists whose element are ordered according to the time when they are added to them?
(a) Stacks and queues (b) Stacks and arrays
(c) Queues and arrays (d) Stacks and linked list
Answers:-
1(b) Traversal operation2(a) 2
3(c) Both a & b
4(d) Linear search
5(a) Insert operation
6(b) Sort operation
7 (c) Merge operations
8(d) Two-dimensional array
9(b) scientific applications
10(c) Special matrices
11(d) 4
12(d) All the above
13(a) 2
14(c) Both a & b
15(d) unsorted list
16(a) Auxiliary search
17(b) 3
18(d) All of these
19(d) All of these
20(a) Circular linked list
21(b) Header node
22(d) All of these
23(c) Both a & b
24(d) All of these
25(a) Stacks and queues
No comments:
Post a Comment