B.Tech Supplementary Exam Questions

B.Tech Supplementary Exam Questions

12th Grade

50 Qs

quiz-placeholder

Similar activities

Eng. for Information Technology (30000-1214) Finals

Eng. for Information Technology (30000-1214) Finals

12th Grade

50 Qs

UNIT 9 - Memory Palace #RD (Intro)

UNIT 9 - Memory Palace #RD (Intro)

7th Grade - University

53 Qs

UNIT 2: URBANISATION

UNIT 2: URBANISATION

9th - 12th Grade

45 Qs

Greek/Latin Roots Review 1-5

Greek/Latin Roots Review 1-5

6th Grade - University

45 Qs

ELA ACT Prep 1

ELA ACT Prep 1

9th - 12th Grade

50 Qs

Kiểm tra học kì II năm học 2020 - 2021 số 2

Kiểm tra học kì II năm học 2020 - 2021 số 2

10th - 12th Grade

50 Qs

REVIEW 1,2 - 11

REVIEW 1,2 - 11

12th Grade

50 Qs

Final Review Series: Create Dangerously

Final Review Series: Create Dangerously

12th Grade

47 Qs

B.Tech Supplementary Exam Questions

B.Tech Supplementary Exam Questions

Assessment

Quiz

English

12th Grade

Hard

Created by

Chitharanjan K

Used 5+ times

FREE Resource

50 questions

Show all answers

1.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which data structure is used to store the undo history in a web browser?

Stack

Queue

Algorithm

Hash table

2.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

When a pop() operation is called on an empty queue, what is the condition called?

Overflow

Underflow

Memory

Garbage Value

3.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Given a binary tree with the following elements: 50, 25, 75, 10, 30, 60, 90. Which traversal technique will produce the following sequence? 10, 30, 25, 60, 90, 75, 50.

In-order

Pre-order

Post-order

Level order

4.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which of the following statements about a linked list is true?

It consists of nodes linked by pointers

It allows for efficient random access

Elements stored contiguously in memory

It has a fixed size.

5.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Travelling salesman problem is an example of

Dynamic Programming

Greedy Algorithm

Recursive Approach

Divide & Conquer

6.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which sorting algorithm has a time complexity of O(n log n) in the average and worst case?

Bubble sort

Insertion sort

Quick sort

Selection sort

7.

MULTIPLE CHOICE QUESTION

30 sec • 1 pt

Which type of linked list has its last node pointing to the first node?

Singly linked list

Doubly linked list

Circular linked list

Sparse linked list

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?