Computer Science Engineering (CSE) Exam  >  Computer Science Engineering (CSE) Tests  >  GATE Computer Science Engineering(CSE) 2024 Mock Test Series  >  Test: Arrays, Stack, Queues & Linked List- 1 - Computer Science Engineering (CSE) MCQ Download as PDF

Test: Arrays, Stack, Queues & Linked List- 1 - Computer Science Engineering (CSE) MCQ


Test Description

10 Questions MCQ Test GATE Computer Science Engineering(CSE) 2024 Mock Test Series - Test: Arrays, Stack, Queues & Linked List- 1

Test: Arrays, Stack, Queues & Linked List- 1 for Computer Science Engineering (CSE) 2024 is part of GATE Computer Science Engineering(CSE) 2024 Mock Test Series preparation. The Test: Arrays, Stack, Queues & Linked List- 1 questions and answers have been prepared according to the Computer Science Engineering (CSE) exam syllabus.The Test: Arrays, Stack, Queues & Linked List- 1 MCQs are made for Computer Science Engineering (CSE) 2024 Exam. Find important definitions, questions, notes, meanings, examples, exercises, MCQs and online tests for Test: Arrays, Stack, Queues & Linked List- 1 below.
Solutions of Test: Arrays, Stack, Queues & Linked List- 1 questions in English are available as part of our GATE Computer Science Engineering(CSE) 2024 Mock Test Series for Computer Science Engineering (CSE) & Test: Arrays, Stack, Queues & Linked List- 1 solutions in Hindi for GATE Computer Science Engineering(CSE) 2024 Mock Test Series 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- 1 | 10 questions in 30 minutes | Mock test for Computer Science Engineering (CSE) preparation | Free important questions MCQ to study GATE Computer Science Engineering(CSE) 2024 Mock Test Series for Computer Science Engineering (CSE) Exam | Download free PDF with solutions
1 Crore+ students have signed up on EduRev. Have you? Download the App
*Multiple options can be correct
Test: Arrays, Stack, Queues & Linked List- 1 - Question 1

What all is true about Stack data structure? (More than one option is correct)

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

Last in First OUT: The last item that is inserted into a given stack is the first item to be deleted.
A stack can be implemented using minimum two queues.
Stack is a dynamic data structure. It does not have a fixed size in the memory, and hence, size of a stack increases using push() and pop() operations.

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

In the previous problem, if the stack A has 4 entries, then the number of possible permutations will be

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

Total number of possible permutations for the previous problem is 5. For the four entries a, b, c, d the possibilities are a, followed by permutations of a, b, c which is 5. b, followed by permutations of a, c, d which is 5. The other possibilities are c, b, a, d; c, d, b, a; c, b, d, a; d, c, b, a. Therefore, total 14 permutations are possible.

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

An item that is read as input can be either pushed to a stack and later popped and printed, or printed directly. Which of the following will be the output if the input is the sequence of items -1, 2, 3, 4, 5?

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

The item can be pushed to stack and later popped and printed, or printed directly. 1, 2, 3, 4, 5 is the input then (a) is not possible because once pushed 1 is printed after 2. Similarly (c) and (d) are also not possible.

We can obtain the sequence by performing the operations in the manner given below.

The sequence obtained will be 3,4,5,2,1.

Hence, (b) is the output.

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

The concatenation of two lists is to be performed in O(1) time. Which of the following implementations of a list could be used?

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

In circular doubly linked list, one does not need to traverse the whole list to find the end of the list.
The second list can be concatenated at any location. Only fixed number of pointers need to be changed. Hence can be done in O(1) time.

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

Which of the following is essential for converting an infix expression to the postfix form efficiently?

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

Operator stack is used to convert infix expression to postfix form whereas operand stack is used to convert postfix to infix notation.

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

What can we say about the array representation of a circular queue when it contains only one element? 

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

If a queue contains an element Front = Rear, it can neither be NULL nor be -1.
So, option (a) and (c) are wrong.
Since, it is a circular queue and bottleneck case arises in case of two elements where Front = Rear + 1 and Front = Rear - 1, both are possible.
So, what all we can say is Front = Rear ≠ NULL if only one element is there in circular queue.

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

In a compact single dimensional array representation for lower triangular matrices (i.e. all the elements above the diagonal are zero) of size n x n, non-zero elements (i.e. elements of the lower triangle) of each row are stored one after another, starting from the first row, the index of the (i, j)th element of the lower triangular matrix in this new representation is 

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

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

Let A be a two-dimensional array declared as follows:
A : array [1 ... 10] [1... 15] of integer;
Assuming that each integer takes one memory location. The array is stored in row-major order and the first element of the array is stored at location 100, what is the address of the element A [i] [j] ?

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

The array is stored in row-major order, that means the elements are stored in the memory row-wise. 
Suppose we have the 2D array
1 2 3
4 5 6
It will be stored in the memory as 1 2 3 4 5 6
If array is stored as column-major order then it will be stored as 1 4 2 5 3 6

Let A be a 2D array, A: array [b1 …. u1] [b2 …… u2], then 
To find the location of A[i][j] for a 2D array stored in Row-major order use the following formula:
 

Loc A[i][j] = L + [ (i - b1) (u2 - b2 +1) + (j  - b2) ] x M

 

L - base address of the array, i.e. address of the first element of the array

M - Memory Size, here each integer takes only 1 memory location therefore M = 1

 

Loc A[i][j] = 100 + [ (i - 1) (15 - 1 +1) + (j  - 1) ] x 1

                = 100 + (i - 1) 15 + j -1 = 15i + j + 84

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

An n x n array v is defined as follows: v[i, j] = i - j for all i, j, 1 < i < n, 1 < j < n.The sum of the elements of the array v is:

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

Array is

Sum = 0 + 1 + 2 + ... + (-1) + (-2) + ... = 0.

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

Suppose you are given an array s[1...n] and a procedure reverse (s, i, j) which reverses the order of elements in between positions i and j (both inclusive). What does the following sequence do, where 1 < k < n:
reverse (s, 1, k):
reverse (s, k + 1, n):
reverse (s, 1, n);

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

Effect of the given 3 reversals for any k is equivalent to left rotation of the array of size n by k.

∴ n = 7, k = 2
reverse (S, 1, 2) we get [2, 1, 3, 4, 5, 6, 7]
reverse (S, 3, 7) we get [2, 1, 7, 6, 5, 4, 3]
reverse (S, 1, 7) we get [3, 4, 5, 6, 7, 1,2]

150 docs|216 tests
Information about Test: Arrays, Stack, Queues & Linked List- 1 Page
In this test you can find the Exam questions for Test: Arrays, Stack, Queues & Linked List- 1 solved & explained in the simplest way possible. Besides giving Questions and answers for Test: Arrays, Stack, Queues & Linked List- 1, EduRev gives you an ample number of Online tests for practice
Download as PDF
Download the FREE EduRev App
Track your progress, build streaks, highlight & save important lessons and more!