Hard level quiz

Hard level quiz

University

15 Qs

quiz-placeholder

Similar activities

Running Text

Running Text

University

20 Qs

CodeCadette

CodeCadette

University

15 Qs

Digital Image Processing Quiz

Digital Image Processing Quiz

University

10 Qs

C PROGRAMMING

C PROGRAMMING

University

15 Qs

Do you really know Huawei P10 and P10+???

Do you really know Huawei P10 and P10+???

KG - University

10 Qs

CodeMavarick

CodeMavarick

University

20 Qs

Tech quiz-july

Tech quiz-july

University

20 Qs

Python Review Module 16 - Searching Sorting Algorithm

Python Review Module 16 - Searching Sorting Algorithm

University

17 Qs

Hard level quiz

Hard level quiz

Assessment

Quiz

Other

University

Hard

Created by

mehul mehul

Used 1+ times

FREE Resource

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
or continue with
Microsoft
Apple
Others
By signing up, you agree to our Terms of Service & Privacy Policy
Already have an account?