Hard level quiz

Hard level quiz

University

15 Qs

quiz-placeholder

Similar activities

Ant science

Ant science

5th Grade - University

11 Qs

GDCD 6 - BÀI TẬP TRẮC NGHIỆM - BÀI 1,2

GDCD 6 - BÀI TẬP TRẮC NGHIỆM - BÀI 1,2

6th Grade - University

20 Qs

Drug For Anti-Hypertension

Drug For Anti-Hypertension

University

11 Qs

DCIT Week 1 Quiz

DCIT Week 1 Quiz

University

10 Qs

NMMS MAT 7காலம் சார்ந்த கணக்குகள்

NMMS MAT 7காலம் சார்ந்த கணக்குகள்

University

20 Qs

Facility Layout Type

Facility Layout Type

University

13 Qs

PLANE TABLE SURVEYING

PLANE TABLE SURVEYING

University

15 Qs

Power Electronics Activity

Power Electronics Activity

University

17 Qs

Hard level quiz

Hard level quiz

Assessment

Quiz

Other

University

Practice Problem

Hard

Created by

mehul mehul

Used 1+ times

FREE Resource

AI

Enhance your content in a minute

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

15 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

you are given a single linked list 1->2->3->4->5->null.

you have to delete the node with value 3 from linked list and you are having a pointer pointing to node with value 3.

you are not given head of linked list or any other information.

what will be the bes time complexity for doing so?

O(n)

O(1)

not possible

none of these

2.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

What is the recurrence relation for merge sort?

T(n)=2T(n/2)

T(n)=2T(n/2)+k

T(n)=2T(n/2)+O(n)

T(n)=2T(n/2)+O(logn)

3.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

A program P reads in 500 integers in the range [0..100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies?

array of 50 numbers

a array of 100 numbers

a array of 500 number

a array of 600 numbers

4.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

What does the following function print for n = 25?

void fun(int n)

{

if (n == 0)

return;

printf("%d", n%2);

fun(n/2);

}

11001

10011

11111

00000

5.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

Worst case time complexity to access an element in a BST can be?

O(n)

O(n*logn)

O(1)

O(logn)

6.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

Which of the following represents the Postorder Traversal of a Binary Tree?

left->right->root

left->root->right

right->left->root

root->left->right

7.

MULTIPLE CHOICE QUESTION

1 min • 5 pts

The five items: A, B, C, D, and E are pushed in a stack, one after other starting from A. The stack is popped four items and each element is inserted in a queue. The two elements are deleted from the queue and pushed back on the stack. Now one item is popped from the stack. The popped item is?

A

B

C

D

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?