Computer Science and Information Technology
2020 · Paper 1
Take it one question at a time. Try an answer, then check your understanding.
Complete GATE CSE 2020 Paper 1 overview, original pages and practice · Timed previous-paper practice
Questions 34–36 of 65. Imported answers require review unless explicitly marked reviewed.
Question 24
Open questionCSNAT1 markNeeds review
Consider the following grammar.
The number of reduction steps taken by a bottom-up parser while accepting the string
is ________.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 25
Open questionCSNAT1 markNeeds review
Assume that you have made a request for a web page through your web browser to a web server. Initially the browser cache is empty. Further, the browser is configured to send HTTP requests in non-persistent mode. The web page contains text and five very small images. The minimum number of TCP connections required to display the web page completely in your browser is ________.
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 26
Open questionCSMCQ2 marksNeeds review
Which of the following languages are undecidable? Note that
indicates encoding of the Turing machine
.
on input
reaches state
in exactly 100 steps
is not recursive
contains at least 21 members
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