Dark Mode

Answers by Vimal Patel

4 votes

1

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 \log n)$ $\Theta ( n)^{2}$ $\Theta(1)$

answered in DS Feb 13, 2020

20.2k views

0 votes

2

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 mouse. At every vertex there is a laddoo. What is the average number of laddoos per mouse? $\quad 3$ $\quad 2$ $\quad 1$ $\left(\dfrac{1}{2}\right)$ $\left(\dfrac{1}{3}\right)$

answered in Combinatory Jan 8, 2020

1.2k views

2 votes

3

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 complete the league round of matches? $20$ $10$ $8$ $5$

answered in Quantitative Aptitude Jan 8, 2020

3.6k views

5 votes

4

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 vertices are adjacent iff the symmetric difference of the corresponding sets has ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?

answered in Set Theory & Algebra Dec 2, 2019

5.0k views

0 votes

5

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 its direction after servicing every request if the total number of tracks are $2048$ and the head can start from any track? $9$ $10$ $11$ $12$

answered in Operating System Nov 21, 2019

18.2k views

0 votes

6

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.$

answered in Theory of Computation Apr 9, 2019

841 views

0 votes

7

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 $L(G)$ informally. Justify your answer using part $(a).$

answered in Theory of Computation Apr 8, 2019

1.3k views