Computer Science and Information Technology
2023 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2023 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 19–21 of 65. Imported answers require review unless explicitly marked reviewed.
Question 19
Open questionCSMCQ1 markNeeds review
Consider the following definition of a lexical token id for an identifier in a programming language, using extended regular expressions:
letter
[A–Za–z]
digit
[0–9]
id
letter (letter
digit)
Which one of the following Non-deterministic Finite-state Automata with
-transitions accepts the set of valid identifiers? (A double-circle denotes a final state)Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 20
Open questionCSMCQ1 markNeeds review
An algorithm has to store several keys generated by an adversary in a hash table. The adversary is malicious who tries to maximize the number of collisions. Let
be the number of keys,
be the number of slots in the hash table, and
.Which one of the following is the best hashing strategy to counteract the adversary?
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answerQuestion 21
Open questionCSMCQ1 markNeeds review
The output of a 2-input multiplexer is connected back to one of its inputs as shown in the figure.
Match the functional equivalence of this circuit to one of the following options.
Your answerChoose one option.
Log in to check the answer
You can attempt this question now. Sign in to view the answer key, explanations and discussion.Log in to check answer