MCQ Subject: Computer Science

In a max-heap data structure, which of the following statements is TRUE?

Which normal form eliminates partial dependencies by ensuring each non-prime attribute depends on the entire primary key?

In Compiler Design, how are symbol tables typically managed to handle variable scoping in nested blocks of code?

What is the worst-case time complexity of searching for an element in a hash table with poor hash function quality, leading to frequent collisions?

Which database normalization form ensures that if a table has a composite key, then no attribute depends on only one part of the key?

What is the term for accessing a pointer in C after the memory it points to has been freed?

What is the time complexity of an algorithm that iterates through a linked list of n nodes exactly once to find a specific node?

Which parsing technique involves starting with the overall program structure and recursively breaking it down into smaller, more detailed structures until reaching the basic elements of the programming language?

What synchronization method uses counters to manage access to shared resources by multiple processes?

In database normalization, which normal form ensures that each non-prime attribute depends on the entire primary key?