MCQ Subject: GATE CS

In C, incrementing an int* pointer increases its memory address by:

Consider the following statements about algorithms in a textbook: 1. All algorithms are either greedy or dynamic programming. 2. Some dynamic programming algorithms are used for optimization problems. Which conclusion can be logically drawn?

Which scheduling algorithm, known for prioritizing tasks based on their periods, does NOT guarantee weak fairness where every task periodically gets a turn?

Which parsing approach begins by applying productions starting from the start symbol of the grammar to derive the input string?

What is the asymptotic time complexity of performing a binary search on a sorted array of n elements?

Which Boolean expression is equivalent to ~(A + B) according to De Morgan’s Law?

Consider the following statements: 1. Every engineer possesses knowledge. 2. A subset of knowledgeable individuals exhibits innovation. Which conclusion is most appropriately drawn?

What transformation is essential for a left-recursive grammar to be parsed efficiently by a top-down parser?