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
Recent activity by DAWID15
0
answers
1
MADEEASY
Why B is wrong?
Why B is wrong?
422
views
commented
Feb 1, 2023
Computer Networks
computer-networks
subnetting
made-easy-test-series
+
–
1
answer
2
OS
By default the memory address starts with 0. But they have considered from 1. What should I consider when nothing is mentioned?
By default the memory address starts with 0. But they have considered from 1.What should I consider when nothing is mentioned?
482
views
commented
Jan 23, 2023
Operating System
operating-system
virtual-memory
made-easy-test-series
+
–
1
answer
3
ZEAL SERIES
What should be the answer?
What should be the answer?
498
views
commented
Jan 22, 2023
Programming in C
programming-in-c
zeal
+
–
2
answers
4
Every Regular language has an equivalent NFA ?? True/False
542
views
answered
Jan 9, 2023
Theory of Computation
theory-of-computation
regular-language
+
–
1
answer
5
ZEAL TEST
Isn’t the “No of independent rows”= RAnk of matrix?
Isn’t the “No of independent rows”= RAnk of matrix?
632
views
commented
Jan 8, 2023
Linear Algebra
zeal
+
–
0
answers
6
Gate 2015
For problems where the options are not given, like this kinda questions should I consider hierarchical access or simultaneous access. I know that hierarchical access is commonly used so it should be preferred but the solution for this is described using simultaneous access.
For problems where the options are not given, like this kinda questions should I consider hierarchical access or simultaneous access. I know that hierarchical access is c...
352
views
asked
Jan 3, 2023
CO and Architecture
virtual-memory
numerical-answers
+
–
1
answer
7
PERSONAL DOUBT [PIPELINING]
So I know pipelining has 5 stages: IF, ID, EX, MA, WB. Now the question is if I have a program of few instruction which has both ALU operation and LOAD/store operation in any sequence. So tell me among the 5 stages how many stages will be reqiured for ALU and how many for LOAD/STORE.
So I know pipelining has 5 stages: IF, ID, EX, MA, WB.Now the question is if I have a program of few instruction which has both ALU operation and LOAD/store operation in ...
387
views
commented
Dec 29, 2022
CO and Architecture
co-and-architecture
pipelining
+
–
1
answer
8
ZEAL TESTSERIES
Options: 10, 12,14, 16, 18, 20 20, 18, 16, 14, 12, 10 12, 10, 16, 14, 20, 18 NONE
Options:10, 12,14, 16, 18, 2020, 18, 16, 14, 12, 1012, 10, 16, 14, 20, 18NONE
525
views
answer selected
Dec 23, 2022
DS
test-series
zeal
+
–
2
answers
9
Zeal Testseries
I’m getting 2 as the answer, but the correct one given by them is 5. Somebody please confirm.
I’m getting 2 as the answer, but the correct one given by them is 5.Somebody please confirm.
760
views
retagged
Dec 20, 2022
Operating System
zeal
test-series
operating-system
resource-allocation
+
–
3
answers
10
Kernal level vs User level thread
Consider two processes X having P threads and Y having Q threads with equal time slices respectively.Threads are mixed with user level threads (ULT) and kernel level threads (KLT) with P > Q. Now consider the following statements I) If all threads are user level threads ... . III only 2. II and III only 3. I and II only 4.I, II and III How statement-1 Is true??
Consider two processes X having P threads and Y having Q threads with equal time slices respectively.Threads are mixed with user level threads (ULT) and kernel level thre...
1.2k
views
commented
Dec 19, 2022
Operating System
operating-system
threads
+
–
1
answer
11
Process state
A printf or malloc takes the process to what state? Running Ready Suspended Terminated
A printf or malloc takes the process to what state?RunningReadySuspendedTerminated
394
views
commented
Dec 19, 2022
Operating System
operating-system
process
+
–
1
answer
12
MADEEASY TESTSERIES
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be made into zero. SO am I wrong or the explanation is wrong?
To justify the OPTION B they gave an example of 2*2 matrix. However we can see that row 2 is linearly dependent on row1. Even though the 2nd row looks non-zero it can be ...
672
views
commented
Dec 11, 2022
Linear Algebra
made-easy-test-series
matrix
linear-algebra
+
–
2
answers
13
Made easy || Operating system
While of the following is incorrect? (a) if a system uses preemptive CPU scheduler then deadlock is not possible in system (b) Deadlock state is an unsafe state. (c) If a system has total ordering of all resource types ... disabled) therefore deadlock should not possible in preemptive scheduling then how can this statement could be incorrect. please clarify the doubt
While of the following is incorrect?(a) if a system uses preemptive CPU scheduler then deadlock is not possible in system(b) Deadlock state is an unsafe state.(c) If a sy...
1.3k
views
commented
Nov 18, 2022
Operating System
operating-system
made-easy-test-series
deadlock-prevention-avoidance-detection
+
–
2
answers
14
NIELIT STA 2021
The addressing mode / s, which uses the PC instead of a general-purpose register is: Indexed with offset Relative Direct Both Indexed with offset and direct
The addressing mode / s, which uses the PC instead of a general-purpose register is: Indexed with offset RelativeDirectBoth Indexed with offset and direct
1.6k
views
answered
Oct 19, 2022
CO and Architecture
co-and-architecture
addressing-modes
+
–
2
answers
15
Graph Coloring
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ? There is a condition that adjacent vertices should not be of the same color I am getting $1680$. Is it correct?
How many ways are there to color this graph from any $4$ of the following colors : Violet, Indigo, Blue, Green, Yellow, Orange and Red ?There is a condition that adjacent...
2.6k
views
answered
Oct 13, 2022
Graph Theory
graph-theory
graph-coloring
combinatory
+
–
9
answers
16
GATE CSE 2015 Set 2 | Question: 52
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data up to $1500\text{ bytes (i.e. MTU = 1500 bytes)}.$ Size of $\text{UDP}$ ... be the contents of offset field in the last fragment? $6$ and $925$ $6$ and $7400$ $7$ and $1110$ $7$ and $8880$
$\text{Host A}$ sends a $\text{UDP}$ datagram containing $8880\text{ bytes}$ of user data to $\text{host B}$ over an $\text{Ethernet LAN}.$ Ethernet frames may carry data...
25.6k
views
commented
Oct 7, 2022
Computer Networks
gatecse-2015-set2
computer-networks
ip-packet
normal
+
–
1
answer
17
SELF DOUBT
consider a system of linear equation where AMxN XNx1 =BMx1 TRUE OR FALSE Q1 IF B=0 AND DETERMINENT OF A i.e |A| IS NOT EQUAL TO ZERO THEN IT MEANS UNIQUE SOLUTION?? Q2 IF B NOT EQUAL TO 0 AND DETERMINENT OF A i.e |A| IS NOT EQUAL TO ZERO THEN IT MEANS INFINITE MANY SOLUTION SOLUTION?? Q3 IF B IS NOT EQUAL TO 0 AND M<N THEN IT MEANS NO UNIQUE SOLUTION??
consider a system of linear equation where AMxN XNx1 =BMx1TRUE OR FALSEQ1 IF B=0 AND DETERMINENT OF A i.e |A| IS NOT EQUAL TO ZERO THEN IT MEANS UNIQUE SOLUTION??Q2 IF ...
539
views
comment edited
Oct 1, 2022
Linear Algebra
system-of-equations
+
–
3
answers
18
Made Easy Test Series:Data Structure-Stack
There is given a infix expression: ${\color{Red} {1}}$ $A+B\times C/\left ( \left ( D+E \right )+F\times G \right )$ While converting infix expression to postfix expression number of symbols in the stack at indicated ... $5$, but is it correct? Can anyone give some explanation??
There is given a infix expression: ${\color{Red} {1}}$$A+B\times C/\left ( \left ( D+E \right )+F\times G \rig...
1.1k
views
answered
Sep 13, 2022
DS
made-easy-test-series
data-structures
stack
+
–
1
answer
19
Discrete Mathematics
Somebody please clarify the answer
Somebody please clarify the answer
571
views
commented
Aug 18, 2022
Combinatory
combinatory
ace-test-series
+
–
2
answers
20
the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables: S1 = 3, S2 = 2, S3 = 1; P(S1); P(S2); P(S3); Critical Section V(S3); V(S2); V(S1); Does it satisfy mutual exclusion, progress and bounded waiting?
Consider the following synchronization construct used by the processes P1, P2, and P3. The S1, S2 and S3 are counting semaphore variables:S1 = 3, S2 = 2, S3 = 1;P(S1);P(S...
4.9k
views
commented
Aug 15, 2022
Operating System
made-easy-test-series
semaphore
operating-system
+
–
4
answers
21
ISRO2020-57
The hardware implementation which provides mutual exclusion is Semaphores Test and set instructions Both options None of the options
The hardware implementation which provides mutual exclusion isSemaphoresTest and set instructionsBoth optionsNone of the options
5.2k
views
comment edited
Aug 15, 2022
Operating System
isro-2020
operating-system
semaphore
mutual-exclusion
normal
+
–
2
answers
22
GATE CSE 2021 Set 2 | Question: 14
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling? Turnaround time includes waiting time The goal is to only maximize $\text{CPU}$ utilization and minimize throughput Round-robin policy ... $\text{CPU}$ time required by each of the processes is not known apriori Implementing preemptive scheduling needs hardware support
Which of the following statement(s) is/are correct in the context of $\text{CPU}$ scheduling?Turnaround time includes waiting timeThe goal is to only maximize $\text{CPU}...
10.6k
views
comment edited
Aug 2, 2022
Operating System
gatecse-2021-set2
multiple-selects
operating-system
process-scheduling
1-mark
+
–
8
answers
23
GATE CSE 1997 | Question: 6.4
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring? $0^*(1+0)^*$ $0^*1010^*$ $0^*1^*01^*$ $0^*(10+1)^*$
Which one of the following regular expressions over $\{0,1\}$ denotes the set of all strings not containing $\text{100}$ as substring?$0^*(1+0)^*$$0^*1010^*$$0^*1^*01^*$$...
37.5k
views
commented
Aug 2, 2022
Theory of Computation
gate1997
theory-of-computation
regular-expression
normal
+
–
2
answers
24
Self Doubt
How many cycle required when pipelining and operand loading is used? R1<-R2+R3 R4<-R1+M[100] Value at M[100]=7 There are 5 phases: F->TO FETCH D->TO DECODE AND OPERAND READ E->EXECUTE M->MEMORY ACCESS W->WRITE BACK Each phase takes 1Cycle .
How many cycle required when pipelining and operand loading is used?R1<-R2+R3R4<-R1+M[100]Value at M[100]=7There are 5 phases:F->TO FETCHD->TO DECODE AND OPERAND READE->...
628
views
commented
Feb 1, 2022
CO and Architecture
co-and-architecture
pipelining
operand-forwarding
+
–
5
answers
25
NIELIT 2017 DEC Scientist B - Section B: 48
On a set $A = \{a,b,c,d\}$ a binary operation $*$ ... The relation is Commutative but not associative Neither commutative nor associative Both commutative and associative Associative but not commutative
On a set $A = \{a,b,c,d\}$ a binary operation $*$ is defined as given in the following table.$$\begin{array}{|c|cccc|}\hline\text{*}&a&b&c&d\\\hline \text{a}&a&c&b&d\\\te...
1.8k
views
answered
Jan 30, 2022
Set Theory & Algebra
nielit2017dec-scientistb
discrete-mathematics
group-theory
abelian-group
+
–
1
answer
26
Dynamic programming
My answer came out to be 13: because when we will compute T(13) { as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as it will store it and reuse it) so the stack size will be 1 (for T(13))+11 (for T(12),T(11),…...T(2)) = 12…...(48/4) } will any one help me out
My answer came out to be 13:because when we will compute T(13){as we are using Dynamic programming , it will have to compute value of T(12),T(11),…...T(2) only once(as ...
736
views
answered
Jan 24, 2022
Algorithms
algorithms
dynamic-programming
programming
test-series
+
–
1
answer
27
Conflict serialziability
How the option c is correct for the given schedules?
How the option c is correct for the given schedules?
270
views
answered
Jan 22, 2022
Databases
transaction-and-concurrency
+
–
2
answers
28
DBMS Korth Edition 4 Exercise 16 Question 27 (Page No. 635)
Explain the phantom phenomenon. Why may this phenomenon lead to an incorrect concurrent execution despite the use of the two-phase locking protocol ?
Explain the phantom phenomenon. Why may this phenomenon lead to an incorrect concurrent execution despite the use of the two-phase locking protocol ?
654
views
answered
Jan 21, 2022
Databases
korth
databases
transaction-and-concurrency
descriptive
+
–
1
answer
29
NIELIT 2017 OCT Scientific Assistant A (CS) - Section B: 34
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It will result in deadlock situation immediately be granted immediately be rejected be granted as soon as it is released by $A$
Assume transaction $A$ holds a shared lock $R.$ If transaction $B$ also requests for a shared lock on $R.$ It willresult in deadlock situationimmediately be grantedimmedi...
1.8k
views
commented
Jan 21, 2022
Databases
nielit2017oct-assistanta-cs
databases
transaction-and-concurrency
deadlock-prevention-avoidance-detection
+
–
3
answers
30
Are all Irrecoverable/Non-Recoverable schedules cascading?
Suppose, T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: Abort Here we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it cascading?
Suppose,T1: W(X), T2: R(X), T1: W(X), T2: Commit, T1: AbortHere we can see T2 is getting committed before T1 aborts, so it is clearly an Irrecoverable schedule but is it ...
738
views
answered
Jan 21, 2022
Databases
databases
transaction-and-concurrency
data
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register