Search Header Logo

CINTEL Stack and Queue MCQ batch 1 03-03-2025

Authored by Saravanan R

Computers

University

Used 80+ times

CINTEL Stack and Queue MCQ batch 1 03-03-2025
AI

AI Actions

Add similar questions

Adjust reading levels

Convert to real-world scenario

Translate activity

More...

    Content View

    Student View

13 questions

Show all answers

1.

OPEN ENDED QUESTION

30 sec • Ungraded

Register No

Evaluate responses using AI:

OFF

2.

OPEN ENDED QUESTION

30 sec • Ungraded

Student Name

Evaluate responses using AI:

OFF

3.

MULTIPLE CHOICE QUESTION

30 sec • Ungraded

Specialization

Software Engineering
Artificial Intelligence and Machine Learning
Artificial Intelligence
M.Tech Integrated

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A single array A[1..MAXSIZE] is used to implement two stacks. The two stacks grow from opposite ends of the array. Variables top1 and top2 (topl< top 2) point to the location of the topmost element in each of the stacks. If the space is to be used efficiently, the condition for “stack full” is

(top1 = MAXSIZE/2) and (top2 = MAXSIZE/2+1)
top1 + top2 = MAXSIZE
(top1= MAXSIZE/2) or (top2 = MAXSIZE)
top1= top2 -1

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Assume that the operators +, -, × are left associative and ^ is right associative. The order of precedence (from highest to lowest) is ^, x , +, -. The postfix expression corresponding to the infix expression a + b × c - d ^ e ^ f is

abc × + def ^ ^ -
abc × + de ^ f ^ -
ab + c × d - e ^ f ^
- + a × bc ^ ^ def

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Convert the following infix expression into its equivalent post fix expression (A + B^ D) / (E – F) + G

ABD^ + EF – / G+
ABD + ^EF – / G+
ABD + ^EF / – G+
ABD^ + EF / – G+

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Following is an incorrect pseudocode for the algorithm which is supposed to determine whether a sequence of parentheses is balanced: declare a character stack while ( more input is available) { read a character if ( the character is a '(' ) push it on the stack else if ( the character is a ')' and the stack is not empty ) pop a character off the stack else print "unbalanced" and exit } print "balanced" Which of these unbalanced sequences does the above code think is balanced?

((())
())(()
(()()))
(()))()

Access all questions and much more by creating a free account

Create resources

Host any resource

Get auto-graded reports

Google

Continue with Google

Email

Continue with Email

Classlink

Continue with Classlink

Clever

Continue with Clever

or continue with

Microsoft

Microsoft

Apple

Apple

Others

Others

Already have an account?

Discover more resources for Computers