(Backup) DSA and Code Snippets

(Backup) DSA and Code Snippets

University

10 Qs

quiz-placeholder

Similar activities

DSA & Code Snippets

DSA & Code Snippets

University

15 Qs

cppp-2

cppp-2

University

9 Qs

DSA Quiz 2 Set 1

DSA Quiz 2 Set 1

University

10 Qs

Basics of Control Systems

Basics of Control Systems

University

15 Qs

7th quiz

7th quiz

7th Grade - University

8 Qs

Introduction of Arduino IDE

Introduction of Arduino IDE

University

15 Qs

Microprocessor

Microprocessor

University

15 Qs

Pandas Slicing Quiz1

Pandas Slicing Quiz1

University

10 Qs

(Backup) DSA and Code Snippets

(Backup) DSA and Code Snippets

Assessment

Quiz

Education

University

Hard

Created by

Shanmuga Priya M

Used 1+ times

FREE Resource

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

Media Image

Which operation does the above code perform?

Enqueue

Dequeue

Return the front element

Both b and c

Answer explanation

Two operations are performed in the above code. The first one is returning the value of the front with the help of the statement n=q[front], and the second operation is dequeue (deleting an element) by using the statement front++.

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

The minimum number of stacks needed to implement a queue is

3

1

2

4

Answer explanation

Media Image

Two stacks S1 & S2 are required to implement a queue.This method makes sure that newly entered element is always at the top of stack 1, so that DeQueue operation just pops from stack1. To put the element at top of stack1, stack2 is used.

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which one of the following is the process of inserting an element in the stack?

Insert

Add

Push

None of the above

Answer explanation

In stack, the process of inserting an element is known as a push operation.

The process of deleting an element is known as a pop operation

4.

MULTIPLE CHOICE QUESTION

2 mins • 1 pt

The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?

2

3

4

6

Answer explanation

Media Image

So, height of the tree is 3, option (B) is correct.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure is required to convert the infix to prefix notation?

Stack

Linked List

Binary Tree

Queue

Answer explanation

Stack is a data structure used to reverse the order of the operators in the expression. It is also used as a storage structure that stores all the operators and print all the operators when all the operands have appeared

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Find the output of the given code.

4 7.97

4 7.96623

Compilation Error

None of the above

Answer explanation

Media Image

In the above program the float variable ft is intialised to 7.96623

It rounded of to 7.97 because of %.2f in printf statement.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Media Image

Find the output.

(Note: Consider it in 16 bit machine)

12 10

14 10

6 2

error

Answer explanation

Media Image

In here the variable empid occupies 10 bytes because its an integer array with limit of 5 (5*2)

And the pointer variable occupies 2 bytes.

Therefore size of employee be

(5*2)+2+2=14 Bytes

Create a free account and access millions of resources

Create resources
Host any resource
Get auto-graded reports
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?