Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
shaktisingh
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by shaktisingh
0
votes
1
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Jan 25, 2020
Databases
er-diagram
databases
er-to-relational
relational
+
–
0
votes
2
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Jan 25, 2020
Databases
er-diagram
databases
er-to-relational
relational
+
–
0
votes
3
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Jan 25, 2020
Databases
er-diagram
databases
er-to-relational
relational
+
–
0
votes
4
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
8.6k
views
answered
Jan 25, 2020
Databases
er-diagram
databases
er-to-relational
relational
+
–
1
votes
5
GATE CSE 1992 | Question: 01-vi
In an $11$-bit computer instruction format, the size of address field is $4$-bits. The computer uses expanding OP code technique and has $5$ two-address instructions and $32$ one-address instructions. The number of zero-address instructions it can support is ________
In an $11$-bit computer instruction format, the size of address field is $4$-bits. The computer uses expanding OP code technique and has $5$ two-address instructions and ...
13.1k
views
answered
Jan 23, 2020
CO and Architecture
gate1992
co-and-architecture
machine-instruction
instruction-format
normal
numerical-answers
+
–
2
votes
6
Test by Bikram | Computer Organization and Architecture | Test 1 | Question: 9
A byte-addressable computer has a small data cache capable of holding eight $32$-bit words. Each cache block consists of one $32$-bit word. When a given program is executed, the processor reads data from the following ... cache is initially empty. If a direct-mapped cache is used, then the hit rate is __________ $\%$
A byte-addressable computer has a small data cache capable of holding eight $32$-bit words. Each cache block consists of one $32$-bit word. When a given program is execut...
814
views
answered
Jan 18, 2020
CO and Architecture
tbb-coa-1
co-and-architecture
numerical-answers
+
–
0
votes
7
UGC NET CSE | December 2019 | Part 2 | Question: 21
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$ and $R2$ i.e. $R1 * R2$? ($*$- Natural Join) $30$ $20$ $50$ $1500$
Given two tables $R1(x,y)$ and $R2(y,z)$ with $50$ and $30$ number of tuples respectively. Find maximum number of tuples in the output of natural join between tables $R1$...
1.6k
views
answered
Dec 26, 2019
Others
ugcnetcse-dec2019-paper2
+
–
0
votes
8
LSP Packets
Which of the following is true about link state routing ? A) LSP Packets contains information of the network. B) LSP Packets are forwarded using flooding algorithm. C) Routers in the network converted into tree before forwarding LSP Packet. D) All ... but partially according to me as each LSP packet contains distances only not all network information such as topology etc. explain pls.
Which of the following is true about link state routing ?A) LSP Packets contains information of the network.B) LSP Packets are forwarded using flooding algorithm.C) Route...
2.9k
views
answered
Nov 30, 2019
Computer Networks
computer-networks
link-state-routing
+
–
1
votes
9
Computer Network
The following character encoding is used in a data link protocol: $A: 01000111$ $B: 11100011$ $FLAG: 01111110$ $ESC: 11100000$ Show the bit sequence transmitted (in binary) for the four-character frame A B ESC FLAG when each of the following framing methods is used: (a) Byte count. (b) Flag bytes with byte stuffing. (c) Starting and ending flag bytes with bit stuffing.
The following character encoding is used in a data link protocol:$A: 01000111$ $B: 11100011$ $FLAG: 01111110$ $ESC: 11100000$Show the bit sequence transmitted (in binary)...
6.4k
views
answered
Nov 25, 2019
Computer Networks
framming
+
–
2
votes
10
Let a cluster of stations share 48 Kbps of pure Aloha channel. Every station outputs frames of length 1024 bits on an average of every 50 seconds. Then what is the maximum value of number of stations?
6.0k
views
answered
Nov 24, 2019
Computer Networks
pure-aloha
+
–
0
votes
11
GATE Overflow | Digital Logic | Test 1 | Question: 9
Reduce this Boolean Expression to one literal $\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$ $W$ $Z$ $X$ $Y$
Reduce this Boolean Expression to one literal$$\bar W X( \bar Z +\bar YZ ) + X( W+\bar WYZ)$$$W$$Z$$X$$Y$
380
views
answered
Nov 22, 2019
Digital Logic
digital-logic
go-digital-logic-1
boolean-algebra
+
–
2
votes
12
GATE CSE 1992 | Question: 02-ii
All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
All digital circuits can be realized using onlyEx-OR gatesMultiplexersHalf addersOR gates
10.4k
views
answered
Nov 21, 2019
Digital Logic
gate1992
normal
digital-logic
digital-circuits
multiple-selects
functional-completeness
combinational-circuit
+
–
1
votes
13
Test by Bikram | Compiler Design | Test 1 | Question: 25
Consider the following grammar: $S \rightarrow aMd \mid bNd \mid aNe \mid bMe$ $M \rightarrow c$ $N \rightarrow c$ The grammar above is: LR(1) but not LALR(1) LALR(1) but not SLR(1) SLR(1) but not LR(1) LALR(1)
Consider the following grammar:$S \rightarrow aMd \mid bNd \mid aNe \mid bMe$$M \rightarrow c$$N \rightarrow c$The grammar above is:LR(1) but not LALR(1)LALR(1) but no...
500
views
answered
Nov 18, 2019
Compiler Design
tbb-cd-1
compiler-design
grammar
+
–
0
votes
14
Zeal Test Series 2018: Compiler Design - Runtime Environments
The two basic operations that are often performed with the symbol table are: 1. Set and reset 2. Set and insert 3. Insert and lookup 4. Reset and lookup
The two basic operations that are often performed with the symbol table are:1.Set and reset 2.Set and insert 3. Insert and lookup 4.Reset and lookup
1.6k
views
answered
Nov 11, 2019
Compiler Design
compiler-design
runtime-environment
zeal
zeal2018
+
–
16
votes
15
GATE CSE 2006 | Question: 73
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding sets intersect in exactly two elements. The number of connected components in $G$ is: $n$ $n + 2$ $2^{\frac{n}{2}}$ $\frac{2^{n}}{n}$
The $2^n$ vertices of a graph $G$ corresponds to all subsets of a set of size $n$, for $n \geq 6$. Two vertices of $G$ are adjacent if and only if the corresponding set...
8.6k
views
answered
Oct 22, 2019
Graph Theory
gatecse-2006
graph-theory
normal
graph-connectivity
+
–
0
votes
16
Where to scan the barcode given in GateOverflow book
1.0k
views
answered
Oct 3, 2019
2
votes
17
#OS Fork () tell the O/P?
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); fork (); The number of new processes created is
A process executes the following segment of code :for(i = 1; i <= n; i++) fork (); fork ();The number of new processes created is
1.9k
views
answered
Jun 30, 2019
Operating System
fork-system-call
operating-system
+
–
1
votes
18
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
answered
Jun 30, 2019
Operating System
fork-system-call
operating-system
+
–
1
votes
19
fork and exec
what is the output of the following program? int ret = fork(); if(ret == 0) { exec(some_binary); // this call fails printf("child "); }else { wait(); printf("parent\n"); } Runtime Error child parent child parent
what is the output of the following program?int ret = fork(); if(ret == 0) { exec(some_binary); // this call fails printf("child "); }else { wait(); printf("parent\n"); }...
818
views
answered
Jun 30, 2019
Operating System
fork-system-call
operating-system
+
–
0
votes
20
TIFR CSE 2019 | Part B | Question: 13
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a red or a blue house must be green. How many ways are there to paint the houses? $199$ $683$ $1365$ $3^{10}-2^{10}$ $3^{10}$
A row of $10$ houses has to be painted using the colours red, blue, and green so that each house is a single colour, and any house that is immediately to the right of a r...
4.8k
views
answered
Jun 8, 2019
Combinatory
tifr2019
combinatory
counting
+
–
1
votes
21
C Program Output and Explaination
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
void fun(int *p) { int q = 10; p = &q; z } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
1.5k
views
answered
May 30, 2019
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register