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 abhishek29
2
answers
1
GATE CSE 1993 | Question: 6.2
If the state machine described in figure should have a stable state, the restriction on the inputs is given by $a.b=1$ $a+b=1$ $\bar{a} + \bar{b} =0$ $\overline{a.b}=1$ $\overline{a+b} =1$
If the state machine described in figure should have a stable state, the restriction on the inputs is given by$a.b=1$$a+b=1$$\bar{a} + \bar{b} =0$$\overline{a.b}=1$$\over...
7.1k
views
commented
Dec 31, 2022
Digital Logic
gate1993
digital-logic
normal
circuit-output
sequential-circuit
+
–
1
answer
2
GO Classes Test Series 2023 | Operating System | Test 1 | Question: 5
Which of the below arguments/statements is Not correct ? FIFO scheduling results in the shortest possible average response time if the jobs happen to arrive in the ready queue with the shortest completion times first ... job lengths are less than the time slice length. The dispatcher is responsible for setting thread priorities.
Which of the below arguments/statements is Not correct ?FIFO scheduling results in the shortest possible average response time if the jobs happen to arrive in the ready q...
557
views
commented
Nov 29, 2022
Operating System
goclasses2024-os-1-weekly-quiz
goclasses
operating-system
process-scheduling
multiple-selects
1-mark
+
–
3
answers
3
GATE CSE 2008 | Question: 66
A process executes the following code for(i=0; i<n; i++) fork(); The total number of child processes created is $n$ $2^n-1$ $2^n$ $2^{n+1} - 1$
A process executes the following codefor(i=0; i<n; i++) fork();The total number of child processes created is$n$$2^n-1$$2^n$$2^{n+1} - 1$
17.2k
views
commented
Nov 15, 2022
Operating System
gatecse-2008
operating-system
fork-system-call
normal
+
–
2
answers
4
GATE CSE 2008 | Question: 53
Which of the following are regular sets? $\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$ $\left\{a^nb^m \mid n =2m \right\}$ $\left\{a^nb^m \mid n \neq m \right\}$ $\left\{xcy \mid x, y, \in \left\{a, b\right\} ^* \right\}$ I and IV only I and III only I only IV only
Which of the following are regular sets?$\left\{a^nb^{2m} \mid n \geq 0, m \geq 0 \right\}$$\left\{a^nb^m \mid n =2m \right\}$$\left\{a^nb^m \mid n \neq m \right\}$$\lef...
9.6k
views
commented
Nov 15, 2022
Theory of Computation
gatecse-2008
theory-of-computation
normal
regular-language
+
–
4
answers
5
GATE CSE 2014 Set 1 | Question: 30
Given the following two statements: S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ S2: $AB \to C, D \to E, E \to C$ ... is CORRECT? S1 is TRUE and S2 is FALSE. Both S1 and S2 are TRUE. S1 is FALSE and S2 is TRUE. Both S1 and S2 are FALSE.
Given the following two statements: S1: Every table with two single-valued attributes is in $\text{1NF, 2NF, 3NF}$ and $\text{BCNF}.$ S2: $AB \to C, D \to E, E \to C$ is ...
12.4k
views
commented
Nov 14, 2022
Databases
gatecse-2014-set1
databases
database-normalization
normal
+
–
3
answers
6
GATE CSE 2013 | Question: 54
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$= $\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functional dependencies $(FDs)$ so that $F^+$ is exactly the set of $FDs$ that hold for $R$. How many candidate keys does the relation $R$ have? $3$ $4$ $5$ $6$
Relation $R$ has eight attributes $\text{ABCDEFGH}$. Fields of $R$ contain only atomic values. $F$=$\text{{CH→G, A→BC, B→CFH, E→A, F→EG}}$ is a set of functiona...
14.4k
views
commented
Nov 14, 2022
Databases
gatecse-2013
databases
database-normalization
normal
+
–
5
answers
7
GATE CSE 2002 | Question: 16
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M, ... above decomposition dependency-preserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
For relation R=(L, M, N, O, P), the following dependencies hold:$ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$R is decomposed into R1 = ...
16.7k
views
commented
Nov 14, 2022
Databases
gatecse-2002
databases
database-normalization
normal
descriptive
+
–
1
answer
8
GO Classes Test Series 2023 | Digital Logic | Test 3 | Question: 25
Consider the following circuit. $10011000010$ is supplied to the "data" terminal in $11$ clock cycles. After that the values of $q_2 q_1 q_0$ are $000$ $010$ $101$ $111$
Consider the following circuit.$10011000010$ is supplied to the "data" terminal in $11$ clock cycles. After that the values of $q_2 q_1 q_0$ are$000$$010$$101$$111$
256
views
commented
Oct 24, 2022
Digital Logic
goclasses2024-dl-3-weekly-quiz
goclasses
digital-logic
sequential-circuit
synchronous-asynchronous-circuits
flip-flop
digital-counter
2-marks
+
–
4
answers
9
GATE CSE 2014 Set 1 | Question: 11
Let $G$ be a graph with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjacency matrix? $\Theta(n)$ $\Theta(n+m)$ $\Theta(n^2)$ $\Theta(m^2)$
Let $G$ be a graph with $n$ vertices and $m$ edges. What is the tightest upper bound on the running time of Depth First Search on $G$, when $G$ is represented as an adjac...
12.2k
views
commented
Oct 12, 2022
Algorithms
gatecse-2014-set1
algorithms
graph-algorithms
normal
graph-search
+
–
1
answer
10
GATE Mechanical 2020 Set 2 | GA Question: 7
Find the missing element in the following figure. $d$ $e$ $w$ $y$
Find the missing element in the following figure. $d$$e$$w$$y$
1.9k
views
commented
Oct 12, 2022
Analytical Aptitude
gateme-2020-set2
analytical-aptitude
logical-reasoning
sequence-series
+
–
1
answer
11
GATE2019 CE-1: GA-4
If $E=10,J=20,O=30,$ and $T=40,$ what will be $P+E+S+T?$ $51$ $82$ $120$ $164$
If $E=10,J=20,O=30,$ and $T=40,$ what will be $P+E+S+T?$$51$$82$$120$$164$
2.1k
views
commented
Oct 12, 2022
Analytical Aptitude
gate2019-ce-1
analytical-aptitude
logical-reasoning
code-words
+
–
4
answers
12
GATE CSE 2010 | Question: 62
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive siblings (that is born one after another) is less than three years. Given the ... no twins. In what order they were born (oldest first)? $\text{HSIG}$ $\text{SGHI}$ $\text{IGSH}$ $\text{IHSG}$
Hari(H), Gita(G), Irfan(I) and Saira(S) are siblings (i.e., brothers and sisters). All were born on $1^{\text{st}}$ January. The age difference between any two successive...
11.4k
views
commented
Oct 11, 2022
Analytical Aptitude
gatecse-2010
analytical-aptitude
logical-reasoning
normal
+
–
1
answer
13
GO Classes Scholarship 2023 | Test | Question: 24
Consider the following function $\text{magic5().}$ void magic5(int x, int y){ if (condition) printf("magic"); } What condition we can write in “if-statement” such that $\text{magic5(5,5)}$ will print magic? !(x==5)!=!(y==5) (x==5)?!(y==5):(x==5) ((x==5)||(y==5))&&!((x==5)&&(y==5)) None of these
Consider the following function $\text{magic5().}$void magic5(int x, int y){ if (condition) printf("magic"); }What condition we can write in “if-statement” such that ...
335
views
commented
Aug 7, 2022
Programming in C
goclasses-scholarship-test1
goclasses
programming
programming-in-c
operators
functions
1-mark
+
–
1
answer
14
GO Classes Scholarship 2023 | Test | Question: 21
Let arrays OneD and TwoD are declared as follows as: int OneD[10]; int TwoD[4][5]; Which of the following is/are valid syntax to pass OneD and TwoD to some function fun()? A syntax is valid if it gets compiled without any warning or error. void fun(int OneD[10]); void fun(int OneD[5]); void fun(int TwoD[][5]); void fun(int **TwoD);
Let arrays OneD and TwoD are declared as follows as:int OneD[10]; int TwoD[4][5];Which of the following is/are valid syntax to pass OneD and TwoD to some function fun()?A...
708
views
commented
Aug 7, 2022
Programming in C
goclasses-scholarship-test1
goclasses
programming
programming-in-c
array
multiple-selects
1-mark
+
–
1
answer
15
GO Classes Scholarship 2023 | Test | Question: 1
A relation $\text{R}$ on a set $\text{A}$ is said to be Total Relation iff $a\text{R}b$ Or $b\text{R}a$ Or both, for all $a,b \in \mathrm{A}$. Which of the following options is/are false? Every Total relation is ... total and transitive, then $\mathrm{S}$ is an equivalence relation. The number of total relations on a set of $5$ elements is $1024.$
A relation $\text{R}$ on a set $\text{A}$ is said to be Total Relation iff $a\text{R}b$ Or $b\text{R}a$ Or both, for all $a,b \in \mathrm{A}$.Which of the following optio...
975
views
commented
Aug 7, 2022
Set Theory & Algebra
goclasses-scholarship-test1
goclasses
set-theory&algebra
relations
multiple-selects
2-marks
+
–
3
answers
16
GO Classes 2023 | Weekly Quiz 4 | Question: 20
What will be output printed by $\text{mystery}2(6)$? void mystery2(int n) { if (n > 0) { printf("%d", n); mystery2(n-2); mystery2(n-3); printf("%d", n); } }
What will be output printed by $\text{mystery}2(6)$?void mystery2(int n) { if (n 0) { printf("%d", n); mystery2(n-2); mystery2(n-3); printf("%d", n); } }
531
views
answered
Mar 26, 2022
Programming in C
goclasses_wq4
goclasses
programming
programming-in-c
recursion
numerical-answers
1-mark
+
–
3
answers
17
GO Classes 2023 | Weekly Quiz 4 | Question: 22
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to? int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n==0) return 1; return g(n-1) + f(n); }
Consider the following pair of mutually recursive functions. What does $g(g(2))$ evaluate to?int f(int n){ if (n==0) return 0; return f(n-1)+g(n-1); } int g(int n){ if (n...
903
views
answered
Mar 26, 2022
Programming in C
goclasses_wq4
goclasses
programming
programming-in-c
recursion
numerical-answers
2-marks
+
–
3
answers
18
GO Classes 2023 | Weekly Quiz 4 | Question: 21
What will be the output printed by $\text{mystery}3(6)$? void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }
What will be the output printed by $\text{mystery}3(6)$?void mystery3(int n) { if (n == 0 || n == 1) return; mystery3(n-2); printf("%d", n); mystery3(n-1); }
594
views
answered
Mar 26, 2022
Programming in C
goclasses_wq4
goclasses
programming
programming-in-c
recursion
numerical-answers
1-mark
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register