Test: Arrays, Stack, Queues & Linked List- 2

# Test: Arrays, Stack, Queues & Linked List- 2

Test Description

## 15 Questions MCQ Test | Test: Arrays, Stack, Queues & Linked List- 2

Test: Arrays, Stack, Queues & Linked List- 2 for Computer Science Engineering (CSE) 2023 is part of Computer Science Engineering (CSE) preparation. The Test: Arrays, Stack, Queues & Linked List- 2 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Arrays, Stack, Queues & Linked List- 2 MCQs are made for Computer Science Engineering (CSE) 2023 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Arrays, Stack, Queues & Linked List- 2 below.
Solutions of Test: Arrays, Stack, Queues & Linked List- 2 questions in English are available as part of our course for Computer Science Engineering (CSE) & Test: Arrays, Stack, Queues & Linked List- 2 solutions in Hindi for Computer Science Engineering (CSE) course. Download more important topics, notes, lectures and mock test series for Computer Science Engineering (CSE) Exam by signing up for free. Attempt Test: Arrays, Stack, Queues & Linked List- 2 | 15 questions in 45 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
 1 Crore+ students have signed up on EduRev. Have you?
Test: Arrays, Stack, Queues & Linked List- 2 - Question 1

### The information about an array that is used in a program wiil be stored in

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 1

A dope vector is a data structure used to hold information about a data objects eg. an array, especially layout of array’s memory. It contain information such as rank of an array, type of elements of array etc.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 2

### Which of the following expressions accesses the (i, j)th entry of a (m x n) matrix stored in column major form?

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 2

(i, j) entries in column major order of size (m x n).
Assume starting address is 1 so, m x (j - 1) + i

Test: Arrays, Stack, Queues & Linked List- 2 - Question 3

### Sparse matrices have

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 3

Sparse matrices are those matrices in which most of the elements are zero.
In contrast, if most of the elements are non-zero then the matrix is considered DENSE.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 4

The postfix equivalent of the prefix * + ab - cd is

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 4

The tree whose preorder traversal yields * + AB - CD, is given in figure. Write the postorder traversal of the tree. That is the postfix form.

Postorder traversal = AB + CD-*

Test: Arrays, Stack, Queues & Linked List- 2 - Question 5

Stacks cannot be used to

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 5

Stacks are used to evaluate postfix expressions, to store data in case of recursion and to convert infix forms to postfix forms.
However, resource allocation can’t be done using stack. Scheduling algorithms are used for allocation of CPU time

Test: Arrays, Stack, Queues & Linked List- 2 - Question 6

The postfix expression for the infix expression: A + B* (C + D) / F + D * E is:

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 6

Infix: A + B *(C + D)/ F + D *E
Postfix: ABCD + *F/ + DE* +

Test: Arrays, Stack, Queues & Linked List- 2 - Question 7

In a circularly linked list organization, insertion of a record involves the modification of

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 7

For insertion/deletion of a record in circularly linked list involves 2 pointer.
But for reverse the linked list, it involves 3 pointer.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 8

Stack is useful for implementing

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 8

Stack is used for implementing recursion and depth first search.
For breadth first search, queue is used.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 9

Which of the following is useful in implementing quick sort?

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 9

Immediately after visiting a node, append it to the queue. After visiting all its children, the node currently in the head of the queue is deleted. This process is recursively carried out on the current head of the queue, till the queue becomes empty.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 10

The process of accessing data stored in tape is similar to manipulating data on a

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 10

The process of accessing data stored on tape is similar to manipulating data on a set.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 11

Linked lists are not suitable for implementing

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 11

In case of using link list, one cannot randomly access the data or only serial data access is there. But, in case of binary search one needs to jump randomly either to first half or other half, which is not possible with linked list.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 12

The following sequence of operations is performed on a stack,
PUSH(10), PUSH (20), POP, PUSH (10), PUSH (20), POP, POP, POP, PUSH(20), POP
The sequence of values popped out is

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 12

Test: Arrays, Stack, Queues & Linked List- 2 - Question 13

Which of the following operations is performed more efficiently by double linked list than by linear linked list?

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 13

In linear linked list we can search only in one way but using double linked list we can search an unsorted list for a given item in both direction.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 14

The smallest element of an array’s index is called its

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 14

Smallest element of an array’s index is called its LOWER BOUND and largest array index is called its UPPER bound.

Test: Arrays, Stack, Queues & Linked List- 2 - Question 15

The post fix form A + (B* C) is

Detailed Solution for Test: Arrays, Stack, Queues & Linked List- 2 - Question 15

 Use Code STAYHOME200 and get INR 200 additional OFF Use Coupon Code