Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
anjli
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by anjli
0
votes
1
UGC NET CSE | June 2019 | Part 2 | Question: 8
Match List-I with List-II: ... ); (b) - (i); (c) - (iii); (d) - (ii) (a) - (iv); (b) - (iii); (c) - (i); (d) - (ii)
Match List-I with List-II:$$\begin{array}{|c|c|c|c|} \hline {} & \text{List-I} & {} & \text{List-II} \\ \hline (a) & p \rightarrow q & (i) & \rceil ( q \rightarrow \rcei...
1.8k
views
answered
Feb 20, 2021
Mathematical Logic
ugcnetcse-june2019-paper2
propositional-logic
+
–
0
votes
2
UGC NET CSE | January 2017 | Part 2 | Question: 6
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that $\begin{array}{c} (P \to Q) \wedge (R \to S) \\ P \vee R \\ \hline Y \\ \hline \end{array}$ $Y$ is the premise : $P \vee R$ $P \vee S$ $Q \vee R$ $Q \vee S$
In propositional logic if $\left ( P \rightarrow Q \right )\wedge \left ( R \rightarrow S \right )$ and $\left ( P \vee R \right )$ are two premises such that$$\begin{arr...
2.8k
views
answered
Feb 20, 2021
Mathematical Logic
ugcnetjan2017ii
discrete-mathematics
propositional-logic
+
–
0
votes
3
UGC NET CSE | January 2017 | Part 2 | Question: 2
Match the following : ...
Match the following :$\begin{array}{llll} & \textbf{List – I} & {} & \textbf{List – II} \\ \text{a.} & \text{Absurd} & \text{i.} & \text{Clearly impossible being con...
989
views
answered
Feb 20, 2021
Mathematical Logic
ugcnetjan2017ii
mathematical-logic
+
–
1
votes
4
NIELIT 2017 July Scientist B (CS) - Section B: 16
Which of the following propositions is tautology? $(p\lor q)\to q$ $p\lor (q\to p)$ $p\lor (p\to q)$ Both (B) and (C)
Which of the following propositions is tautology?$(p\lor q)\to q$$p\lor (q\to p)$$p\lor (p\to q)$Both (B) and (C)
708
views
answered
Feb 20, 2021
Mathematical Logic
nielit2017july-scientistb-cs
mathematical-logic
+
–
0
votes
5
NIELIT 2017 July Scientist B (IT) - Section B: 13
Which of the following statements is false? $(P\land Q)\lor(\sim P\land Q)\lor(P \land \sim Q)$ is equal to $\sim Q\land \sim P$ $(P\land Q)\lor(\sim P\land Q)\lor(P \wedge \sim Q)$ is equal to $Q\lor P$ ... $(P\land Q)\lor(\sim P\land Q)\lor (P \land \sim Q)$ is equal to $P\lor (Q\land \sim P)$
Which of the following statements is false?$(P\land Q)\lor(\sim P\land Q)\lor(P \land \sim Q)$ is equal to $\sim Q\land \sim P$$(P\land Q)\lor(\sim P\land Q)\lor(P \wedge...
850
views
answered
Feb 20, 2021
Mathematical Logic
nielit2017july-scientistb-it
mathematical-logic
propositional-logic
+
–
0
votes
6
NIELIT 2016 MAR Scientist C - Section C: 65
In propositional logic, which of the following is equivalent to $p \rightarrow q$? $\sim p\rightarrow q$ $ \sim p \vee q$ $ \sim p \vee \sim q$ $p\rightarrow \sim q$
In propositional logic, which of the following is equivalent to $p \rightarrow q$?$\sim p\rightarrow q$$ \sim p \vee q$$ \sim p \vee \sim q$$p\rightarrow \sim q$
2.4k
views
answered
Feb 20, 2021
Mathematical Logic
nielit2016mar-scientistc
discrete-mathematics
mathematical-logic
+
–
0
votes
7
NIELIT 2016 MAR Scientist C - Section C: 25
Which of the following is FALSE? $Read\ \wedge as\ AND, \vee\ as\ OR, \sim as\ NOT, \rightarrow$ as one way implication and $\leftrightarrow$ as two way implication? $((x\rightarrow y)\wedge x)\rightarrow y$ $((\sim x\rightarrow y)\wedge (\sim x\wedge \sim y))\rightarrow x$ $(x\rightarrow (x\vee y))$ $((x\vee y)\leftrightarrow (\sim x\vee \sim y))$
Which of the following is FALSE?$Read\ \wedge as\ AND, \vee\ as\ OR, \sim as\ NOT, \rightarrow$ as one way implication and $\leftrightarrow$ as two way implication?$((x\r...
762
views
answered
Feb 20, 2021
Mathematical Logic
nielit2016mar-scientistc
discrete-mathematics
mathematical-logic
+
–
0
votes
8
UGC NET CSE | October 2020 | Part 2 | Question: 3
Which of the following pairs of propositions are not logically equivalent? $((p \rightarrow r) \wedge (q \rightarrow r))$ and $((p \vee q) \rightarrow r)$ $p \leftrightarrow q$ and $(\neg p \leftrightarrow \neg q)$ ... and $p \leftrightarrow q$ $((p \wedge q) \rightarrow r)$ and $((p \rightarrow r) \wedge (q \rightarrow r))$
Which of the following pairs of propositions are not logically equivalent?$((p \rightarrow r) \wedge (q \rightarrow r))$ and $((p \vee q) \rightarrow r)$$p \leftrightarro...
2.3k
views
answered
Feb 19, 2021
Discrete Mathematics
ugcnetcse-oct2020-paper2
discrete-mathematics
mathematical-logic
+
–
1
votes
9
UGC NET CSE | October 2020 | Part 2 | Question: 75
Arrange the following types of machine in descending order of complexity. SISD MIMD SIMD Choose the correct answer from the options given below: $a,b,c$ $c,b,a$ $b.c.a$ $c,a,b$
Arrange the following types of machine in descending order of complexity.SISDMIMDSIMDChoose the correct answer from the options given below:$a,b,c$$c,b,a$$b.c.a$$c,a,b$
1.3k
views
answered
Feb 16, 2021
CO and Architecture
ugcnetcse-oct2020-paper2
co-and-architecture
machine-instruction
+
–
0
votes
10
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 35
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6\text{ ms}$ per cylinder. The total seek time, if the disk arm scheduling algorithm is first-come-first-served is $900$ ms $850$ ms $360$ ms $876$ ms
Disk request come to a disk driver for cylinders in the order $10,22,20,2,40,6$ and $38,$ at a time when the disk drive is reading from cylinder $20$. The seek time is $6...
1.0k
views
answered
Feb 10, 2021
Operating System
nielit2017oct-assistanta-cs
operating-system
disk-scheduling
+
–
1
votes
11
NIELIT 2016 MAR Scientist C - Section C: 63
The range of the numbers which can be stored in an eight bit register is $-128$ to $+127$ $-128$ to $+128$ $-999999+ \: +999999$ none of these
The range of the numbers which can be stored in an eight bit register is$-128$ to $+127$$-128$ to $+128$$-999999+ \: +999999$none of these
666
views
answered
Feb 6, 2021
Digital Logic
nielit2016mar-scientistc
digital-logic
register-allocation
+
–
1
votes
12
NIELIT 2016 MAR Scientist C - Section C: 40
If the input $\text{J}$ is connected through $\text{K}$ input of $\text{J-K}$, then flip-flop will behave as a D type flip-flop T type flip-flop S-R flip-flop Toggle switch
If the input $\text{J}$ is connected through $\text{K}$ input of $\text{J-K}$, then flip-flop will behave as a D type flip-flopT type flip-flopS-R flip-flopToggle switch
712
views
answered
Feb 6, 2021
Digital Logic
nielit2016mar-scientistc
digital-logic
flip-flop
+
–
1
votes
13
NIELIT 2016 MAR Scientist C - Section C: 39
If a clock with time period $“T”$ is used with $n$ stage shift register, then output of final stage will be delayed by $nT$ sec $(n-1)T$ sec $n/T$ sec $(2n-1)T$ sec
If a clock with time period $“T”$ is used with $n$ stage shift register, then output of final stage will be delayed by$nT$ sec$(n-1)T$ sec$n/T$ sec$(2n-1)T$ sec
1.2k
views
answered
Feb 6, 2021
Digital Logic
nielit2016mar-scientistc
digital-logic
sequential-circuit
+
–
0
votes
14
NIELIT 2017 OCT Scientific Assistant A (CS) - Section D: 9
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is $\text{S-R}$ Flip-flop with inputs $X = R$ and $Y=S$ $\text{S-R}$ ... $X = J$ and $Y=K$ $\text{J-K}$ Flip-flop with inputs $X = K$ and $Y=J$
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is$\text{S-R}$ Flip-flop wi...
2.0k
views
answered
Feb 6, 2021
Digital Logic
nielit2017oct-assistanta-cs
digital-logic
sequential-circuit
flip-flop
+
–
0
votes
15
NIELIT 2017 OCT Scientific Assistant A (IT) - Section D: 10
A $4$ bit ripple counter and a $4$ bit synchronous counter are made using flip-flops having a propagation delay of $10$ ns each. If the worst case delay in the ripple counter and the synchronous counter be $R$ and $S$ respectively, then $R = 10$ ns, $S = 40$ ns $R = 40$ ns, $S = 10$ ns $R = 10$ ns, $S = 30$ ns $R = 30$ ns, $S = 10$ ns
A $4$ bit ripple counter and a $4$ bit synchronous counter are made using flip-flops having a propagation delay of $10$ ns each. If the worst case delay in the ripple cou...
917
views
answered
Feb 6, 2021
Digital Logic
nielit2017oct-assistanta-it
digital-logic
sequential-circuit
flip-flop
digital-counter
+
–
0
votes
16
NIELIT 2017 OCT Scientific Assistant A (CS) - Section D: 9
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is $\text{S-R}$ Flip-flop with inputs $X = R$ and $Y=S$ $\text{S-R}$ ... $X = J$ and $Y=K$ $\text{J-K}$ Flip-flop with inputs $X = K$ and $Y=J$
A sequential circuit using D flip-flop and logic gates is shown in Figure, where $X$ and $Y$ are the inputs and $Z$ is the output. The circuit is$\text{S-R}$ Flip-flop wi...
2.0k
views
answered
Feb 6, 2021
Digital Logic
nielit2017oct-assistanta-cs
digital-logic
sequential-circuit
flip-flop
+
–
0
votes
17
UGC NET CSE | October 2020 | Part 2 | Question: 42
Simplified expression/s for following Boolean function $F(A,B,C,D)=\Sigma(0,1,2,3,6,12,13,14,15)$ is/are $A’B’+AB+A’C’D’$ $A’B’+AB+A’CD’$ $A’B’+AB+BC’D’$ $A’B’+AB+BCD’$ Choose the correct answer from the options given below: $(i)$ only $(ii)$ only $(i)$ and $(ii)$ only $(ii)$ and $(iv)$ only
Simplified expression/s for following Boolean function$F(A,B,C,D)=\Sigma(0,1,2,3,6,12,13,14,15)$ is/are$A’B’+AB+A’C’D’$$A’B’+AB+A’CD’$$A’B’+AB+BC’...
2.0k
views
answered
Feb 6, 2021
Digital Logic
ugcnetcse-oct2020-paper2
digital-logic
k-map
+
–
0
votes
18
UGC NET CSE | January 2017 | Part 2 | Question: 18
Let $M$ and $N$ be two entities in an $E-R$ diagram with simple single value attributes. $R_{1}$ and $R_{2}$ are two relationship between $M$ and $N$, where as $R_{1}$, is one-to-many and $R_{2}$, is many-to-many. The minimum number of tables required to represent $M, N, R_{1}$, and $R_{2}$, in the relational model are ___________. $4$ $6$ $7$ $3$
Let $M$ and $N$ be two entities in an $E-R$ diagram with simple single value attributes. $R_{1}$ and $R_{2}$ are two relationship between $M$ and $N$, where as $R_{1}$, i...
3.2k
views
answered
Feb 6, 2021
Databases
ugcnetjan2017ii
databases
er-diagram
+
–
0
votes
19
KPGCET-CSE-2019-74
The multivalued dependencies (MVDs) can be eliminated using ______ normal form on _____ normal form relations. $1$st, $2$nd $2$nd, $3$rd $3$rd, BCNF $4$th, BCNF
The multivalued dependencies (MVDs) can be eliminated using ______ normal form on _____ normal form relations.$1$st, $2$nd$2$nd, $3$rd$3$rd, BCNF$4$th, BCNF
474
views
answered
Feb 6, 2021
Others
kpgcet-cse-2019
database-normalization
databases
+
–
1
votes
20
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 13
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$ $R$ has no duplicates and $S$ is non-empty $R$ and $S$ have no duplicates $S$ has no duplicates and $R$ is non-empty $R$ and $S$ has the same number of tuples
Given relations $R(w,x)$ and $S(y,z),$ the result of SELECT DISTINCT $w,x$ from $R,S$$R$ has no duplicates and $S$ is non-empty$R$ and $S$ have no duplicates$S$ has no du...
812
views
answered
Feb 6, 2021
Databases
nielit2017oct-assistanta-cs
databases
sql
+
–
1
votes
21
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 10
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a timestamp smaller than that of $Tj$ (that is $Ti$ is order than Tj). Otherwise, $Ti$ is rolled back (dies). This is Wait-die Wait-wound Wound-wait Wait
When transaction $Ti$ requests a data item currently held by $Tj,Ti$ is allowed to wait only if it has a timestamp smaller than that of $Tj$ (that is $Ti$ is order than T...
1.4k
views
answered
Feb 6, 2021
Databases
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
+
–
1
votes
22
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 27
Which of the following desired features are beyond the capability of relational algebra? Aggregate Computation Multiplication Finding transitive closure All of the above
Which of the following desired features are beyond the capability of relational algebra?Aggregate ComputationMultiplicationFinding transitive closureAll of the above
1.9k
views
answered
Feb 6, 2021
Databases
nielit2017oct-assistanta-it
databases
relational-algebra
+
–
0
votes
23
UGC NET CSE | January 2017 | Part 3 | Question: 8
Which one is correct w.r.t. RDBMS? primary key $\subseteq$ super key $\subseteq$ candidate key primary key $\subseteq$ candidate key $\subseteq$ super key super key $\subseteq$ candidate key $\subseteq$ primary key super key $\subseteq$ primary key $\subseteq$ candidate key
Which one is correct w.r.t. RDBMS?primary key $\subseteq$ super key $\subseteq$ candidate keyprimary key $\subseteq$ candidate key $\subseteq$ super key super key $\subse...
2.7k
views
answered
Feb 6, 2021
Databases
ugcnetcse-jan2017-paper3
database-normalization
candidate-key
+
–
1
votes
24
NIELIT 2017 DEC Scientist B - Section B: 55
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NF BCNF $3$NF $1$NF
Consider the relational schema $\text{R(A B C D)}$ with following functional dependency set $F=\{A\rightarrow BC,C\rightarrow D\};$ The relation $\text{R}$ is in $2$NFBCN...
3.8k
views
answered
Feb 6, 2021
Databases
nielit2017dec-scientistb
database-normalization
bcnf
+
–
0
votes
25
NIELIT 2017 DEC Scientist B - Section B: 25
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$. $2$NF BCNF $3$NF $1$NF
Consider the relational schema $R(A B C D)$ with following $FD$ set $F=\{A \to CE, B \to D, AE \to D\}$. Identify the highest normal form satisfied by the relation $R$.$2...
4.9k
views
answered
Feb 6, 2021
Databases
nielit2017dec-scientistb
databases
database-normalization
+
–
0
votes
26
NIELIT 2017 DEC Scientist B - Section B: 1
Which one of the following statements are not correct? $S1$: $3$NF decomposition is always lossless join and dependency preserving. $S2$: $3$NF decomposition is always lossless join but may or may not be dependency preserving. $S3$: BCNF decomposition is always ... may not be dependency preserving. Only $S1$ Only $S4$ Both $S1$ and $S4$ Both $S2$ and $S3$
Which one of the following statements are not correct?$S1$: $3$NF decomposition is always lossless join and dependency preserving.$S2$: $3$NF decomposition is always loss...
3.4k
views
answered
Feb 6, 2021
Databases
nielit2017dec-scientistb
database-normalization
bcnf-decomposition
+
–
1
votes
27
NIELIT 2016 DEC Scientist B (CS) - Section B: 49
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by $A\to B$ $B\gets A$ $AB\to R$ $R\gets AB$
Considering relational database, functional dependency between two attributes $A$ and $B$ is denoted by$A\to B$$B\gets A$$AB\to R$$R\gets AB$
2.4k
views
answered
Feb 6, 2021
Databases
nielit2016dec-scientistb-cs
databases
database-normalization
+
–
0
votes
28
NIELIT 2016 DEC Scientist B (CS) - Section B: 47
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as $FD$ is covered by $E$ $E$ is covered by $F$ $F$ is covered by $E$ $F$ plus is covered by $E$
If every functional dependency in set $E$ is also in closure of $F$ then this is classified as$FD$ is covered by $E$$E$ is covered by $F$$F$ is covered by $E$$F$ plus is ...
1.6k
views
answered
Feb 6, 2021
Databases
nielit2016dec-scientistb-cs
databases
database-normalization
+
–
1
votes
29
NIELIT 2016 DEC Scientist B (CS) - Section B: 31
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified as referential rule inferential rule augmentation rule reflexive rule
Rule which states that addition of same attributes to right side and left side will result in other valid dependency is classified asreferential ruleinferential ruleaugme...
2.7k
views
answered
Feb 6, 2021
Databases
nielit2016dec-scientistb-cs
databases
database-normalization
+
–
0
votes
30
NIELIT 2016 DEC Scientist B (CS) - Section B: 2
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as: normalization of data. denomination of data. isolation of data. de-normalization of data.
Process of analyzing relation schemas to achieve minimal redundancy and insertion or update anomalies is classified as:normalization of data.denomination of data.isolatio...
3.9k
views
answered
Feb 6, 2021
Databases
nielit2016dec-scientistb-cs
databases
database-normalization
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register