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 Sahil1994
1
answer
1
isro query
Where to apply for ISRO 2018?
Where to apply for ISRO 2018?
542
views
answered
Feb 6, 2018
ISRO
isro-application
+
–
5
answers
2
#TCP/IP
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
What is the maximum size of data that the Network layer can forward to the Data link layer including header data? Should it be 65535B or 1500B?
2.7k
views
answered
Feb 2, 2018
4
answers
3
Regular Expression
Can I write $a^* + b^* = (a + b)^*$ ????
Can I write $a^* + b^* = (a + b)^*$ ????
923
views
answered
Jan 31, 2018
Theory of Computation
regular-expression
theory-of-computation
+
–
0
answers
4
Test Series
We need to draw DFA for it. and then NFA.? Please tell the approach?
We need to draw DFA for it. and then NFA.?Please tell the approach?
249
views
edited
Jan 31, 2018
Theory of Computation
theory-of-computation
+
–
1
answer
5
Test Series
Consider the following set of functional dependencies { (Eid, pno) --> hours, Eid --> Ename, Pno --> (Pname, Plocation), Pname --> Plocation } in a relation R (Eid, Pno, hours, Ename, Pname, Plocation). After decomposition, the relation R1 (Pno, Pname, Plocation) is in __ BCNF 3NF but not in BCNF 1NF
Consider the following set of functional dependencies{(Eid, pno) hours,Eid Ename,Pno (Pname, Plocation),Pname Plocation}in a relation R (Eid, Pno,...
432
views
commented
Jan 29, 2018
Databases
databases
+
–
1
answer
6
MadeEasy Test Series 2018: Operating System - Page Replacement
Consider a computer system having 20 physical page frames numbered from 1 to 20 which are initially empty. Now, a program accesses the pages numbered 1, 2 ..........100 twice. The number of page fault generated by optimal page replacement policy is __________.
Consider a computer system having 20 physical page frames numbered from 1 to 20 which are initially empty. Now, a program accesses the pages numbered 1, 2 ..........100 t...
1.2k
views
commented
Jan 26, 2018
Operating System
operating-system
page-replacement
made-easy-test-series
+
–
1
answer
7
page replacemment policy
A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenario Case-1: System first accesses 200 distinct pages in sequential order and then access same 200 distinct ... access same 200 distinct page in reverse order. The difference in the number of faults occurred in both case are _________.
A system uses optimal policy for a page replacement. It has 4 page frames with no pages loaded to begin with. Consider the following scenarioCase-1: System first accesses...
377
views
answered
Jan 26, 2018
Operating System
operating-system
page-replacement
page-fault
paging
+
–
0
answers
8
Test Series
Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page. ... purpose? <4,12,12,12> < 2, 12, 12, 12 > <4,14,14,14> <10,12,14,14>
Consider a processor has virtual address 52 bits, the physical address is 32 bits and page size is 16KB. Each individual table at any level of the page table occupies a s...
629
views
commented
Jan 26, 2018
Operating System
operating-system
paging
+
–
1
answer
9
paging
Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies a single page of physical memory. Using multi level paging, how many entries are there in each individual page table page ... purpose? < 2, 12, 12, 12 > <10,14,14,14> <4,14,14,14> <10,12,14,14>
Consider a processor has virtual address 52 bits, the physical address is 32 bits and the page size is 16KB. Each individual table at any level of the page table occupies...
1.4k
views
commented
Jan 26, 2018
Operating System
paging
operating-system
memory-management
multilevel
+
–
0
answers
10
Test Series
Consider the circuit with initial state Q0=0,Q1=0 and Q2=0. Then which of the following sequence of output is correct? a)4, 6, 3 b) 1, 3, 7 c) 3, 6, 4 d) 7, 3, 1
Consider the circuit with initial state Q0=0,Q1=0 and Q2=0.Then which of the following sequence of output is correct?a)4, 6, 3b) 1, 3, 7c) 3, 6, 4d) 7, 3, 1
450
views
commented
Jan 26, 2018
Digital Logic
digital-logic
+
–
5
answers
11
GATE CSE 2007 | Question: 33
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $X * Y = XY + X'Y'.$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$. $P : X = Y * Z, \\ Q :Y = X * Z, \\ R : X *Y * Z = 1$ Which of the following is TRUE? Only $P$ and $Q$ are valid. Only $Q$ and $R$ are valid. Only $P$ and $R$ are valid. All $P$, $Q$, $R$ are valid.
Define the connective $*$ for the Boolean variables $X$ and $Y$ as: $$X * Y = XY + X'Y'.$$ Let $Z = X * Y$. Consider the following expressions $P$, $Q$ and $R$.$$P : X = ...
9.0k
views
commented
Jan 24, 2018
Digital Logic
gatecse-2007
digital-logic
normal
boolean-algebra
+
–
6
answers
12
GATE CSE 2000 | Question: 2.11
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$ $xy + yw$ $(w + x) (\bar{w} + y) (\bar{x} + y)$ None of the above
Which functions does NOT implement the Karnaugh map given below? $(w + x) y$$xy + yw$$(w + x) (\bar{w} + y) (\bar{x} + y)$None of t...
7.2k
views
commented
Jan 23, 2018
Digital Logic
gatecse-2000
digital-logic
k-map
normal
+
–
2
answers
13
GATE CSE 1999 | Question: 1.8
Which of the following functions implements the Karnaugh map shown below? $\bar{A}B + CD$ $D(C+A)$ $AD+\bar{A}B$ $(C+D) (\bar{C}+D) + (A+B)$
Which of the following functions implements the Karnaugh map shown below?$\bar{A}B + CD$$D(C+A)$$AD+\bar{A}B$$(C+D) (\bar{C}+D) + (A+B)$
5.8k
views
commented
Jan 23, 2018
Digital Logic
gate1999
digital-logic
k-map
easy
+
–
3
answers
14
GATE CSE 2015 Set 1 | Question: 14
Which one of the following is NOT equivalent to $p ↔ q$? $(\neg p ∨ q) ∧ (p ∨ \neg q)$ $(\neg p ∨ q) ∧ (q → p)$ $(\neg p ∧ q) ∨ ( p ∧ \neg q)$ $(\neg p ∧ \neg q) ∨ (p ∧ q)$
Which one of the following is NOT equivalent to $p ↔ q$?$(\neg p ∨ q) ∧ (p ∨ \neg q)$$(\neg p ∨ q) ∧ (q → p)$$(\neg p ∧ q) ∨ ( p ∧ \neg q)$$(\neg p �...
7.6k
views
commented
Jan 21, 2018
Mathematical Logic
gatecse-2015-set1
mathematical-logic
easy
propositional-logic
+
–
2
answers
15
GATE CSE 2010 | Question: 25
Which of the following statements are true? Shortest remaining time first scheduling may cause starvation Preemptive scheduling may cause starvation Round robin is better than FCFS in terms of response time I only I and III only II and III only I, II and III
Which of the following statements are true?Shortest remaining time first scheduling may cause starvationPreemptive scheduling may cause starvationRound robin is better th...
20.6k
views
commented
Jan 21, 2018
Operating System
gatecse-2010
operating-system
process-scheduling
easy
+
–
8
answers
16
GATE CSE 2000 | Question: 1.2
An $n \times n$ array $v$ is defined as follows: $v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$ The sum of the elements of the array $v$ is $0$ $n-1$ $n^2 - 3n +2$ $n^2 \frac{\left(n+1\right)}{2}$
An $n \times n$ array $v$ is defined as follows:$v\left[i,j\right] = i - j$ for all $i, j, i \leq n, 1 \leq j \leq n$The sum of the elements of the array $v$ is$0$$n-1$$n...
9.9k
views
commented
Jan 15, 2018
DS
gatecse-2000
data-structures
array
easy
+
–
14
answers
17
GATE CSE 2012 | Question: 12
What is the complement of the language accepted by the NFA shown below? Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string. $\phi$ $\{\epsilon\}$ $a^*$ $\{a , \epsilon\}$
What is the complement of the language accepted by the NFA shown below?Assume $\Sigma = \{a\}$ and $\epsilon$ is the empty string.$\phi$$\{\epsilon\}$$a^*$$\{a , \epsilon...
19.3k
views
commented
Jan 14, 2018
Theory of Computation
gatecse-2012
finite-automata
easy
theory-of-computation
+
–
2
answers
18
GATE CSE 2009 | Question: 43
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below: $T_1: R_1[x]W_1[x]W_1[y]$ $T_2: R_2[x]R_2[y]W_2[y]$ $S_1: R_1[x]R_2[x]R_2[y] W_1[x] W_1[y] W_2[y]$ ... $S_1 \text{ and } S_2$ $S_2 \text{ and } S_3$ $S_3$ only $S_4$ only
Consider two transactions $T_1$ and $T_2$, and four schedules $S_1, S_2, S_3, S_4$, of $T_1$ and $T_2$ as given below:$T_1: R_1[x]W_1[x]W_1[y]$$T_2: R_2[x]R_2[y]W_2[y...
6.7k
views
commented
Jan 6, 2018
Databases
gatecse-2009
databases
transaction-and-concurrency
normal
+
–
1
answer
19
Computer Networks
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both None Que 2 which protocol has flow control but not error control? Stop-and-Wait Simplest Go-Back-N ARQ Selective-Repeat ARQ
Que 1 In character-oriented protocol, we use __________ Bit stuffing Byte stuffing Both NoneQue 2 which protocol has flow control but not error control? Stop-and-Wai...
1.4k
views
answer selected
Jan 5, 2018
Computer Networks
computer-networks
+
–
6
answers
20
GATE CSE 2007 | Question: 62, UGCNET-June2014-II: 47
Which one of the following statements is $\text{FALSE}$? Any relation with two attributes is in $\text{BCNF}$ A relation in which every key has only one attribute is in $\text{2NF}$ A prime attribute can be transitively dependent on ... a $\text{3 NF}$ relation A prime attribute can be transitively dependent on a key in a $\text{BCNF}$ relation
Which one of the following statements is $\text{FALSE}$?Any relation with two attributes is in $\text{BCNF}$A relation in which every key has only one attribute is in $\t...
24.4k
views
commented
Jan 4, 2018
Databases
gatecse-2007
databases
database-normalization
normal
ugcnetcse-june2014-paper2
+
–
0
answers
21
propositional logic
333
views
commented
Jan 4, 2018
4
answers
22
GATE CSE 2014 Set 3 | Question: 22
A prime attribute of a relation scheme $R$ is an attribute that appears in all candidate keys of $R$ in some candidate key of $R$ in a foreign key of $R$ only in the primary key of $R$
A prime attribute of a relation scheme $R$ is an attribute that appearsin all candidate keys of $R$in some candidate key of $R$in a foreign key of $R$only in the primary ...
13.3k
views
commented
Jan 4, 2018
Databases
gatecse-2014-set3
databases
easy
candidate-key
+
–
4
answers
23
ISI2011-PCB-CS-5b
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies: $A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$. If we project $R$ and therefore its functional dependencies onto the schema $ABC$, what will the key(s) for $ABC$ be?
Suppose we have a relation $R(A, B, C, D, E)$ with the functional dependencies:$A \rightarrow D, B \rightarrow C, D \rightarrow E, CE \rightarrow B$.If we project $R$ and...
2.1k
views
answered
Jan 4, 2018
Databases
descriptive
isi2011-pcb-cs
databases
database-normalization
+
–
1
answer
24
GATE CSE 2015 Set 3 | Question: 20
Consider the relation $X(P,Q,R,S,T,U)$ with the following set of functional dependencies $F = \{ \\ \; \; \{P, R\} \rightarrow \{S, T\}, \\ \; \; \{P, S, U\} \rightarrow \{Q, R\} \\ \; \}$ Which of the following is the trivial functional dependency in $F^+$, ... $\{P, R\} \rightarrow \{R, T\}$ $\{P, S\} \rightarrow \{S\}$ $\{P, S, U\} \rightarrow \{Q\}$
Consider the relation $X(P,Q,R,S,T,U)$ with the following set of functional dependencies$F = \{ \\ \; \; \{P, R\} \rightarrow \{S, T\}, \\ \; \; \{P, S, U\} \rightarrow \...
14.9k
views
commented
Jan 3, 2018
Databases
gatecse-2015-set3
databases
database-normalization
easy
+
–
2
answers
25
Bit stuffing
3.4k
views
commented
Jan 1, 2018
Computer Networks
computer-networks
+
–
0
answers
26
View Seializability
Can anyone explain or give any link to study View Serializability ... Will be really thankful..
Can anyone explain or give any link to study View Serializability ... Will be really thankful..
252
views
asked
Dec 22, 2017
Databases
databases
view-serializable
+
–
1
answer
27
test series
Consider the following set of functional dependencies { (Eid, pno) --> hours, Eid --> Ename, Pno --> (Pname, Plocation), Pname --> Plocation } in a relation R (Eid, Pno, hours, Ename, Pname, Plocation). After decomposition, the relation R1 (Pno, Pname, Plocation) is in __
Consider the following set of functional dependencies{(Eid, pno) hours,Eid Ename,Pno (Pname, Plocation),Pname Plocation}in a relation R (Eid, Pno,...
398
views
answered
Dec 21, 2017
1
answer
28
SELF DOUBT
Hi Can any one explain by Diagram. It will be more Easy to understand Thanks, Let R represents an one to many relationship between entities E1 and E2 and the set A, B attributes represent the key of R (A is key for E1 and B is key for E2) then which of the following ... is correct The FD, A→B will only holds The FD, B→A will only holds (a) and (b) hold together Neither (a) nor (b) holds
Hi Can any one explain by Diagram. It will be more Easy to understandThanks,Let R represents an one to many relationship between entities E1 and E2 and the set A, B attri...
385
views
asked
Dec 21, 2017
Databases
databases
er-diagram
+
–
2
answers
29
ISRO-DEC2017-80
Consider the following $C$ function #include<stdio.h> int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; } The output of the program is $\text{SI}$ $\text{IT}$ $\text{T1}$ $17$
Consider the following $C$ function#include<stdio.h int main(void) { char c[]="ICRBCSIT17" char *p=c; printf("%s",c+2[p]-6[p]-1); return 0; }The output of the program is ...
3.8k
views
answered
Dec 20, 2017
Programming in C
isrodec2017
+
–
2
answers
30
GATE CSE 1997 | Question: 6.9
For a database relation $R(a, b, c, d)$, where the domains $a, b, c, d$ include only atomic values, only the following functional dependencies and those that can be inferred from them hold $a \rightarrow c$ $b \rightarrow d$ This ... normal form but not in second normal form in second normal form but not in first normal form in third normal form none of the above
For a database relation $R(a, b, c, d)$, where the domains $a, b, c, d$ include only atomic values, only the following functional dependencies and those that can be infer...
11.9k
views
commented
Dec 20, 2017
Databases
gate1997
databases
database-normalization
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register