Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
BHOJARAM
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by BHOJARAM
1
answer
1
GO Classes Test Series 2024 | Discrete Mathematics | Test 5 | Question: 6
Let $\text{G = (V, E)}$ be a finite directed acyclic graph with $|\text{E}| > 0.$ Which of the following is not necessarily true? $\text{G}$ has a vertex with no incoming edge. $\text{G}$ has a ... no outgoing edge. $\text{G}$ has an isolated vertex, that is, one with neither an incoming edge nor an outgoing edge. None
Let $\text{G = (V, E)}$ be a finite directed acyclic graph with $|\text{E}| 0.$ Which of the following is not necessarily true?$\text{G}$ has a vertex with no incoming e...
564
views
commented
Nov 25, 2022
Graph Theory
goclasses2024-dm-5-weekly-quiz
goclasses
graph-theory
graph-connectivity
1-mark
+
–
2
answers
2
GO Classes Test Series 2023 | Data Structures | Test 3 | Question: 8
Which of the following is/are correct about implementation of stack and queue. If stack is implemented as an array, all the push and pop operations can be performed in constant time. If stack is implemented as a ... queue is implemented as a linked list, all the enqueue and dequeue operations can be performed in constant time.
Which of the following is/are correct about implementation of stack and queue.If stack is implemented as an array, all the push and pop operations can be performed in con...
445
views
commented
Nov 25, 2022
DS
goclasses2024-ds-3-weekly-quiz
goclasses
data-structures
stack
queue
multiple-selects
1-mark
+
–
1
answer
3
GO Classes Test Series 2023 | Digital Logic | Test 3 | Question: 6
We wish to design a sequence detector circuit, which detects three or more consecutive $1’s$ in a string of bits coming through an input line. If we implement a sequential circuit with $\text{J-K}$ flip flops then the minimum number of flip flops required is _______
We wish to design a sequence detector circuit, which detects three or more consecutive $1’s$ in a string of bits coming through an input line.If we implement a sequenti...
288
views
commented
Nov 17, 2022
Digital Logic
goclasses2024-dl-3-weekly-quiz
numerical-answers
goclasses
digital-logic
sequential-circuit
flip-flop
1-mark
+
–
1
answer
4
GO Classes Test Series 2023 | Operating Systems | Test 4 | Question: 13
Given a disk with $200$ tracks, where track requests are received in the following order $55, 58, 39, 18, 90, 160, 150, 38, 184.$ The starting position for the arm is track $100.$ What is the number of tracks crossed when the elevator algorithm, starting in the direction UP, algorithm is used?
Given a disk with $200$ tracks, where track requests are received in the following order $55, 58, 39, 18, 90, 160, 150, 38, 184.$ The starting position for the arm is tra...
354
views
commented
Nov 1, 2022
Operating System
goclasses2024-os-4-weekly-quiz
numerical-answers
goclasses
operating-system
disk-scheduling
2-marks
+
–
1
answer
5
GO Classes Test Series 2024 | Discrete Mathematics | Test 3 | Question: 10
Which of the following is/are NOT a group? The integers under addition The nonzero integers under multiplication The nonzero real numbers under multiplication The complex numbers under addition
Which of the following is/are NOT a group?The integers under additionThe nonzero integers under multiplicationThe nonzero real numbers under multiplicationThe complex num...
487
views
commented
Oct 17, 2022
Set Theory & Algebra
goclasses2024-dm-3-weekly-quiz
goclasses
set-theory&algebra
group-theory
multiple-selects
1-mark
+
–
6
answers
6
GATE CSE 2021 Set 1 | Question: 25
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$ bursts, the minimum achievable average waiting time for these three processes in a non-preemptive scheduler (rounded to nearest integer) is _____________ milliseconds.
Three processes arrive at time zero with $\text{CPU}$ bursts of $16,\;20$ and $10$ milliseconds. If the scheduler has prior knowledge about the length of the $\text{CPU}$...
9.0k
views
answered
Jul 9, 2022
Operating System
gatecse-2021-set1
operating-system
process-scheduling
numerical-answers
1-mark
+
–
1
answer
7
#selfdoubt
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3 How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
given schedule s: R2A W1B W1C R3B R2B R1A C1 R2C C2 W3A C3How should I approach to above problem when LOCKS ARE NOT GIVEN and to find if s is 2PL ?
465
views
commented
Jan 1, 2022
Databases
transaction-and-concurrency
+
–
1
answer
8
#selfdoubt
 In the above ER diagram how many relational table and attributes will be in respective table??
