Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
tech_beardo
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by tech_beardo
1
answer
1
complexity of a function
Find the complexity of the below function: function (int n){ for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) printf("*"); } }
Find the complexity of the below function:function (int n){for (int i=0;i<n;i++) for (int j=i;j<i*i;j++) if(j%i==0){ for(int k=0;k<j;k++) ...
328
views
commented
May 5, 2022
2
answers
2
ISI2018-PCB-CS7
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps: Step I:saving the context of $P_{old}$; Step II: running the scheduling algorithm to pick $P_{new}$; Step III: restoring the saved context of $P_{new}$. Suppose Steps ... in the order $P_1, P_2, . . . , P_k;$ each process requires exactly one CPU burst of $20$ms and no I/O burst.
A context switch from a process $P_{old}$ to a process $P_{new}$ consists of the following steps:Step I:saving the context of $P_{old}$;Step II: running the scheduling al...
1.2k
views
commented
Apr 30, 2022
Operating System
isi2018-pcb-cs
operating-system
process-scheduling
descriptive
+
–
1
answer
3
Testbook Test Series
225
views
commented
Mar 31, 2022
Digital Logic
testbook-test-series
+
–
1
answer
4
Made Easy Test Series: DS
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root is kept in $A[1]$, and it's $d$ children are kept in order in $A[2]$ through $A[d+1]$ ... $A\left [ d^{2}+d+2 \right ]$
A $d-$ary heap is a binary heap, but instead of $2$ children, nodes have $d$ children. A $d-ary$ heap can be represented by $1-D$ array as follows. The root is kept in $A...
466
views
commented
Nov 17, 2021
DS
made-easy-test-series
data-structures
+
–
1
answer
5
Ace Test Series: Theory Of Computation - Identify Class Of Language
Can someone please explain me this question ?
Can someone please explain me this question ?
303
views
answered
Sep 19, 2020
Theory of Computation
ace-test-series
theory-of-computation
identify-class-language
+
–
2
answers
6
theory of computation 2
how to reduce this type of expression
how to reduce this type of expression
331
views
answered
Aug 21, 2020
Theory of Computation
theory-of-computation
regular-expression
+
–
1
answer
7
Disk Scheduling
Suppose that the head of a moving head disk with 192 tracks(0-191), is currently serving a request at track 80 and has just finished at track 62. The queue of the request is kept in FIFO order: 119, 58, 114, 28, 111, 55, 103, 30, 75. What ... of tracks traversed by head movements needed to satisfy these request for the Elevator disk-scheduling algorithm? a. 143 b. 130 c. 177 d. 547
Suppose that the head of a moving head disk with 192 tracks(0-191), is currently serving a request at track 80 and has just finished at track 62. The queue of the request...
3.5k
views
answer edited
Aug 20, 2020
Operating System
disk-scheduling
operating-system
+
–
1
answer
8
TCP Congestion Control
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshold at the start of first transmission is 24 KB. Assume that 3 duplicate ACK are received during the 5th transmission what is the congestion window size at the end of 10th transmission?
Consider an instance of TCP’s Additive Increase Multiplicative Decrease (AIMD) algorithm where the window size at the start of slow start phase is 2 KB and the threshol...
1.3k
views
answered
Aug 19, 2020
Computer Networks
computer-networks
congestion-control
+
–
1
answer
9
Minimal DFA
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
Number of states in Minimal DFA that accepts Language L=$\left \{ ab^* a^* \cup (ab)^* ba\right \}$
496
views
answered
Aug 18, 2020
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
2
answers
10
Finite Automate and Regular Sets
I have a doubt in this that according to me the answer should be 6 as 5 states for modulo 5 + 1 dead state in starting as according to ques the string is starting from 1 so 0 production will go to a dead state that's my assumption but behind the answer written is 7 states i m really confused how ?? Please help me what is its real answer
I have a doubt in this that according to me the answer should be 6 as 5 states for modulo 5 + 1 dead state in starting as according to ques the string is starting from 1...
855
views
answered
Aug 14, 2020
Theory of Computation
theory-of-computation
finite-automata
regular-language
+
–
6
answers
11
Introduction to theory of computing by "Michael sipser" 3rd edition page no:37
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
A minimal DFA diagram for the language A = {w| w contains at least one 1 and an even number of 0s follow the last 1}?
4.9k
views
answered
Aug 14, 2020
Theory of Computation
finite-automata
+
–
6
answers
12
Regular expression for given FA
2.1k
views
answer edited
Aug 12, 2020
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
6
answers
13
Doubt-DFA
what is the grammar generated by the complement of this DFA and what is the type?
what is the grammar generated by the complement of this DFA and what is the type?
621
views
answered
Jul 29, 2020
Theory of Computation
finite-automata
+
–
1
answer
14
This question is taken from a sample paper
Consider the following grammar G. Is this regular? S →EF E → a|∈ F → abF|ac
Consider the following grammar G. Is this regular?S →EFE → a|∈F → abF|ac
220
views
answered
Jul 26, 2020
Theory of Computation
finite-automata
regular-language
regular-grammar
+
–
2
answers
15
doubt in coa
is it 5 or 4 ..?? some places i am finding it as 4 (number of cycles) and in some places it is given as 5(number of slots)..please confirm
is it 5 or 4 ..?? some places i am finding it as 4 (number of cycles) and in some places it is given as 5(number of slots)..please confirm
286
views
answered
Mar 29, 2020
CO and Architecture
co-and-architecture
pipelining
+
–
4
answers
16
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 14 (Page No. 82)
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?
A computer has a pipeline with four stages. Each stage takes the same time to do its work, namely, $1$ nsec. How many instructions per second can this machine execute?
1.7k
views
answered
Mar 26, 2020
CO and Architecture
tanenbaum
operating-system
machine-instruction
pipelining
descriptive
+
–
4
answers
17
RegulaR Expression
Find the regular expression No 2 a's and 2 b's should come together?
Find the regular expression No 2 a's and 2 b's should come together?
3.6k
views
answered
Nov 25, 2019
Theory of Computation
theory-of-computation
+
–
1
answer
18
Mapping
Full participation on "one " side of one to many relationship how many tables min required and what is foreign key ,primary key
Full participation on "one " side of one to many relationship how many tables min required and what is foreign key ,primary key
152
views
commented
Nov 16, 2019
1
answer
19
ME Test Series
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB. Number of bits disk block address contain is _________.
Unix I-node has block size 8 KB and file possible with triple indirect is 128 GB. Number of bits disk block address contain is _________.
166
views
answered
Nov 8, 2019
9
answers
20
AVL tree
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is root are ________.
The number of different orders are possible for elements 1, 2, 3, 4, 5, 6, 7 to be inserted in to empty AVL tree such that no rotation will be done and element ‘4’ is...
8.7k
views
answered
Oct 27, 2019
DS
data-structures
avl-tree
numerical-answers
+
–
1
answer
21
UPPCL AE 2018:46
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons? Counting sort Radix sort Heap sort Bucket sort
Which one of the following algorithms cannot sort $n$ numbers in $O(n)$ comparisons?Counting sortRadix sortHeap sortBucket sort
475
views
commented
Oct 26, 2019
Algorithms
uppcl2018
algorithms
sorting
+
–
1
answer
22
made-easy
A 3 bit down counter is used to control the output of the multiplexer as shown in the figure. The counter is intially at (101)2 then output of multiplexer will follow the sequence i m getting I2,0,I1,0 is it correct?
A 3 bit down counter is used to control the output of the multiplexer as shown in the figure. The counter is intially at (101)2 then output of multiplexer will follow the...
356
views
answered
Oct 21, 2019
Digital Logic
digital-logic
+
–
1
answer
23
DIGITAL LOGIC
Is this expression correct?
Is this expression correct?
190
views
answered
Oct 20, 2019
1
answer
24
Galvin Edition 9 Exercise 1 Question 6 (Page No. 50)
Which of the following instructions should be privileged ? a. Set value of timer. b. Read the clock. c. Clear memory. d. Issue a trap instruction. e. Turn off interrupts. f. Modify entries in device-status table. g. Switch from user to kernel mode. h. Access I/O device.
Which of the following instructions should be privileged ?a. Set value of timer.b. Read the clock.c. Clear memory.d. Issue a trap instruction.e. Turn off interrupts.f. Mo...
245
views
answered
Oct 17, 2019
Operating System
galvin
operating-system
+
–
1
answer
25
Galvin Edition 9 Exercise 6 Question 1 (Page No. 305)
A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different schedules are possible? Give a formula in terms of $n$.
A CPU-scheduling algorithm determines an order for the execution of its scheduled processes. Given $n$ processes to be scheduled on one processor, how many different sche...
452
views
answered
Oct 17, 2019
Operating System
galvin
operating-system
process-scheduling
descriptive
+
–
1
answer
26
IES 2018 JK Flip flop
In a master slave JK flip-flop (a) both master and slave are positive edge triggered (b) both master and slave are negative edge triggered (c) master is positive edge triggered and slave is negative edge triggered (d) master is negative edge triggered and slave is positive edge triggered
In a master slave JK flip-flop(a) both master and slave are positive edge triggered(b) both master and slave are negative edge triggered(c) master is positive edge trigge...
413
views
answered
Oct 16, 2019
Digital Logic
digital-logic
ies
ies-2018
+
–
1
answer
27
Test Series
The value of -43 in 2’s complement is? Options: 1.21 2.43 3.-21 4.None of the above
The value of -43 in 2’s complement is?Options:1.212.433.-214.None of the above
254
views
answered
Oct 15, 2019
1
answer
28
SELF DOUBT
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an integer rather than in character form? PLEASE EXPLAIN WHAT THIS QUESTION MEANS AND SOLUTION
Suppose the domain set of an attribute consists of signed 3 digit numbers. What is the percentage of reduction in storage space of this attribute if it is stored as an in...
214
views
answered
Oct 11, 2019
1
answer
29
Made-easy-test-series
A) D flip-flop B) T flip-flop C) sequence detector D)2-bit counter
A) D flip-flopB) T flip-flopC) sequence detectorD)2-bit counter
256
views
answered
Oct 10, 2019
1
answer
30
c type casting
what is the meaning of k= (char *) (i*j) it will return k =(char *) (300)
what is the meaning of k= (char *) (i*j)it will return k =(char *) (300)
347
views
answer edited
Oct 6, 2019
Programming in C
programming-in-c
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register