New DSC Quiz

New DSC Quiz

University

20 Qs

quiz-placeholder

Similar activities

Data Structures -Trees & Sorting

Data Structures -Trees & Sorting

University

15 Qs

Data Structures Quiz No 2

Data Structures Quiz No 2

University

20 Qs

AS Computing: Data Structures

AS Computing: Data Structures

10th Grade - University

15 Qs

Demo DS-A ASHV Quiz

Demo DS-A ASHV Quiz

University

17 Qs

Stack??

Stack??

University

15 Qs

C++ with DS

C++ with DS

University

25 Qs

Stack & Quiz

Stack & Quiz

University

20 Qs

ICT 1 (H1H2)

ICT 1 (H1H2)

University

25 Qs

New DSC Quiz

New DSC Quiz

Assessment

Quiz

Computers

University

Hard

Created by

kamala patil

Used 4+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What is the outcome of this postfix expression assuming single digit operand 4 3 2 + * 5 6+ * ?

 

220

106

28

26

2.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

If the elements '1', '2', '3' and '4' are added in a stack, so what would be the order for the removal?

1234

2134

4321

none

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

In the linked list implementation of queue, where will the new element be inserted?

 

At the middle position of the linked list

 

At the head position of the linked list

At the tail position of the linked list

anywhere

4.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What would be the output given by display, after performing the following operations in a Double ended queue ?

Insertfront(10) ,Insertrear(30),deletefront(), ,Insertrear(40), deletefront(),deleterear(), Display(); Insertfront(20)

10, 30 ,40

30 ,40

20

none of them

5.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

What should be the initial values of top of first and second stack that are implemented using single array of size max

-1 and max-1

0 and max-1

 

-1 and max

0 and max

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

How many nodes a complete binary tree will have at level L?

2L-1

2L

2L+1

2*L

7.

MULTIPLE SELECT QUESTION

1 min • 1 pt

Which of the following is true with respect to a graph that is strongly connected?

only if every node is connected to every other node directly by an edge

it is applicable to only directed graph

if we can reach every node from every other node in a graph

none of them

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?