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 16–18 of 65. Imported answers require review unless explicitly marked reviewed.
Question 6
Open questionCSMCQ1 markNeeds review
What is the worst case time complexity of inserting
elements into an AVL-tree with
elements initially?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 7
Open questionCSMCQ1 markNeeds review
Which one of the following regular expressions represents the set of all binary strings with an odd number of 1’s?
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 8
Open questionCSMCQ1 markNeeds review
Consider the following statements.
I. If
is regular, then both
and
must be regular.II. The class of regular languages is closed under infinite union.
Which of the above statements is/are TRUE?
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