search
Log In

Featured posts

1
Ans is c Large memory overhead would there.To reduce it use multi level paging will be used.
posted May 10 in From GO Admins gatecse
edited May 10 by gatecse
1,641 views
2
False : Consider $E: \{1,2,3,4\}$, $F:\{3,4,5,6\}$ $f(E) = \{5,6,7,8\}$ $f(F)=\{7,8,11,6\}$ $f(E \cap F) = \{7,8\}$ where as, $f(E) \cap f(F) = \{6,7,8\}$ Becomes TRUE only when $f$ ... $ f(E \cap F) \subseteq f(E) \cap f(F)$ $\subseteq$ becomes $=$ only when $f$ is one-one - when the mappings are unique for each element.
posted May 10 in From GO Admins gatecse
edited May 10 by gatecse
1,013 views
3
He got M=Σ* as an example to show that it L$\bigcap$M can be CFL but not regular . L$\bigcap$M will always be CFL but may or may not be regular.
posted Apr 19 in From GO Admins Arjun
edited May 8 by gatecse
7,576 views
4
All 3 test() are inside "PAR BEGIN, PAR END" so they execute concurrently..
posted Mar 21 in Preparation Experience Nikhil_dhama
edited Apr 1 by Nikhil_dhama
6,239 views
6

Hello Everyone....!!

Here is the most awaited post of GATE Overflow TEST SERIES for GATE CSE - 2021.

You can check the complete details of the Test Series in the below link....!! If you have any doubts can drop a comment to this post..!!

Schedule

EDIT: The test series will be as per the updated syllabus for GATE 2021 and will be having Multiple Select Questions from mid August...

posted May 26, 2020 in From GO Admins soujanyareddy13
edited Oct 26, 2020 by gatecse
26,896 views
7
Yes. You are correct. But not just the "max element" cause problem. All the elements in the last level can cause this problem. So, only binary search tree is the answer here.
posted May 4, 2020 in From GO Admins Arjun
edited Jan 23 by soujanyareddy13
16,371 views
8

If I had missed out any blog, please post it in the comments.

Sl.No:

Institute

Programme

Specialization

Year

Link

1

IIIT Bengaluru

MS

 

2018

posted Feb 23, 2020 in Interview Experience Balaji Jegan
edited May 19, 2020 by Balaji Jegan
12,149 views
9
As it is already written that x is a intermediate node so it cann't be the last node. Hence, complexity should be O(1) by the algo that gate_asp have given below. Tell me if i am wrong?
posted Feb 14, 2020 in From GO Admins Arjun
edited Feb 14, 2020 by Arjun
5,750 views
10
C and D only out of AB,AF,AE,C,D
posted Jan 1, 2020 in Study Materials Arjun 5,157 views
11
Answer: D
posted May 31, 2019 in From GO Admins Arjun
edited Nov 9, 2019 by Arjun
65,566 views
12
In batch processing processes halt in between executions and and there is no preemptive scheduling.So option d.
posted Mar 17, 2019 in From GO Admins Arjun 2,301 views
13
Here bound of the loop are constants, therefore compiler will do the loop unrolling(If compiler won't then prefetcher will do) to increase the instruction level parallelism. And after loop unrolling $23$ cycles are required for execution. Therefore, correct answer would be (B). PS: We ...
posted Feb 23, 2019 in From GO Admins Arjun
edited Mar 17, 2019 by anonymous
15,774 views
14
yes. Exactly. But a main correction. Then L "MAY BE" regular. Otherwise L is not regular. Because, if pumping lemma is not obeyed, language is not regular. But if the language satisfies pumping lemma, that doesn't mean language is regular.
posted Jan 12, 2019 in Study Materials Arjun
edited Jan 28, 2019 by Arjun
7,206 views
15
A grammer having left recursion generates a cycle. And no left recursive grammer is LL(1) grammer.
posted Oct 15, 2018 in Useful Links Subarna Das
edited Jan 18 by anonymous
22,166 views
16
We wish to schedule three processes $P1$, $P2$ and $P3$ ... -preemptive scheduling respectively? $30$ sec, $30$ sec $30$ sec, $10$ sec $42$ sec, $42$ sec $30$ sec, $42$ sec
posted Mar 18, 2018 in From GO Admins dd 3,893 views
17
Let $G$ be a weighted undirected graph and e be an edge with maximum weight in $G$. Suppose there is a minimum weight spanning tree in $G$ containing the edge $e$. Which of the following statements is always TRUE? There exists a cutset in $G$ having all edges of maximum ... in $G$ having all edges of maximum weight. Edge $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.
posted Mar 18, 2018 in 2018 Rishabh Gupta 2 38,246 views
18
$P\left(x\right) = \left(\neg \left(x=1\right)\wedge \forall y \left(\exists z\left(x=y*z\right)\right) \Rightarrow \left(y=x\right) \vee \left(y=1\right) \right)$
posted Feb 2, 2018 in Preparation Advice Arjun 3,789 views
19
The formula used to compute an approximation for the second derivative of a function $f$ at a point $X_0$ is $\dfrac{f(x_0 +h) + f(x_0 – h)}{2}$ $\dfrac{f(x_0 +h) - f(x_0 – h)}{2h}$ $\dfrac{f(x_0 +h) + 2f(x_0) + f(x_0 – h)}{h^2}$ $\dfrac{f(x_0 +h) - 2f(x_0) + f(x_0 – h)}{h^2}$
posted Jan 24, 2018 in Preparation Advice Arjun 4,214 views
20
Implement a circuit having the following output expression using an inverter and a nand gate $Z=\overline{A} + \overline{B} +C$
posted Jan 15, 2018 in Preparation Advice Rajesh Raj
recategorized Jan 15, 2018 by Rajesh Raj
3,406 views
...