You are on page 1of 8

6/1/22, 10:53 AM CDC

Result & Analysis


Student: NEERAJ KUMAR . Test: PREP_DSA_PT_Stacks Course: 2023 Data Structure…

Attempt 2 Attempt 1

IP Address: 2409:4052:d86:247:bc02:5ad6:8257:f7bb Tab switches: 132 OS used: Windows


Browser used: Chrome

Test Duration: 00:43:09 Test Start Time: Nov 1, 2021 | 09:50 PM


Test Submit Time: Nov 1, 2021 | 10:34 PM

Overall score MCQ

Rank: NA Rank: NA

8 Topper score: 121.00 / 121 8 Topper score: 11.00


/ 11

/ 121 Average score: 31.29 / 121 / 11 Average score: 7.65


/ 11
Least score: 0.00 / 121 Least score: 0.00
/ 11

Coding

Rank: NA

0 Topper score: 110.00


/ 110

/ 110 Average score: 32.56


/ 110
Least score: 0.00
/ 110

Overall Question Status MCQ - Question Status

Total Questions: 22 Total Questions: 11

Questions Attempted: 22 Questions Attempted: 11

22 Questions Correct: 8 11 Questions Correct: 8

/ 22 Question Wrong: 14 / 11 Question Wrong: 3


Partially Correct: 0 Partially Correct: 0

Question Not Viewed: 0 Question Not Viewed: 0

Coding - Question Status

Total Questions: 11

Questions Attempted: 11

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 1/8
6/1/22, 10:53 AM CDC

11 Questions Correct: 0
Question Wrong: 11
/ 11 Partially Correct: 0

Question Not Viewed: 0

Topic wise Analysis MCQ Coding 

Question No: 1 Multi Choice Type Question Report Error

Which one of the following is an application of Stack Data Structure?

Managing function calls

The stock span problem

Arithmetic expression evaluation

All of the above CORRECT

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 2 Multi Choice Type Question Report Error

Which of the following real world scenarios would you associate with a stack data
structure

piling up of chairs one above


CORRECT
the other

people standing in a line to be serviced


at a counter

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 2/8
6/1/22, 10:53 AM CDC

offer services based on the priority of


the customer
All of these

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 3 Multi Choice Type Question Report Error

Which of the following is true about linked list implementation of stack?

In push operation, if new nodes are


inserted at the beginning of linked list,
then in pop operation, nodes must be
removed from end.

In push operation, if new nodes are


inserted at the end, then in pop
operation, nodes must be removed from
the beginning.

Both of these

None of these CORRECT

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Easy


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 4 Multi Choice Type Question Report Error

Which of the following is the top pointer variable of the stack in it's linked representation?

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 3/8
6/1/22, 10:53 AM CDC

Start pointer CORRECT

Begin pointer

First pointer

Top pointer

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Medium


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 5 Multi Choice Type Question Report Error

Which of the following array element will return the top-of-the-stack-element for a stack of
size N elements(capacity of stack > N).

S[N-1] CORRECT

S[N]

S[N-2].

S[N+1]

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Wrong Mark obtained: 0/1 Hints used: 0 Level: Medium


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 6 Multi Choice Type Question Report Error


https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 4/8
6/1/22, 10:53 AM CDC

The prefix form of an infix expression p + q - r * t is

+ pq - *rt

- +pqr * t

- +pq * rt CORRECT

- + * pqrt

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Medium


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 7 Multi Choice Type Question Report Error

The postfix form of the expression (A+ B)*(C*D- E)*F / G is

AB+ CD*E - FG /** CORRECT

AB + CD* E - F **G /

AB + CD* E - *F *G /

AB + CDE * - * F *G /

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Medium


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 5/8
6/1/22, 10:53 AM CDC

Question No: 8 Multi Choice Type Question Report Error

The best data structure to check whether an arithmetic expression has balanced
parenthesis is a

Stack CORRECT

Queue

Linked list

Tree

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 9 Multi Choice Type Question Report Error

Stack data structure cannot be used for

Implementation of recursive function

Allocation and scheduling of


CORRECT
resources

Reversing a string

Evaluating a postfix expression

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 6/8
6/1/22, 10:53 AM CDC

Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 10 Multi Choice Type Question Report Error

In which data structure element is inserted at one end called Rear and deleted at other end
called Front.

Stack

Queue CORRECT

Binary Tree

Linked List

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Easy


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

Question No: 11 Multi Choice Type Question Report Error

Consider the following operation performed on a stack of size 5.


Push(1);
Pop();
Push(2);
Push(3);
Pop();
Push(4);
Pop();
Pop();
Push(5);

After the completion of all operation, the no of element present on stack are

0
https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 7/8
6/1/22, 10:53 AM CDC

1 CORRECT

Recommended Learning Content: Introduction to Stacks Stacks Implementation


Stacks

Status: Correct Mark obtained: 1/1 Hints used: 0 Level: Medium


Question type: MCQ Single Correct Subject: Programming Subject: Data Structures
Subject: Stacks

https://placement.vit.ac.in/result?testId=U2FsdGVkX182ie2%2Fhu9kakGA3MhbVK27vRL8iOtFnYrE7LNUXEzLTdA4wdK6tCde 8/8

You might also like