Output Quiz-7

Output Quiz-7

University

20 Qs

quiz-placeholder

Similar activities

JS-KT2 (Sub)

JS-KT2 (Sub)

University

20 Qs

Basic of Programming - Quiz 02

Basic of Programming - Quiz 02

University - Professional Development

15 Qs

EXCEPTION HANDLING IN PYTHON

EXCEPTION HANDLING IN PYTHON

University

22 Qs

JAVA Basics Quiz

JAVA Basics Quiz

University

20 Qs

CodeHS - Intro to Python - Conditionals Quiz

CodeHS - Intro to Python - Conditionals Quiz

9th Grade - Professional Development

15 Qs

Python Programming Quiz

Python Programming Quiz

9th Grade - University

20 Qs

ASK F2 -KOD ARAHAN (PYTHON)

ASK F2 -KOD ARAHAN (PYTHON)

1st Grade - University

15 Qs

Lists in Python 2

Lists in Python 2

10th Grade - University

20 Qs

Output Quiz-7

Output Quiz-7

Assessment

Quiz

Computers

University

Hard

Created by

Rahul Mahato

Used 1+ times

FREE Resource

20 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Consider the following statements:

i. First-in-first out types of computations are efficiently supported by STACKS.

ii. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations.

iii. Implementing QUEUES on a circular array is more efficient than implementing QUEUES on a linear array with two indices.

iv. Last-in-first-out type of computations are efficiently supported by QUEUES.

(ii) is true

(i) and (ii) are true


(iii) is true


(ii) and (iv) are true

2.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

An advantage of chained hash table (external hashing) over the open addressing scheme is

Worst case complexity of search operations is less


Space used is less

Deletion is easier

None of the above

3.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Which of the following option is not correct?

If the queue is implemented with a linked list, keeping track of a front pointer, Only rear pointer s will change during an insertion into an non-empty queue.

Queue data structure can be used to implement least recently used (LRU) page fault algorithm and Quick short algorithm.

Queue data structure can be used to implement Quick short algorithm but not least recently used (LRU) page fault algorithm.

Both (A) and (C)

4.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

What will be the output of the following code?

[2, 3, 4, 5]

[2, 3, 4]

[2, 3, 4, 5, None]

Error

5.

MULTIPLE CHOICE QUESTION

45 sec • 1 pt

Media Image

What will be the output of the following code?

[1, 2, 3, 2, 3, 4]

[3, 5, 7]

[6]

Error

6.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

What will be the output of the following code?

The program will print the output 10 10.


The program will print the output 10 11.

It will result in a compile time error.


The program will print the output 11 11.

7.

MULTIPLE CHOICE QUESTION

1 min • 1 pt

Media Image

What will be the output of the following code?


The program will print the output 100 10.


The program will print the output 100 100.


The program will print the output 100 garbage.

The program will print two garbage values.

It will result in a compile time error.

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?