Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
nabadeep
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by nabadeep
4
answers
1
GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1 ($over alphabet $0)$ accepted by the following automaton. The order of $L_1$ is ________.
Given a language $L$, define $L^i$ as follows:$$L^0 = \{ \varepsilon \}$$$$L^i = L^{i-1} \bullet L \text{ for all } I >0$$The order of a language $L$ is defined as the s...
20.5k
views
commented
Feb 14, 2018
Theory of Computation
gatecse-2018
theory-of-computation
numerical-answers
regular-language
2-marks
+
–
1
answer
2
GATE IT 2005 | Question: 84a
A sink in a directed graph is a vertex i such that there is an edge from every vertex $j \neq i$ to $i$ and there is no edge from $i$ to any other vertex. A directed graph $G$ with $n$ vertices is represented by its adjacency matrix $A$, where $A[i] [j] = 1$ if there is an edge ... $E_1:\ !A[i][j]$ and $E_2 : i = j$; $E_1 : A[i][j]$ and $E_2 : i = j + 1$;
A sink in a directed graph is a vertex i such that there is an edge from every vertex $j \neq i$ to $i$ and there is no edge from $i$ to any other vertex. A directed grap...
9.2k
views
commented
Aug 9, 2017
Algorithms
gateit-2005
algorithms
graph-algorithms
normal
+
–
2
answers
3
GATE CSE 2010 | Question: 17
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessarily true? $L_2 - L_1 \:\text{is recursively enumerable.}$ ... $L_2 \cap L_3 \:\text{is recursively enumerable.}$ $L_2 \cup L_3 \:\text{is recursively enumerable.}$
Let $L_1$ be the recursive language. Let $L_2$ and $L_3$ be languages that are recursively enumerable but not recursive. Which of the following statements is not necessar...
16.0k
views
commented
Jul 31, 2017
Theory of Computation
gatecse-2010
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
normal
+
–
0
answers
4
decidability
i truly did not understand decidabilty topic, from where should i study it so that my concepts are clear?
i truly did not understand decidabilty topic, from where should i study it so that my concepts are clear?
230
views
commented
Jun 28, 2017
6
answers
5
GATE CSE 2013 | Question: 24
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of unordered cycles of length three? $\dfrac {1}{8}$ $1$ $7$ $8$
Consider an undirected random graph of eight vertices. The probability that there is an edge between a pair of vertices is $\dfrac{1}{2}.$ What is the expected number of ...
19.7k
views
commented
Jun 28, 2017
Probability
gatecse-2013
probability
expectation
normal
+
–
3
answers
6
GATE CSE 2004 | Question: 56
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\text{TCP}$ layer prefixes $20$ byte header to the message. This passes ... $200$ $220$ $240$ $260$
Consider three IP networks $A, B$ and $C$. Host $H_A$ in network $A$ sends messages each containing $180$ bytes of application data to a host $H_C$ in network $C$. The $\...
22.8k
views
commented
Jun 24, 2017
Computer Networks
gatecse-2004
computer-networks
ip-addressing
tcp
normal
+
–
1
answer
7
computer networks
how to study cn for gate as i feel some parts seem very complicated?
how to study cn for gate as i feel some parts seem very complicated?
321
views
commented
Jun 23, 2017
4
answers
8
GATE CSE 2017 Set 1 | Question: 39
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if there exists a Turing machine $M$ which given an ... $L_{f}$ is recursive, but not conversely. If $f$ is computable then $L_{f}$ is recursively enumerable, but not conversely.
Let $A$ and $B$ be finite alphabets and let $\#$ be a symbol outside both $A$ and $B$. Let $f$ be a total function from $A^{*}$ to $B^{*}$. We say $f$ is computable if th...
18.3k
views
commented
Jun 23, 2017
Theory of Computation
gatecse-2017-set1
theory-of-computation
decidability
difficult
+
–
7
answers
9
GATE CSE 2017 Set 1 | Question: 27
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing ... $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All...
32.9k
views
commented
Jun 8, 2017
Operating System
gatecse-2017-set1
operating-system
process-synchronization
normal
+
–
8
answers
10
GATE CSE 2014 Set 2 | Question: 38
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequences at a time. The number of comparisons that will be needed in the worst case by the optimal algorithm for doing this is ____.
Suppose $P, Q, R, S, T$ are sorted sequences having lengths $20, 24, 30, 35, 50$ respectively. They are to be merged into a single sequence by merging together two sequen...
24.6k
views
commented
Jun 3, 2017
Algorithms
gatecse-2014-set2
algorithms
sorting
normal
numerical-answers
+
–
10
answers
11
GATE CSE 2017 Set 1 | Question: 48
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i \right ]$ is $1$ by probing the minimum number of locations in $A$. The worst case number of probes performed by an optimal algorithm is ____________.
Let $A$ be an array of $31$ numbers consisting of a sequence of $0$'s followed by a sequence of $1$'s. The problem is to find the smallest index $i$ such that $A\left [i ...
21.5k
views
commented
Jun 3, 2017
Algorithms
gatecse-2017-set1
algorithms
normal
numerical-answers
searching
+
–
5
answers
12
GATE CSE 2017 Set 1 | Question: 19
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ and $b$. The median of $Y$ is ______________ .
Let $X$ be a Gaussian random variable with mean 0 and variance $\sigma ^{2}$. Let $Y$ = $\max\left ( X,0 \right )$ where $\max\left ( a,b \right )$ is the maximum of $a$ ...
20.4k
views
commented
Jun 2, 2017
Probability
gatecse-2017-set1
probability
numerical-answers
normal-distribution
+
–
7
answers
13
GATE CSE 2015 Set 2 | Question: 45
Suppose you are provided with the following function declaration in the C programming language. int partition(int a[], int n); The function treats the first element of $a[\:]$ as a pivot and rearranges the array so that all elements less than or equal to the pivot is in the ... $(a, $ left_end$, k)$ $(a, n-$left_end$-1, k-$left_end$-1)$ and $(a, $left_end$, k)$
Suppose you are provided with the following function declaration in the C programming language.int partition(int a[], int n);The function treats the first element of $a[\...
16.4k
views
commented
Jun 2, 2017
Algorithms
gatecse-2015-set2
algorithms
normal
sorting
+
–
0
answers
14
doubts
how to solve algorithm problems(the first section of problems in go book) on my own ? seems very tough.plz suggest some solutions.
how to solve algorithm problems(the first section of problems in go book) on my own ? seems very tough.plz suggest some solutions.
217
views
asked
May 29, 2017
1
answer
15
doubt
this year's gate paper set 1 and 2 had questions on topics of random variable and expectations. i did not find any material related related to its study.where to find its study resources ?
this year's gate paper set 1 and 2 had questions on topics of random variable and expectations. i did not find any material related related to its study.where to find its...
182
views
asked
May 28, 2017
16
answers
16
GATE CSE 2014 Set 1 | Question: 39
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
The minimum number of comparisons required to find the minimum and the maximum of $100$ numbers is ________
53.6k
views
commented
May 27, 2017
Algorithms
gatecse-2014-set1
algorithms
numerical-answers
normal
maximum-minimum
+
–
1
answer
17
algorithm
what is meant by an optimal algorithm with reference to questions asked in gate papers?
what is meant by an optimal algorithm with reference to questions asked in gate papers?
238
views
asked
May 27, 2017
Algorithms
time-complexity
+
–
1
answer
18
Based on GATE2005-IT-53
https://gateoverflow.in/3814/gate2005-it-53 i am confused about how the while loop breaks if a=''DBC" and b="BD"? i suppose here both occurence of B and D will have zero count in count arrray when for loop is checked. please explain?
https://gateoverflow.in/3814/gate2005-it-53i am confused about how the while loop breaks if a=''DBC" and b="BD"?i suppose here both occurence of B and D will have zero co...
458
views
commented
May 27, 2017
Algorithms
identify-function
+
–
1
answer
19
data stuctures
how are addresses assigned to members in a structure and 2-dimensional arrays?
how are addresses assigned to members in a structure and 2-dimensional arrays?
285
views
asked
May 25, 2017
8
answers
20
GATE CSE 2003 | Question: 66
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is represented by binary notation) is $O(n)$ but not $O(n^{0.5})$ $O(n^{0.5})$ ... constant $m>0$ $O( (\log \log n)^k )$ for some constant $k > 0.5$, but not $O( (\log \log n)^{0.5} )$
The cube root of a natural number $n$ is defined as the largest natural number $m$ such that $(m^3 \leq n)$ . The complexity of computing the cube root of $n$ ($n$ is rep...
23.9k
views
commented
May 23, 2017
Algorithms
gatecse-2003
algorithms
time-complexity
normal
+
–
6
answers
21
GATE IT 2005 | Question: 53
The following$ C$ function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the letters in s. int anagram (char *a, char *b) { int count [128], j; for (j = 0; j < 128; j++) count[j] = 0; j ... [j]]++ A: count [a[j++]]++ and B: count[b[j]]-- A: count [a[j]]++ and B: count[b[j++]]--
The following$ C$ function takes two ASCII strings and determines whether one is an anagram of the other. An anagram of a string s is a string obtained by permuting the l...
12.0k
views
commented
Apr 30, 2017
Algorithms
gateit-2005
normal
identify-function
+
–
1
answer
22
digital signature
can we use a secret symmetric key to both sign and verify a signature?
can we use a secret symmetric key to both sign and verify a signature?
312
views
asked
Apr 29, 2017
3
answers
23
while loop
what does following code mean if j=0 and a and b are two character pointers to two strings: while(a[j]&&b[j])
what does following code mean if j=0 and a and b are two character pointers to two strings: while(a[j]&&b[j])
584
views
asked
Apr 27, 2017
1
answer
24
control flow path
what is meant by control flow path?
what is meant by control flow path?
680
views
asked
Apr 27, 2017
Compiler Design
compiler-design
code-optimization
descriptive
+
–
0
answers
25
gate cs 2014 set1 q22
what is meant by check assertion in sql?
what is meant by check assertion in sql?
338
views
asked
Apr 9, 2017
0
answers
26
gate 2014 set 1 q12
what is meant by rooted n node binary tree?
what is meant by rooted n node binary tree?
197
views
asked
Apr 9, 2017
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register