Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
afroze
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by afroze
2
answers
1
Made easy Test Series 2022
I am getting ans 6 and given ans is 8
I am getting ans 6 and given ans is 8
499
views
commented
Nov 20, 2022
Databases
relational-model
made-easy-test-series
+
–
0
answers
2
The total number of keys required for a set of n individuals to be able to communicate with each other using secret key and public key crypto-systems, respectively are: (A) n(n-1) and 2n (B) 2n and ((n(n – 1))/2) (C) ((n(n – 1))/2) and 2n (D) ((n(n – 1))/2) and n
429
views
commented
Nov 18, 2022
Computer Networks
computer-networks
network-security
normal
+
–
1
answer
3
graph theory ,discrete math
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
how many subgraph with atleast 1 vertex does k2 have? (graph theory question)
391
views
commented
Nov 18, 2022
Mathematical Logic
discrete-mathematics
graph-theory
+
–
1
answer
4
Token bucket
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 10 megabyte and the maximum output rate is 20 megabytes per second. Tokens arrive at a rate to sustain output at a rate of 10 megabytes per second. ... megabytes So it will take 100megabytes/10 MBps = 10 sec So total time = 1 + 10 = 11 seconds Please verify my solution
For a host machine that uses the token bucket algorithm for congestion control, the token bucket has a capacity of 10 megabyte and the maximum output rate is 20 megabytes...
1.3k
views
commented
Nov 7, 2022
Computer Networks
computer-networks
token-bucket
made-easy-test-series
+
–
2
answers
5
Analysis of algorithms
Is ln(n!)=theta(n ln(n))?
Is ln(n!)=theta(n ln(n))?
373
views
answered
Nov 3, 2022
Algorithms
algorithms
asymptotic-notation
+
–
1
answer
6
ME Test series question
A computer uses two level cache L1 and L2 and in 2000 memory references there are 320 misses in L1 cache and 150 misses in L2lcache. If the miss penalty of L2 is 300 clock cycles, hit time of L1 is 1 clock cycle and hit time of L2 is 10 clock cycles what is the average memory access time?
A computer uses two level cache L1 and L2 and in 2000 memory references there are 320 misses in L1 cache and 150 misses in L2lcache. If the miss penalty of L2 is 300 cloc...
338
views
commented
Nov 1, 2022
CO and Architecture
co-and-architecture
cache-memory
+
–
1
answer
7
ISI 2021 | PCB CS | Question: 7.b
Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The following memory block requests arrive in order when ... . Show the cache configuration (along with intermediate configurations) on meeting the above memory requirements. What is the hit ratio?
Consider a $4$-way set associative cache mapping, in which the cache blocks are grouped into sets and each set has $4$ blocks. There are $16$ cache blocks in total. The f...
733
views
commented
Oct 31, 2022
CO and Architecture
isi2021-pcb-cs
descriptive
co-and-architecture
cache-memory
+
–
0
answers
8
Set Theory
If A = {1, 3,5,7,.......} Then (A, +) is semi group or not. Doubt : a +(b+c) =( a + b) +c So associativity property is present But a + b doesn't belong to A So closure property is not present. So A is semi group or not.
If A = {1, 3,5,7,.......}Then (A, +) is semi group or not. Doubt :a +(b+c) =( a + b) +cSo associativity property is present But a + b doesn't belong to ASo closure prop...
365
views
commented
Oct 25, 2022
Set Theory & Algebra
self-doubt
group-theory
set-theory
+
–
1
answer
9
Process Synchronisation
What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?
What is the significance of infinite loop that is written in every example of process synchronisation? What would happen if there wasn't any infinite loop?
877
views
answered
Oct 24, 2022
Operating System
operating-system
process-synchronization
semaphore
process-scheduling
inter-process-communication
+
–
1
answer
10
UGC NET CSE | October 2022 | Part 1 | Question: 2
Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$ $X$ : List A List B $1$ $111$ $10111$ $10$ $10$ $0$ $Y$: List A List B $10$ $101$ $011$ $11$ $101$ $011$ Which of the following is true? ... solution., PCP in both $\mathrm{X}$ and $\mathrm{Y}$ has solution. PCP neither in $\mathrm{X}$ nor in $\mathrm{Y}$ has solution.,
Consider two lists $\mathrm{A}$ and $\mathrm{B}$ of three strings on $\{0,1\}$$X$ : List AList B$1$$111$$10111$$10$$10$$0$$Y$:List AList B$10$$101$$011$$11$$101$$011$Whic...
982
views
commented
Oct 23, 2022
Others
ugcnetcse-oct2022-paper1
+
–
2
answers
11
UGC NET CSE | October 2022 | Part 1 | Question: 76
Consider the following statements: Statement $\text{I}$: $\text{LALR}$ parser is more powerful than canonical $\text{LR}$ Parser. Statement $\text{II}$: $\text{SLR}$ parser is more powerful than $\text{LALR}$ Which of the following is ... Statement $\text{I}$ and Statement $\text{II}$ false Both Statement $\text{I}$ and Statement $\text{II}$ true
Consider the following statements:Statement $\text{I}$: $\text{LALR}$ parser is more powerful than canonical $\text{LR}$ Parser.Statement $\text{II}$: $\text{SLR}$ parser...
514
views
answer edited
Oct 23, 2022
Others
ugcnetcse-oct2022-paper1
+
–
3
answers
12
The hamming distance between the octets of 0xAA and 0x55 is (A) 7 (B) 5 (C) 8 (D) 6
413
views
commented
Oct 23, 2022
Computer Networks
computer-networks
hamming-code
+
–
0
answers
13
Algorithms
How option B is incorrect.
How option B is incorrect.
398
views
commented
Oct 20, 2022
Algorithms
algorithms
test-series
graph-algorithm
+
–
2
answers
14
ACE 2023 Test series: TOC: Basic properties
658
views
commented
Oct 19, 2022
Theory of Computation
theory-of-computation
regular-expression
closure-property
ace-test-series
+
–
2
answers
15
made easy test series
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will store f(11) in stack. But if we call f(12) we wont be able to store it as overflow will occur.
How is the max possible value of n is 12? We will have to store T(0) and T(1) in stack too, so we can call f(11) at max which will require T(10) and T(9) and then we will...
569
views
commented
Oct 16, 2022
Algorithms
made-easy-test-series
stack
algorithms
dynamic-programming
+
–
2
answers
16
Gateforum Test series
Suppose 2 process P1 and P2 are as follows:
Suppose 2 process P1 and P2 are as follows:
487
views
commented
Oct 16, 2022
Operating System
gateforum-test-series
operating-system
semaphore
+
–
2
answers
17
How to do questions of ToC like finding min. No. Of states , min. No. Of substring etc ?
415
views
answered
Oct 14, 2022
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
1
answer
18
In the network 200.10.11.144/27, the fourth octet (in decimal) of the last IP address of the network which can be assigned to a host is (A) 158 (B) 255 (C) 222 (D) 223
664
views
commented
Oct 9, 2022
2
answers
19
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...
462
views
commented
Sep 29, 2022
CO and Architecture
co-and-architecture
pipelining
numerical-answers
i-gate-test-series
+
–
4
answers
20
Subnetting/Supernetting
In class $B$ if subnet mask is $255.192.0.0$ then the total number of networks that can be joined is: $32$ $64$ $16$ None of the Above
In class $B$ if subnet mask is $255.192.0.0$ then the total number of networks that can be joined is: $32$ $64$ $16$ None of the Above
1.4k
views
commented
Sep 28, 2022
Computer Networks
subnetting
computer-networks
+
–
3
answers
21
unacademy combat
what will be time complexity of this program? void function(int n) { int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { if (j%i == 0) { for (int k=0; k<j; k++) printf("*"); } } } }
what will be time complexity of this program?void function(int n){ int count = 0; for (int i=0; i<n; i++) { for (int j=1; j< i*i; j++) { ...
1.3k
views
comment edited
Sep 27, 2022
Algorithms
algorithms
time-complexity
unacademy-combat
+
–
4
answers
22
GATE CSE 1996 | Question: 2.4
Which one of the following is false? The set of all bijective functions on a finite set forms a group under function composition The set $\{1, 2, \dots p-1\}$ forms a group under multiplication mod $p$, where $p$ is a prime number The set of all strings over a finite ... $\langle G, * \rangle$ if and only if for any pair of elements $a, b \in S, a * b^{-1} \in S$
Which one of the following is false?The set of all bijective functions on a finite set forms a group under function compositionThe set $\{1, 2, \dots p-1\}$ forms a group...
9.5k
views
commented
Sep 23, 2022
Set Theory & Algebra
gate1996
set-theory&algebra
normal
set-theory
group-theory
+
–
2
answers
23
Working Set Model
Consider a system uses working-set model for frame allocations. Working-set window size is 7. Following is sequence of virtual page references: 5, 4, 3, 3, 4, 1, 2, 2, 1, 2, 1, 1, 5, 4, 3, 5 What will be the minimum number of ... think that after executing the above sequence in the beginning the working set will contain only frame 5 so the minimum number of elements will be 1.
Consider a system uses working-set model for frame allocations. Working-set window size is 7. Following is sequence of virtual page references:5, 4, 3, 3, 4, 1, 2, 2, 1, ...
615
views
answer edited
Sep 23, 2022
Operating System
operating-system
working-set
numerical-answers
test-series
+
–
1
answer
24
Self Doubt.
Can anyone please explain this?
Can anyone please explain this?
748
views
commented
Sep 22, 2022
Computer Networks
computer-networks
data-link-layer
network-layering
+
–
3
answers
25
CPU Scheduling
If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?
If we are using non-preemptive CPU scheduling then can there be process state transition from running to ready state?
632
views
answered
Sep 22, 2022
Operating System
process-scheduling
operating-system
+
–
1
answer
26
Ace Book for Discreet Mathematics , Combinatorics.
Number of ways to assign 5 different people in 3 different rooms, so that each room contains at least one person?
Number of ways to assign 5 different people in 3 different rooms, so that each room contains at least one person?
530
views
commented
Sep 22, 2022
Mathematical Logic
combinatory
ace-booklet
+
–
2
answers
27
made easy gate cs question bank
What will be the output printed for find(4)? void find(int x) { static int i = 10, y = 0; y = y + i; for(i; i>0; i = i - 10) { if(x! = 0) find(x – 1); else printf(“%d”, y); } }
What will be the output printed for find(4)? void find(int x) { static int i = 10, y = 0; y = y + i; for(i; i>0; i = i - 10) { if(x! = 0) find(x – 1); else printf(“%d...
474
views
commented
Sep 22, 2022
Programming in C
algorithms
programming-in-c
loop
+
–
1
answer
28
Binary Semaphore
Say there is a Binary semaphore R, initialized to 0. Say process X and Y are working on R. At T1 :- X has performed P(R); X gets blocked and gets added in Process Queue. At T2 :-Y has performed V(R); Will Process X get unblocked and removed from ready queue? Which process will run after Y has performed V(R)? Process Y or Process X?
Say there is a Binary semaphore R, initialized to 0. Say process X and Y are working on R.At T1 :- X has performed P(R); X gets blocked and gets added in Process Queue.At...
503
views
answered
Sep 21, 2022
Operating System
operating-system
binary-semaphore
queue
+
–
2
answers
29
Unacademy test series.
In a stop and wait ARQ, Bandwidth Delay product is 20,000 bits. Given the frame size is 1000 bits. What is the percentage of utilization of link if we have a protocol that can send 15 frames without waiting for acknowledgement?
In a stop and wait ARQ, Bandwidth Delay product is 20,000 bits. Given the frame size is 1000 bits. What is the percentage of utilization of link if we have a protocol tha...
784
views
commented
Sep 21, 2022
Computer Networks
computer-networks
stop-and-wait
unacademy-test-series
+
–
2
answers
30
Engineering mathematics
If A is a non-zero column matrix of order n×1 and B is a non-zero row matrix of order 1×n then rank of AB equals ? Rank(ab) can be zero???
If A is a non-zero column matrix of order n×1 and B is a non-zero row matrix of order 1×n then rank of AB equals ? Rank(ab) can be zero???
542
views
answered
Sep 21, 2022
Linear Algebra
engineering-mathematics
linear-algebra
matrix
self-doubt
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register