Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Vimal Patel
27.1k
views
4
votes
GATE CSE 2020 | Question: 16
What is the worst case time complexity of inserting $n$ elements into an empty linked list, if the linked list needs to be maintained in sorted order?$\Theta(n)$$\Theta(n...
27.1k
views
answered
Feb 13, 2020
DS
gatecse-2020
linked-list
1-mark
+
–
1.7k
views
0
votes
TIFR CSE 2013 | Part A | Question: 1
An infinite two-dimensional pattern is indicated below.The smallest closed figure made by the lines is called a unit triangle. Within every unit triangle, there is a mous...
1.7k
views
answered
Jan 8, 2020
Combinatory
tifr2013
combinatory
counting
+
–
4.1k
views
2
votes
GATE2015 ME-3: GA-5
Five teams have to compete in a league, with every team playing every other team exactly once, before going to the next round. How many matches will have to be held to co...
4.1k
views
answered
Jan 8, 2020
Quantitative Aptitude
gate2015-me-3
quantitative-aptitude
combinatory
+
–
6.6k
views
7
votes
GATE CSE 2000 | Question: 6
Let $S$ be a set of $n$ elements $\left\{1, 2,\ldots, n\right\}$ and $G$ a graph with $2^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertice...
6.6k
views
answered
Dec 2, 2019
Set Theory & Algebra
gatecse-2000
set-theory&algebra
normal
descriptive
set-theory
+
–
23.9k
views
0
votes
GATE IT 2007 | Question: 83
The head of a hard disk serves requests following the shortest seek time first (SSTF) policy. What is the maximum cardinality of the request set, so that the head changes...
23.9k
views
answered
Nov 21, 2019
Operating System
gateit-2007
operating-system
disk-scheduling
normal
+
–
1.4k
views
0
votes
Ullman (TOC) Edition 3 Exercise 5.1 Question 8 (Page No. 183)
Consider the CFG $G$ defi ned by productions$:$$S\rightarrow aSbS|bSaS|\in$Prove that $L(G)$ is the set of all strings with an equal number of $a's$ and $b's.$
1.4k
views
answered
Apr 9, 2019
Theory of Computation
ullman
theory-of-computation
context-free-grammar
context-free-language
+
–
1.9k
views
0
votes
Ullman (TOC) Edition 3 Exercise 5.1 Question 7 (Page No. 183)
Consider the CFG $G$ defi ned by productions$:$$S\rightarrow aS|Sb|a|b$Prove by induction on the string length that no string in $L(G)$ has $ba$ as a substring.Describe $...
1.9k
views
answered
Apr 8, 2019
Theory of Computation
ullman
theory-of-computation
context-free-grammar
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register