DSA 11.07.24

DSA 11.07.24

University

10 Qs

quiz-placeholder

Similar activities

IOTA : Web Development Bootcamp Quiz 2

IOTA : Web Development Bootcamp Quiz 2

University

14 Qs

PSP Week 5

PSP Week 5

University

10 Qs

pointers and structures

pointers and structures

University

10 Qs

Belajar Microsoft Exel

Belajar Microsoft Exel

University

10 Qs

Round 2 for Preplacement Bootcamp

Round 2 for Preplacement Bootcamp

University

15 Qs

BFS and DFS - Data Structures

BFS and DFS - Data Structures

University

15 Qs

Teste python- Unesp-Jaboticabal

Teste python- Unesp-Jaboticabal

University

10 Qs

07 - Map

07 - Map

University

15 Qs

DSA 11.07.24

DSA 11.07.24

Assessment

Quiz

Computers

University

Practice Problem

Medium

Created by

PUSHPALATHA C2114

Used 2+ times

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 • 1 pt

1.Consider the following stack implemented using stack.

  1. #define SIZE 11  

  2. struct STACK  

  3. {  

  4.    int arr[SIZE];  

  5.    int top=-1;   

  6. }  

  7. What would be the maximum value of the top that does not cause the overflow of the stack?

  1. 8

  1. 9

  1. 11

  1. 10

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

2.What would be the output after performing the following operations in a Deque?

  1. Insertfront(10);  

  2. Insertfront(20);  

  3. Insertrear(30);  

  4. Insertrear(40);  

  5. Deletefront();  

  6. Insertfront(50);  

  7. Deleterear();  

  8. Display();  

  1. 10, 20, 30

  1. 50, 10, 30

  1. 40, 20, 30

  1. None of the above

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

3.Minimum number of queues required for priority queue implementation?

5

4

3

2

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

4.Heap sort is an implementation of ____________ using a descending priority queue.

a) insertion sort

b) selection sort

c) bubble sort

d) merge sort

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

5.What does the following piece of code do?

for (int i = 0; i < arr.length-1; i++) { for (int j = i+1; j < arr.length; j++) { if( (arr[i].equals(arr[j])) && (i != j) ) { System.out.println(arr[i]); } } }

a) Print the duplicate elements in the array

b) Print the element with maximum frequency

c) Print the unique elements in the array

d) Prints the element with minimum frequnecy

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

6.In doubly linked lists

A - a pointer is maintained to store both next and previous nodes.

B - two pointers are maintained to store next and previous nodes.

C - a pointer to self is maintained for each node.

D - none of the above.

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

7.From a complete graph, by removing maximum _______________ edges, we can construct a spanning tree.

A - e-n+1

B - n-e+1

C - n+e-1

D - e-n-1

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