NEW
Font size
WorksheetsAlgorithm Analysis (JT Class 6 Dec 2025)
Total questions: 10
Worksheet time: 6mins
Consider the singly linked list that consists of 100 nodes and determine the time complexity to identify the occurrence of the second prime number in the list.
O(n^2)
O(n)
O(n sqrt(n) )
O(n log n)
The following keys 40,20,60,10,30,25 are inserted into an empty AVL tree. Determine the complexity of searching for node 30 after insertion.
O(n)
O(1)
O(log n)
O(n log n)
If the numbers from 1 to 100 are inserted into a Binary Search Tree randomly, determine the average complexity of searching for any node in the last level of the tree.
O(log n)
O(n)
O(1)
O(n log n)
Insert the key elements 1, 3, 5, 6, 7, 8, 9, 10 into a min-heap and determine the complexity to build the heap.
O(1)
O(n)
O(log n)
O(n log n)
Sort the numbers 11, 2, 4, 6, 16, 13, 17, 18, 19, 22 in ascending order using Insertion Sort and determine the complexity only for Pass 8.
O(1)
O(n)
O(log n)
O(n log n)
Determine the least complexity to sort the numbers 11, 2, 3, 5, 6, 9, 8, 7 in ascending order
O(1)
O(log n)
O(n)
O(n log n)
Consider the data 12,13,17,18,19,20,22,24,26,25 stored inside separate chaining using the hash function h(k) = k%TS, where TS = 10. Determine the average case complexity of searching for an element 24.
O(1+λ)
O(λ)
O(n+λ)
O(1)
Determine the time complexity on calling a function B(n)
int B(double n)
{
if (n <= 1)
return 0;
else return 1 + B(log(n) );
}
O(log n)
O(log log n)
O(n log n)
O(sqrt(n) log n)
Determine the time complexity of the code
for(i = 1; i <= n; i++)
for(j = 1; j <= i*i; j++)
if(j % i == 0)
printf("*");
O(n^2)
O(n)
O(n sqrt(n) )
O(n log n)
If the STACK ADT is implemented using a singly linked list, determine the time complexity to check the peek element
O(1)
O(n)
O(n^2)
O(log n)
