WorksheetsDSA_CSE_2nd_year_Sec B_2026
Total questions: 10
Worksheet time: 8mins
Which of the following is NOT a typical characteristic of an algorithm?
Finiteness
Definiteness
Input
Ambiguity
The main advantage of an array is:
Dynamic size
Fast random access
No memory requirement
Easy insertion at any position
What is the time complexity of accessing an element of an array using its index?
O(n)
O(log n)
O(1)
O(n²)
What is a major advantage of a linked list over an array?
Faster random access
Contiguous memory allocation
Dynamic size
Constant-time access by index
Which operation on an array typically takes O(1) time?
Inserting at the beginning
Searching an unsorted element
Accessing an element by index
Deleting an arbitrary element
Which complexity generally represents the fastest growth?
O(log n)
O(n)
O(n log n)
O(n²)
Which of the following is most important when selecting a data structure for a problem?
Color of the programming interface
Required operations and efficiency
Programming language name
Number of comments in the program
Which of the following correctly represents increasing growth rate?
n² < n < log n
n < log n < 1
1 < log n < n < n²
log n < 1 < n² < n
An array begins at address 4000, with each element occupying 8 bytes. What is the address of A[3]?
4016
4024
4032
4008
If T(n) = 3n² + 10n + 50, then its asymptotic complexity is:
Θ(n)
Θ(10n)
Θ(n²)
Θ(3n² + 10n + 50)
