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 tech_beardo
1
votes
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++) ...
340
views
answered
May 4, 2022
0
votes
2
Ace Test Series: Theory Of Computation - Identify Class Of Language
Can someone please explain me this question ?
Can someone please explain me this question ?
314
views
answered
Sep 19, 2020
Theory of Computation
ace-test-series
theory-of-computation
identify-class-language
+
–
0
votes
3
theory of computation 2
how to reduce this type of expression
how to reduce this type of expression
353
views
answered
Aug 21, 2020
Theory of Computation
theory-of-computation
regular-expression
+
–
0
votes
4
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.6k
views
answered
Aug 20, 2020
Operating System
disk-scheduling
operating-system
+
–
0
votes
5
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.4k
views
answered
Aug 19, 2020
Computer Networks
computer-networks
congestion-control
+
–
0
votes
6
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 \}$
531
views
answered
Aug 18, 2020
Theory of Computation
theory-of-computation
minimal-state-automata
+
–
0
votes
7
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...
902
views
answered
Aug 14, 2020
Theory of Computation
theory-of-computation
finite-automata
regular-language
+
–
0
votes
8
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}?
5.0k
views
answered
Aug 14, 2020
Theory of Computation
finite-automata
+
–
0
votes
9
Regular expression for given FA
2.1k
views
answered
Aug 12, 2020
Theory of Computation
theory-of-computation
regular-expression
finite-automata
+
–
0
votes
10
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?
667
views
answered
Jul 29, 2020
Theory of Computation
finite-automata
+
–
0
votes
11
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
237
views
answered
Jul 26, 2020
Theory of Computation
finite-automata
regular-language
regular-grammar
+
–
0
votes
12
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
309
views
answered
Mar 29, 2020
CO and Architecture
co-and-architecture
pipelining
+
–
1
votes
13
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
+
–
0
votes
14
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.7k
views
answered
Nov 25, 2019
Theory of Computation
theory-of-computation
+
–
0
votes
15
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 _________.
173
views
answered
Nov 8, 2019
0
votes
16
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.9k
views
answered
Oct 27, 2019
DS
data-structures
avl-tree
numerical-answers
+
–
0
votes
17
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...
368
views
answered
Oct 21, 2019
Digital Logic
digital-logic
+
–
0
votes
18
DIGITAL LOGIC
Is this expression correct?
Is this expression correct?
204
views
answered
Oct 20, 2019
0
votes
19
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...
258
views
answered
Oct 17, 2019
Operating System
galvin
operating-system
+
–
0
votes
20
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...
461
views
answered
Oct 17, 2019
Operating System
galvin
operating-system
process-scheduling
descriptive
+
–
0
votes
21
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...
420
views
answered
Oct 16, 2019
Digital Logic
digital-logic
ies
ies-2018
+
–
0
votes
22
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
267
views
answered
Oct 15, 2019
0
votes
23
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...
229
views
answered
Oct 11, 2019
0
votes
24
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
258
views
answered
Oct 10, 2019
1
votes
25
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)
358
views
answered
Oct 6, 2019
Programming in C
programming-in-c
+
–
0
votes
26
Made easy doubt
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11. 12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21 Where hash table using quarditic probing of mod11 to handle the ... inside the hash table ________ (value will be a whole number). I can't understand what is "i" is it number of collision?
Consider the following keys that are hashed into the hash table in the given order using the hash function H(key) = key mod 11.12, 44, 13, 88, 23, 94, 11, 39, 20, 16, 21W...
747
views
answered
Oct 5, 2019
0
votes
27
ME MOCK 2
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n--; } } Let X be the number of times the comparission inside the while loop ( i.e., m<=n ) is performed, when mystery(127,255) is called. Then the value of X is _______________
We are given a C function, mystery() as follows. void mystery(int m, int n) { while(m<=n) { m++; n ; } }Let X be the number of times the comparission inside the while loo...
712
views
answered
Sep 21, 2019
DS
algorithms
+
–
0
votes
28
algo questions
in case of comparision sort max possible is n(n-1)/2
in case of comparision sort max possible is n(n-1)/2
558
views
answered
Aug 9, 2019
Algorithms
sorting
ace-test-series
+
–
1
votes
29
Gateforum Test Series: Algorithms - Dynamic Programming
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$, $\sum={a,b,c,…..z}$. String matching problem is to find all the occurence of P in T. A pattern occur with shift s in T if $P[1…..m]=T[s+1,…...s+m]$. Consider $T=bacacbaacacac$ $P=cac$ The sum of the value of all s is ________
Given a text array $T[1…..n]$ and a pattern array $P[1….m]$ such that T and P are character taken from alphabet $\sum$,$\sum={a,b,c,…..z}$. String matching problem ...
758
views
answered
Aug 5, 2019
Algorithms
gateforum-test-series
algorithms
dynamic-programming
+
–
2
votes
30
MadeEasy CBT 2017:Operating System - Process Synchronization
835
views
answered
Jul 12, 2019
Operating System
made-easy-test-series
cbt-2017
operating-system
process-synchronization
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register