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
Answers by lalitver10
1
votes
1
#graph #degreeofgraph
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
Every simple, undirected, connected and acyclic graph with 50 vertices has at least two vertices of degree one.
464
views
answered
Apr 14, 2023
IS&Software Engineering
graph-theory
+
–
0
votes
2
Database ER model
An ER diagram is having two strong entities E1 and E2. The relationship between the entities ‘R’ is having partial participation from E1 side and total participation from E2 side with 1:1 cardinality. The entities E1 and E2 are having one multivalued attribute each. How many numbers of relations are required to represent the ER model into the relational model?
An ER diagram is having two strong entities E1 and E2. The relationship between the entities ‘R’ is having partial participation from E1 side and total participation ...
979
views
answered
Apr 13, 2023
Databases
databases
er-diagram
relational-model
+
–
0
votes
3
Routers and bridges
Can we connect LAN and WAN using bridges?? What is the problem, i think there is no problem except expansion of broadcast domain..
Can we connect LAN and WAN using bridges??What is the problem, i think there is no problem except expansion of broadcast domain..
278
views
answered
Oct 31, 2022
Computer Networks
computer-networks
routers-bridge-hubs-switches
+
–
1
votes
4
Doubt.
How pipelining process occurs in SR protocol? will it minimize the Tt time?
How pipelining process occurs in SR protocol? will it minimize the Tt time?
335
views
answered
Sep 29, 2022
Computer Networks
computer-networks
pipelining
+
–
0
votes
5
igate test series
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Execution state for addition take 1 clock, multiplication take 3 clock cycles and division take 5 clock cycles. Assume pipeline ... wrong. approch totel 200 in which (100 add having 1 cc) +(25*5-1) +(75*(3-1))=354
The instruction pipeline of RISC processor has 200 instruction in which 100 are performing addition, 25 performing division and 75 are performing multiplication, where Ex...
487
views
answered
Sep 29, 2022
CO and Architecture
co-and-architecture
pipelining
numerical-answers
i-gate-test-series
+
–
0
votes
6
https://www.indiabix.com/networking/subnetting/004004
Using the following illustration, what would be the IP address of E0 if you were using the eighth subnet? The network ID is 192.168.10.0/28 and you need to use the last available IP address in the range. The zero subnet should not be considered valid for ... 192.168.10.142 B. 192.168.10.66 C. 192.168.100.254 D. 192.168.10.143 E. 192.168.10.126
Using the following illustration, what would be the IP address of E0 if you were using the eighth subnet? The network ID is 192.168.10.0/28 and you need to use the last a...
733
views
answered
Sep 21, 2022
Computer Networks
subnetting
+
–
0
votes
7
University Assignment
Question → Consider a system in which bus cycles take 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice-versa, takes 250 ns. One of the I/O devices has a data transfer rate of 50 KB/s and employs DMA. ... For how long would the device tie up the bus when transferring a block of 128 bytes? b)Repeat the calculation for cycle-stealing mode
Question → Consider a system in which bus cycles take 500 ns. Transfer of bus control in either direction, from processor to I/O device or vice-versa, takes 250 ns. One...
731
views
answered
Sep 19, 2022
CO and Architecture
computer-peripherals
dma
moderate
+
–
0
votes
8
In Go-back-N protocol with m=6, the sending machine is in the ready state with Sf=10 and Sn=15, An ACK with ACKNo =13 arrives, what are the next values of Sf, Sn and Rn?
1.3k
views
answered
Sep 16, 2022
Computer Networks
go-back-n
+
–
0
votes
9
database system concepts, self doubt
select all the right options $\forall_{t_1, \;t_2 \;\in \;r(R)}\big[(t_1(\alpha)=t_2(\alpha))\; \rightarrow (t_1(\beta)=t_2(\beta))\big]$ implies that there is $\alpha \rightarrow \beta$ ... functional dependencies should be possible on individual decomposed relations or when they joined. BCNF decomposition of a relation is default lossless decomposition.
select all the right options$\forall_{t_1, \;t_2 \;\in \;r(R)}\big[(t_1(\alpha)=t_2(\alpha))\; \rightarrow (t_1(\beta)=t_2(\beta))\big]$ implies that there is $\alpha \ri...
280
views
answered
Sep 16, 2022
Databases
databases
database-normalization
+
–
2
votes
10
Self Doubt
What is the difference between Node-to-node delivery, Host-to-host delivery & Process-to-process delivery?
What is the difference between Node-to-node delivery, Host-to-host delivery & Process-to-process delivery?
857
views
answered
Sep 15, 2022
Computer Networks
computer-networks
self-doubt
data-link-layer
network-layer
transport-layer
+
–
0
votes
11
#Exam
Pipe line consists of 5 stages , add instruction takes 2 cycles in EX stage, mul instruction takes 3 cycles in EX stage .. If we don't use buffer in between stages(no store and forward) , what is the time taken to execute two instruction add,mul???
Pipe line consists of 5 stages , add instruction takes 2 cycles in EX stage, mul instruction takes 3 cycles in EX stage .. If we don't use buffer in between stages(no sto...
436
views
answered
Sep 14, 2022
CO and Architecture
co-and-architecture
pipelining
instruction-execution
numerical-answers
+
–
0
votes
12
Extern in C programming
int main() { extern int a = 20; printf("%d",a); } //why this gives error but followig code is not extern int a =20; int main() { printf("%d",a); } //why this happens that first code gives error but second is not ? //please tell i am realy confused now
int main(){extern int a = 20;printf("%d",a); }//why this gives error but followig code is not extern int a =20;int main(){printf("%d",a); } //why this happens that first ...
1.1k
views
answered
Jun 2, 2022
Programming in C
algorithms
programming-in-c
+
–
0
votes
13
Can anyone explain the conclusion of the outputs ?
int main() { int x=5,*p; p=&x; *p=x++ + *p; printf ("%d %d",x,*p); } We have this program now here *p= 5++ + (*p) -> *p= 5 + 5 =10 so x location is 10 and then the postfix x++= 10+1=11 so output is 11 11 ... 5 , Here x is not incrementing later . *p= x++ + 5; *p= 5+5=10 output 10 10 , when x is not taking the postfix increment ???
int main(){ int x=5,*p; p=&x; *p=x++ + *p; printf ("%d %d",x,*p);}We have this programnowhere *p= 5++ + (*p) - *p= 5 + 5 =10 so x location is 10and then the pos...
549
views
answered
Jun 2, 2022
Programming in C
programming-in-c
output
+
–
1
votes
14
for above c code fragment , answer would be ?
char c1 = -128 , c2 c3; c2=c1+10; c3=c1-10; printf(c3); (ANS=> c3=+118 why???????)
char c1 = -128 , c2 c3;c2=c1+10; c3=c1-10;printf(c3);(ANS= c3=+118 why???????)
529
views
answered
May 3, 2022
Programming in C
programming-in-c
+
–
0
votes
15
ER Diagram: What is the cardinality of this relationship? is m-n cardinality correct? if not, why?
What is the cardinality of this relationship? is m-n cardinality correct? if not, why?
What is the cardinality of this relationship? is m-n cardinality correct? if not, why?
1.4k
views
answered
Apr 25, 2022
Databases
er-diagram
cardinality
+
–
2
votes
16
Applied Test Series
A computer system has a page size of 1024 bytes and maintains the page table for each process in main memory. The overhead required for doing a lookup in the page table is 500 ns. To reduce this overhead, the computer has a TLB that ... frame mappings. A TLB lookup requires 100ns. Which TLB hit-rate will ensure an average virtual address translation time of exactly 200ns?
A computer system has a page size of 1024 bytes and maintains the page table for each process in main memory. The overhead required for doing a lookup in the page table i...
855
views
answered
Jan 11, 2022
Operating System
test-series
operating-system
paging
translation-lookaside-buffer
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register