CODE_DUEL(Quiz Questions)

CODE_DUEL(Quiz Questions)

University

10 Qs

quiz-placeholder

Similar activities

CHAPTER 5 ONLINE QUIZ

CHAPTER 5 ONLINE QUIZ

University

9 Qs

Unit 28 - Quiz #1

Unit 28 - Quiz #1

University

15 Qs

Quiz CodeIgniter 4

Quiz CodeIgniter 4

University

10 Qs

PROBLEM SOLVING USING R  UNIT I  MCQS

PROBLEM SOLVING USING R UNIT I MCQS

University

15 Qs

Prak MC

Prak MC

University

15 Qs

Quiz on Basics of C

Quiz on Basics of C

University

10 Qs

Uji Pengetahuan TIK untuk Siswa Kelas 7

Uji Pengetahuan TIK untuk Siswa Kelas 7

7th Grade - University

15 Qs

استعني علي الشقا بالله

استعني علي الشقا بالله

University

10 Qs

CODE_DUEL(Quiz Questions)

CODE_DUEL(Quiz Questions)

Assessment

Quiz

Computers

University

Practice Problem

Hard

Created by

Samiksha Singh

FREE Resource

AI

Enhance your content in a minute

Add similar questions
Adjust reading levels
Convert to real-world scenario
Translate activity
More...

10 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

Internet Web browsers store the addresses of recently visited sites

on a data structure. Each time a user visits a new site, that site’s address is stored onto the top of the

Data structure . The browser then allows the user to traverse back to previously

visited sites using the “back” button. What data structure is used for the implementation?

Queue

Priority Queue

Stack

Circular Linked List

2.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which part of memory is used for the allocation of local variables declared inside any function.

Stack

Heap

Address Space

Depends on Compiler

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

If queue is implemented using arrays, what would be the worst run time complexity of queue and dequeue operations?

Ο(n), Ο(n)

Ο(n), Ο(1)

Ο(1), Ο(n)

Ο(1), Ο(1)

4.

MULTIPLE CHOICE QUESTION

30 sec • 2 pts

When Bob wants to send Alice a message M on the Internet, he breaks M into n data packets, numbers the packets consecutively, and injects them into the network. When the packets arrive at Alice’s computer, they may be out of order, so Alice must assemble the sequence of n packets in order before she can be sure she has the entire message. What efficient scheme can Alice use to do this ?

Doubly Linked List 

Singly Linked List

Circular linked List 

Circular doubly linked List

5.

MULTIPLE CHOICE QUESTION

20 sec • 1 pt

Which of the following uses memorization?

Greedy Approach

Divide and conquer Approach

Dynamic Programming Approach

None of the above

6.

MULTIPLE CHOICE QUESTION

45 sec • 2 pts

Suppose a certain flight is fully booked an hour prior to departure. Because of the possibility of cancellations, the airline maintains a record of standby passengers hoping to get a seat. The priority of each passenger is determined by the fare paid, the frequent-flyer status, and the time when the passenger is entered into the record. When a passenger requests to fly standby, the associated details of the passenger are recorded . Shortly before the flight departure, if seats become available (for example, due to last-minute cancellations), the airline repeatedly removes a standby passenger with first priority from the record and lets this person board. What data structure is used to maintain the airline record?

Circular Queue

Priority Queue

Hash Tables

A) B-Trees

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

A binary tree can be converted in to its mirror image by traversing it in _________.

In-order

Pre-order

Post-order

Any order

Create a free account and access millions of resources

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?