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
Recent activity by shubham0109
0
answers
1
Is the ISRO form for cse out?
Is the form for ISRO CSE out? If it is please provide the link
Is the form for ISRO CSE out? If it is please provide the link
437
views
asked
Feb 8, 2019
7
answers
2
GATE CSE 2008 | Question: 40
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is $\Theta(n)$ $\Theta(\log n)$ $\Theta(\log^*n)$ $\Theta(1)$
The minimum number of comparisons required to determine if an integer appears more than $\frac{n}{2}$ times in a sorted array of $n$ integers is$\Theta(n)$$\Theta(\log n)...
36.7k
views
commented
Dec 30, 2018
Algorithms
gatecse-2008
normal
algorithms
time-complexity
+
–
3
answers
3
GATE CSE 2016 Set 1 | Question: 15
Consider the following C program. # include <stdio.h> void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a = 2016, b=0, c= 4, d = 42; mystery (&a, &b); if (a < c) mystery (&c, &a); mystery (&a, &d); printf("%d\n", a); } The output of the program is _________.
Consider the following C program.# include <stdio.h void mystery (int *ptra, int *ptrb) { int *temp; temp = ptrb; ptrb =ptra; ptra = temp; } int main () { int a...
18.1k
views
commented
Dec 20, 2018
Programming in C
gatecse-2016-set1
programming-in-c
easy
numerical-answers
parameter-passing
+
–
2
answers
4
GATE CSE 2011 | Question: 42
Definition of a language $L$ with alphabet $\{a\}$ is given as following.$ L = \left\{a^{nk} \mid k > 0, \:\: and \:\: n \text{ is a positive integer constant} \right\}$What is the minimum number of states needed in a DFA to recognize $L$? $k+1$ $n+1$ $2^{n+1}$ $2^{k+1}$
Definition of a language $L$ with alphabet $\{a\}$ is given as following.$$ L = \left\{a^{nk} \mid k 0, \:\: and \:\: n \text{ is a positive integer constant} \right\}$$...
17.6k
views
commented
Nov 7, 2018
Theory of Computation
gatecse-2011
theory-of-computation
finite-automata
normal
minimal-state-automata
+
–
3
answers
5
GATE CSE 2001 | Question: 1.6
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least $N^2$ $2^N$ $2N$ $N!$
Given an arbitrary non-deterministic finite automaton (NFA) with $N$ states, the maximum number of states in an equivalent minimized DFA at least$N^2$$2^N$$2N$$N!$
15.9k
views
commented
Nov 6, 2018
Theory of Computation
gatecse-2001
finite-automata
theory-of-computation
easy
minimal-state-automata
+
–
5
answers
6
GATE IT 2008 | Question: 74
Consider the following relational schema: $\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$ ... the name of the school and the number of its students scoring $100$ in at least one exam nothing; the query has a syntax error
Consider the following relational schema:$\text{Student} (\underline{\text{school-id}, \text{sch-roll-no}}, \text{sname}, \text{saddress})$$\text{School} (\underline{\tex...
18.3k
views
commented
Nov 2, 2018
Databases
gateit-2008
databases
sql
normal
+
–
2
answers
7
GATE CSE 1999 | Question: 2.25
Which of the following is/are correct? An SQL query automatically eliminates duplicates An SQL query will not work if there are no indexes on the relations SQL permits attribute names to be repeated in the same relation None of the above
Which of the following is/are correct?An SQL query automatically eliminates duplicatesAn SQL query will not work if there are no indexes on the relationsSQL permits attri...
20.0k
views
commented
Nov 1, 2018
Databases
gate1999
databases
sql
easy
+
–
4
answers
8
GATE CSE 2018 | Question: 41
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query $Q: r \bowtie (\sigma_{B<5} (s))$ Let LOJ denote the natural left outer-join operation. Assume that $r$ and $s$ contain no null ... $r \: LOJ \: (\sigma_{B<5} (s))$ $\sigma_{B<5} (r) \: LOJ \: s$
Consider the relations $r(A, B)$ and $s(B, C)$, where $s.B$ is a primary key and $r.B$ is a foreign key referencing $s.B$. Consider the query$Q: r \bowtie (\sigma_{B<5} (...
15.7k
views
commented
Oct 30, 2018
Databases
gatecse-2018
databases
relational-algebra
normal
2-marks
+
–
4
answers
9
GATE CSE 2006 | Question: 52
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot? $\Theta (n)$ $\Theta (n \log n)$ $\Theta (n^{2})$ $\Theta (n^{3})$
The median of $n$ elements can be found in $O(n)$ time. Which one of the following is correct about the complexity of quick sort, in which median is selected as pivot?$\T...
53.4k
views
commented
Oct 5, 2018
Algorithms
gatecse-2006
algorithms
sorting
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register