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
Recent activity by anjli
1
answer
1
GATE CSE 2021 Set 1 | Question: 47
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys: There is a main hash table of size $4$. The $2$ least significant bits of a key is used to index into the main hash table. Initially, the main hash table entries are empty. Thereafter, when more keys are hashed ... notation)? $5,9,4,13,10,7$ $9,5,10,6,7,1$ $10,9,6,7,5,13$ $9,5,13,6,10,14$
Consider a $\textit{dynamic}$ hashing approach for $4$-bit integer keys:There is a main hash table of size $4$.The $2$ least significant bits of a key is used to index in...
7.7k
views
commented
Aug 25, 2022
Algorithms
gatecse-2021-set1
multiple-selects
algorithms
hashing
2-marks
+
–
5
answers
2
GATE CSE 2021 Set 1 | Question: 43
A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$. Which of the following options is/are correct? If a relation $S$ is reflexive and symmetric, then $S$ is an equivalence relation ... and circular, then $S$ is an equivalence relation. If a relation $S$ is transitive and circular, then $S$ is an equivalence relation.
A relation $R$ is said to be circular if $a\text{R}b$ and $b\text{R}c$ together imply $c\text{R}a$.Which of the following options is/are correct?If a relation $S$ is refl...
8.0k
views
commented
Feb 23, 2021
Set Theory & Algebra
gatecse-2021-set1
multiple-selects
set-theory&algebra
relations
2-marks
+
–
3
answers
3
NIELIT 2016 DEC Scientist B (CS) - Section B: 23
A nonpipeline system taken $50ns$ to process a task. The same task can be processed in a six-segment pipeline with a clock cycle of $10ns.$ Determinant the speedup ration of the pipeline for $100$ tasks. What is the maximum speedup that can be achieved? $4.90,5$ $4.76,5$ $3.90,5$ $4.30,5$
A nonpipeline system taken $50ns$ to process a task. The same task can be processed in a six-segment pipeline with a clock cycle of $10ns.$ Determinant the speedup ration...
2.2k
views
commented
Feb 23, 2021
CO and Architecture
nielit2016dec-scientistb-cs
co-and-architecture
pipelining
speedup
+
–
2
answers
4
NIELIT 2017 OCT Scientific Assistant A (IT) - Section B: 18
A pipeline is having speed up factor as $10$ and operating with efficiency of $80\%.$ What will be the number of stages in the pipeline? $10$ $8$ $13$ None
A pipeline is having speed up factor as $10$ and operating with efficiency of $80\%.$ What will be the number of stages in the pipeline?$10$$8$$13$None
949
views
commented
Feb 23, 2021
CO and Architecture
nielit2017oct-assistanta-it
co-and-architecture
pipelining
+
–
1
answer
5
UGC NET CSE | October 2020 | Part 2 | Question: 43
Which of the following statements with respect to $\text{K}$-segment pipelining are true? Maximum speedup that a pipeline can provide is $k$ theoretically It is impossible to achieve maximum speed up $k$ in $k$-segment pipeline All segments in pipeline take same time in ... $\text{(i)}$ and $\text{(iii)}$ only $\text{(i), (ii)}$ and $\text{(iii)}$
Which of the following statements with respect to $\text{K}$-segment pipelining are true?Maximum speedup that a pipeline can provide is $k$ theoreticallyIt is impossible ...
1.3k
views
commented
Feb 23, 2021
CO and Architecture
ugcnetcse-oct2020-paper2
co-and-architecture
pipelining
+
–
2
answers
6
UGC NET CSE | October 2020 | Part 2 | Question: 7
A non-pipeline system takes $50$ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of $10$ns. Determine approximately the speedup ratio of the pipeline for $500$ tasks. $6$ $4.95$ $5.7$ $5.5$
A non-pipeline system takes $50$ns to process a task. The same task can be processed in six-segment pipeline with a clockcycle of $10$ns. Determine approximately the spee...
2.1k
views
commented
Feb 23, 2021
CO and Architecture
ugcnetcse-oct2020-paper2
co-and-architecture
pipelining
+
–
3
answers
7
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
+
–
2
answers
8
UGC NET CSE | June 2019 | Part 2 | Question: 6
Which of the following is principal conjunctive normal form for $[(p\vee q)\wedge\ \neg p \rightarrow \neg q ]$ ? $p\ \vee \neg q$ $p \vee q $ $\neg p \vee q$ $\neg p\ \vee \neg q$
Which of the following is principal conjunctive normal form for $[(p\vee q)\wedge\ \neg p \rightarrow \neg q ]$ ?$p\ \vee \neg q$$p \vee q $$\neg p \vee q$$\neg p\ \vee ...
7.6k
views
commented
Feb 20, 2021
Mathematical Logic
ugcnetcse-june2019-paper2
propositional-logic
+
–
6
answers
9
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
+
–
4
answers
10
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
+
–
3
answers
11
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
+
–
3
answers
12
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
+
–
5
answers
13
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
+
–
2
answers
14
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
+
–
4
answers
15
Fork (ACE)
main() { if(fork()>=0) { printf("*"); if(fork()==0) { printf("*"); } else{ //do nothing } printf("*"); } How many number of times “*” will be printed?
main() { if(fork()>=0) { printf("*"); if(fork()==0) { printf("*"); } else{ //do nothing } printf("*"); }How many number of times “*” will be printed?
3.3k
views
commented
Feb 19, 2021
Operating System
fork-system-call
operating-system
+
–
3
answers
16
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
+
–
2
answers
17
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
+
–
1
answer
18
Self Doubt in Disk Scheduling
I am presenting here 2 doubts in the form of questions.Plz give proper explanation to these : Q1 : Out of the available disk scheduling algorithms , which can be considered as the best and most practical? Q2 : In CSCAN or CLOOK , we consider ... for those requests which are on the opposite side w.r.t. initial direction of head movement and hence not yet serviced ?
I am presenting here 2 doubts in the form of questions.Plz give proper explanation to these :Q1 : Out of the available disk scheduling algorithms , which can be considere...
948
views
commented
Feb 10, 2021
Operating System
operating-system
disk-scheduling
+
–
3
answers
19
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
+
–
6
answers
20
UGC NET CSE | January 2017 | Part 3 | Question: 50
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cylinder $23$ and moving in the direction of decreasing number of ... in the disk is $150$. The disk head movement using SCAN -scheduling algorithm is: $172$ $173$ $227$ $228$
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cyli...
4.6k
views
commented
Feb 10, 2021
Operating System
ugcnetcse-jan2017-paper3
operating-system
disk-scheduling
+
–
3
answers
21
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
+
–
2
answers
22
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
+
–
3
answers
23
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
+
–
3
answers
24
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
+
–
4
answers
25
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
+
–
1
answer
26
nptel assignment
is given ans correct ?
is given ans correct ?
996
views
commented
Feb 6, 2021
4
answers
27
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
+
–
5
answers
28
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
+
–
2
answers
29
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
+
–
3
answers
30
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
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register