MCQ Subject: Computer Science

In the OSI model, which layer is primarily responsible for routing decisions based on logical addresses?

What is the average time complexity of a successful search in an open addressing hash table with linear probing, assuming the load factor is less than 0.5?

In C, what is the term for when two pointers reference the same memory location, as in ‘int *ptr1, *ptr2; int x; ptr1 = ptr2 = &x;’?

Which database normalization form ensures elimination of transitive dependencies, thereby reducing data redundancy?

Which sorting algorithm guarantees O(n log n) time complexity in all cases (best, average, worst) and is suitable for large datasets?

Which of the following best describes the Third Normal Form (3NF) in database normalization?

Which scoping technique is primarily used in compiled languages like C and Java because it facilitates efficient compilation by resolving variable references based on the program’s static structure?

Which C function is used to allocate memory for an array of ‘n’ elements of type ‘int’ on the heap?

Which synchronization technique involves assigning a priority to each process and ensuring the process with the highest priority gains access to the critical section first?

What is the primary condition for Dijkstra’s algorithm to correctly compute the shortest path in a graph?