Computer Science Test MCQs, Data Structures

Set 3

Question:1

The main measure of the efficiency of the algorithm

A. Process and memory

B. Time and space

C. Date and space

D. Complexity and capacity

Ans:b

Question:2

Big-oh allows the possibility the growth rates are the

A. different     

B. Same      

C. Greater 

D. None of these

Ans:b

Question : 3

Whish Symbol tell us logarithms grows very slowly.

A. logkN=O(N)

B. Log(N)

C. Log2(N)

D. Nlog(N)

Ans:a

Question: 4

The Relative growth rates of two functions f(N) and g(N) by Limn->0f(N)/g(N) then

A. f (N)= o(g(N))

B. f ( N)+o(g(N))

C. G(N)=o(f))

Ans: c

Question: 5

Gcf()

A. greater common divisor

B. greatest common divisor

C. greatest common divior

D. none of above

Ans:b

Question: 6

If MSN then M mod

A. N<M/2

B. N>=M/2

C. N<=M/2

D. N>M/2

Ans:a

Question: 7

An online algorithm that runs in

A. binary search

B. fraction time

C. Buble search

D. linear search

Ans:d

Question: 8

In maximum subsequence, the input size is N=100,000 then O(N3)

A. 3.33

B. 86.67

C. NA

D. 0.03332

Ans:c

Question: 9

N power 2 symbol is

A. quadratic

B. cubic

C. linear

D. constant

Ans:a

Question:10

Log2N symbol is

A. logarithm

B. long-square

C. exponent

D. linear

Ans:a

Question: 11

Euclid algorithm is used for computing the.

A. The complexity of bubble sort

B. Time complexity

C. common divisor

D. the complexity of the binary search 

Ans:c

Question: 12

The complexity of linear search algorithms.

A. C(n)

B. o(logn)

C. o(n2)

D. o (nlogn)

Ans:a

Question: 13

The complexity of the buble sort algorithm

A. O(n)

B. Olog(n)

C. O(n)

D. O(nlogn)

Ans:c

Question: 14

The complexity of merge sort algorithm

A. O(n)

B. O(log(n)

C. O(n2)

D. O(n log (n)

Ans:d

Question: 15

Which of the following case does not exist in complexity theory?

A. best case

B. worst case

C. average case

D. null case

Ans:d

Data Structures MCQs

Basic Concepts

1. Introduction to Data Structures
   • Abstract Data Types (ADT) MCQs
2. Complexity Analysis MCQs
   • Time complexity MCQs
   • Space complexity MCQs
   • Big O, Big Ω, Big Θ notations MCQs

Linear Data Structures MCQs

1. Arrays MCQs
   • One-dimensional arrays MCQs
   • Multi-dimensional arrays MCQs
   • Operations: traversal, insertion, deletion MCQs
2. Linked Lists MCQs
   • Singly linked list MCQs
   • Doubly linked list MCQs
   • Circular linked list MCQs
3. Stacks MCQs
   • Stack operations (push, pop, peek) MCQs
   • Applications of stacks (expression evaluation, recursion) MCQs
4. Queues MCQs
   • Queue operations (enqueue, dequeue, front, rear) MCQs
   • Types: Simple queue, circular queue, priority queue, deque MCQs

Non-Linear Data Structures MCQs

1. Trees MCQs
   • Binary trees MCQs
   • Binary Search Trees (BST) MCQs
   • AVL Trees MCQs
   • B-trees and B+ trees MCQs
   • Tree traversal methods (in-order, pre-order, post-order) MCQs
2. Heaps MCQs
   • Min-heap MCQs
   • Max-heap MCQs
   • Heap operations (insertion, deletion, heapify) MCQs
   • Applications of heaps (priority queues, heap sort) MCQs
3. Graphs MCQs
   • Graph representation (adjacency matrix, adjacency list) MCQs
   • Graph traversal algorithms (DFS, BFS) MCQs
   • Shortest path algorithms (Dijkstra’s, Bellman-Ford) MCQs
   • Minimum Spanning Tree (Kruskal’s, Prim’s) MCQs

Hashing MCQs MCQs

1. Hash Tables
   • Hash functions MCQs
   • Collision resolution techniques (chaining, open addressing) MCQs
   • Applications of hashing MCQs

Sorting and Searching Algorithms MCQs 

1. Sorting Algorithms MCQs
   • Bubble sort MCQs
   • Selection sort MCQs
   • Insertion sort MCQs
   • Merge sort MCQs
   • Quick sort MCQs
   • Heap sort MCQs
2. Searching Algorithms MCQs
   • Linear search MCQs
   • Binary search MCQs
   • Interpolation search MCQs

Miscellaneous

1. Memory Management in data structures MCQs
   • Dynamic memory allocation MCQs
   • Garbage collection MCQs
2. String Manipulation Algorithms MCQs
   • Pattern matching (KMP, Rabin-Karp) MCQs
   • String hashing MCQs

1. Data Structures MCQs 1
2. Data Structures MCQs 2
3. Data Structures MCQs 3
4. Data Structures MCQs 4
5. Data Structures MCQs 5
6. Stacks Solved MCQs
7. Queues MCQs
8. pointer mcqs
9. Array MCQs