In the above ER diagram how many relational table and attributes will be in respective table??
653
views
commented
Dec 25, 2021
Databases
er-diagram
+
–
0
answers
9
#selfDoubt
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst case?
Consider all the elements of an array is same and choosing pivot such a way that divides array into two equal parts. Then will it behave like QuickSort best case or worst...
490
views
commented
Dec 17, 2021
Algorithms
divide-and-conquer
+
–
3
answers
10
#selfDoubt
complement of CFL can never be CFL. please explain if the above statement is true of false?
complement of CFL can never be CFL.please explain if the above statement is true of false?
822
views
commented
Dec 14, 2021
Theory of Computation
theory-of-computation
context-free-language
normal
self-doubt
+
–
1
answer
11
Made Easy test series
int a = 50, b = 50; a = a+++++b; b = b+++++a; Value of b after executing these . I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify it please.
int a = 50, b = 50;a = a+++++b;b = b+++++a; Value of b after executing these .I think it should be undefined behaviour. But in answer it is given 155. Can anybody verify ...
565
views
answered
Dec 8, 2021
Programming in C
made-easy-test-series
programming-in-c
bad-question
+
–
11
answers
12
GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a pack...
32.6k
views
commented
Jan 15, 2021
Computer Networks
gatecse-2015-set3
computer-networks
normal
numerical-answers
network-switching
+
–
1
answer
13
#madeeasy
$L1=a^n b^n c^m | n,m>0$ $L2=a^n b^m c^m |n,m>0$ Then L1 intersection L2= a^n b^n c^n or a^n b^n c^m Which one will be correct??
$L1=a^n b^n c^m | n,m>0$$L2=a^n b^m c^m |n,m>0$Then L1 intersection L2= a^n b^n c^n or a^n b^n c^mWhich one will be correct??
364
views
commented
Jan 26, 2019
0
answers
14
#madeeasy
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
{w/w€{0,1}^*; w has equal no. of occurrance of ‘001 and ‘010’} is regular or not??
434
views
asked
Jan 16, 2019
0
answers
15
#gate
$L_1=\{a^m b^m c a^n b^n | m,n>=0\}$ $L_2=\{a^i b^j c^k | i, j,k >=0\}$ Then $L_1 \cap L_2$ = $\{a^m b^m c\}$ or $\{a^n b^n c\}$ or $\{a^i b^i c\}$ or $\{a^j b^j c\}$ Which one is correct??
$L_1=\{a^m b^m c a^n b^n | m,n>=0\}$$L_2=\{a^i b^j c^k | i, j,k >=0\}$Then $L_1 \cap L_2$ = $\{a^m b^m c\}$ or $\{a^n b^n c\}$ or $\{a^i b^i c\}$ or $\{a^j b^j c\}$Which...
204
views
asked
Jan 14, 2019
0
answers
16
#madeeasy
A group G having O(G)= 200 is known to be cyclic with g being one of its generator.It is given that O(g^x)=100 for some x€Z. Then value of x is?
A group G having O(G)= 200 is known to be cyclic with g being one of its generator.It is given that O(g^x)=100 for some x€Z. Then value of x is?
737
views
asked
Jan 13, 2019
0
answers
17
#madeeasy
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F. I1: push 500 I2: push 700 I3: add I4: pop 600 I5: push 300 Then after execution of above instruction the memory location 600 contains _
A stack based CPU executes the instruction. Memory location 500 contain 0×88 and memory location 700 contain 0×37. Stack pointer is at 0×003F.I1: push 500I2: push 700I...
387
views
asked
Jan 11, 2019
CO and Architecture
co-and-architecture
stack
+
–
1
answer
18
#madeeasy
bool foo(char *s) { char c[ ]=”correspondence”; int i=0,j=0; While(s[i] && c[j]) { if (s[i] ==c[j]) j++; i++; } if(! c[j]) return true; else return false; } The string ‘response’ and ‘credence' are passed to the above function too one by one and output is observed in each case. book data type return true or false
bool foo(char *s){ char c[ ]=”correspondence”;int i=0,j=0;While(s[i] && c[j]){ if (s[i] ==c[j]) j++;i++;}if(! c[j]) return true;else return false;}The string ‘respo...
424
views
asked
Jan 9, 2019
0
answers
19
#madeeasy
284
views
asked
Jan 7, 2019
0
answers
20
#madeeasy
If the sender window size is 128 using selective repeat arq,then the sequence no. of the frame to be send after sending 400th frames is_?
If the sender window size is 128 using selective repeat arq,then the sequence no. of the frame to be send after sending 400th frames is_?
213
views
asked
Jan 5, 2019
0
answers
21
#madeeasy
How many binary min heap possible with element(1,2,3,4,5,6,7)?
How many binary min heap possible with element(1,2,3,4,5,6,7)?
280
views
asked
Jan 2, 2019
0
answers
22
#madeeasy
No of generators in a cyclic group when O(G)=12 and O(G)=13?
No of generators in a cyclic group when O(G)=12 and O(G)=13?
332
views
asked
Jan 2, 2019
1
answer
23
#madeeasy
For two relations R(a,b) with FD F={a->b} and S(b,c) with FD F={b->c} then R natural join S is Bcnf. Explain True or False?
For two relations R(a,b) with FD F={a->b} and S(b,c) with FD F={b->c} then R natural join S is Bcnf. Explain True or False?
429
views
asked
Dec 30, 2018
0
answers
24
#Madeeasy
A 4way set associative cache lines of 32 bytes and a cache size of 16kb. Which of the below main memory blocks is mapped to set 13 of the cache memory when 16mb main memory is used? (A295D0,FCED9D,2FA0D0,F0A1B5)
A 4way set associative cache lines of 32 bytes and a cache size of 16kb. Which of the below main memory blocks is mapped to set 13 of the cache memory when 16mb main memo...
298
views
asked
Dec 30, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register