Data Structure

Q1. What is the application of Binpackingproblem?

knapsack

Dynamic programming

Back tracking

Branch and bound

Q2. It is not a criteria of algorithm.

Best case

Time complexity

Output

Input

Q3. What is the application of quick sort?

All of these

Graphic Card

Tape sorting

Data processing

Q4. What do you mean by merge sort?

Exponential sorting

Internal sorting

Externalsorting

Insertion sorting

Q5. Which is procedure for step-by-step for calculations?

Program

Greedy method

Problem

Algorithm

Q6. What is the application of merge sort?

Graphic Card

Both 1 & 2

Data processing

Networking

Q7. The data structure that allows deleting data elements from front and inserting at rear.

Queues

Deques

Stacks

Binary search tree

Q8. In which of these, the memoization is used for?

Dynamic programming approach

Divide and conquer approach

None of the above

Greedy approach

Q9. Which data structure allows deletions at the both ends of the list but insertions at only one end?

None of the above

Output-restricted deque

Priority queues

Input-restricted deque

Q10. Visiting root node after visiting left and right sub-trees is called Post-order Traveral.

FALSE

TRUE

Your Score

- of - questions are answered correctly

C# Data Structures and Algorithms

For Support

Office Hours

We are on

Company

Customer Service

Help

Your Score

- of - questions are answered correctly

Login to view answer sheet

FORGOT PASSWORD

SIGN UP

Email Verification