Dark Mode

Recent activity by aambazinga

1 answer

1

#BookRecommendation
For Memory Addressing and Pipelining portion which standard book should I refer? Or any good resource to have crystal clear understanding,please suggest.

answered in CO and Architecture Feb 11, 2019

266 views

5 answers

2

GATE CSE 2019 | Question: 48
Let $\Sigma$ be the set of all bijections from $\{1, \dots , 5\}$ to $\{1, \dots , 5 \}$, where $id$ denotes the identity function, i.e. $id(j)=j, \forall j$. Let $\circ$ ... Consider the language $L=\{x \in \Sigma^* \mid \pi (x) =id\}$. The minimum number of states in any DFA accepting $L$ is _______

commented in Theory of Computation Feb 8, 2019

15.5k views

9 answers

3

GATE CSE 2019 | Question: 46
Let $T$ be a full binary tree with $8$ leaves. (A full binary tree has every level full.) Suppose two leaves $a$ and $b$ of $T$ are chosen uniformly and independently at random. The expected value of the distance between $a$ and $b$ in $T$ (ie., the number of edges in the unique path between $a$ and $b$) is (rounded off to $2$ decimal places) _________.

commented in DS Feb 7, 2019

22.9k views

7 answers

4

GATE CSE 2019 | Question: 37
There are $n$ unsorted arrays: $A_1, A_2, \dots, A_n$. Assume that $n$ is odd.Each of $A_1, A_2, \dots, A_n$ contains $n$ distinct elements. There are no common elements between any two arrays. The worst-case time complexity of computing the median of the medians of $A_1, A_2, \dots , A_n$ is $O(n)$ $O(n \: \log \: n)$ $O(n^2)$ $\Omega (n^2 \log n)$

commented in Algorithms Feb 7, 2019

20.0k views

6 answers

5

GATE CSE 2019 | Question: 49
Consider that $15$ machines need to be connected in a LAN using $8$-port Ethernet switches. Assume that these switches do not have any separate uplink ports. The minimum number of switches needed is ______

commented in Computer Networks Feb 7, 2019

14.7k views

1 answer

6

is it dangling pointer
is it dangling pointer ? int main(void) { int* p; printf("%d",*p); return 0; } https://ideone.com/IN77el

commented in Programming Feb 1, 2019

423 views

0 answers

7

Can Merge Sort Time Complexity be O(n^2) in any condition?

commented in Algorithms Feb 1, 2019

1.1k views

0 answers

8

Length of production
A Grammer is said to be in 4-Standard form if all productions of the grammer are of type A → BCDE|a. If a grammer is in 4-Standard form how many steps in derivation of w will require if length of string w is 256 ?

commented in Theory of Computation Jan 31, 2019

408 views

0 answers

9

commented in Linear Algebra Jan 31, 2019

260 views

1 answer

10

Letters in boxes - combinations
Q .) The number of ways can 5 letter be put in 3 boxes A, B,C such that A has at least 2 letters. My approach: Number of ways to choose 2 letters out of 5 is 5C2. And for each such combination the remaining 3 letter have 3 choice. Therefore 5C2 * 3^3, but this is incorrect. Please point out the fault in my understanding and also the correct way to solve it

commented in Combinatory Jan 31, 2019

383 views

1 answer

11

Can 2PL have Read Write conflict?
Can 2PL have Read Write conflict? Consider following schedule with two transaction T1 T2 L_S(A) Read(A) L_X(A)---------------------------is T2 allowed to acquire exclusive lock on A? Write(A) L_S(A) ----------------------------------------------T1 already has this lock Read(A) Commit RollBack Will this schedule allowed by 2PL

commented in Databases Jan 31, 2019

798 views

0 answers

12

First fit,Next fit assumptions
In Os questions related to first fit,next fit etcv if nothing is given which partition scheme do we assume.Fixed or variable

commented in Operating System Jan 31, 2019

277 views

3 answers

13

MadeEasy Subject Test 2019: Combinatory - Permutations And Combinations
Q.The number of ways, we can arrange 5 books in 3 shelves ________.

commented in Combinatory Jan 31, 2019

2.3k views

0 answers

14

#TOC #PumpingLemma
What is Pumping length? Why we consider pumping length of certain numbers? Can Pumping length be 0?

commented in Theory of Computation Jan 31, 2019

164 views

0 answers

15

MadeEasy Test Series 2019: Computer Networks - Congestion Control
Consider a TCP connection using the multiplicative additive congestion control algorithm where the window size is 1 MSS and the threshold is 32 MSS. At the $8^{th}$ transmission timeout occurs and enters in the congestion detection ... transmission. So we have to take the window size after the 12 RTTs right and not at 12th RTT?

commented in Computer Networks Jan 31, 2019

1.3k views

1 answer

16

MadeEasy Test Series 2019: Discrete Mathematics - Set Theory & Algebra
Which of the following are Well ordered set $\left [ Z^{+},\leq \right ]$ $\left [ Z^{-},\leq \right ]$ $\left [ Z^{+},\geq \right ]$ $\left [ Z^{-},\geq \right ]$

commented in Set Theory & Algebra Jan 29, 2019

662 views

0 answers

17

MadeEasy Subject Test 2019: Programming & DS - programming in C
void foo(int n) { for(i1=1;i1<=n;i1++) { for(i2=1;i2<=i1;i2++) { ....... { for(i6=1;i6<=i5;i6++) { count++; } } } } } Count initially 0.What is value returned by foo(8)?

commented in Programming Jan 28, 2019

400 views

0 answers

18

MeTest-MOCK2
When 54 bytes of data is transferred using the UDP protocol, the efficiency is? (In per cent) IN UDP, the maximum datagram size can be $2^{16}-1 \, bytes$ Now to this, 8 Bytes of UDP header is included and this together must fit within $65535\, bytes$ IPv4 ... are actually sending 54 Bytes, so the efficiency of the protocol is $\frac{54}{65507} \times 100(\,in\,\%)$ Am I correct?

commented in Computer Networks Jan 22, 2019

404 views

1 answer

19

MeTest-1
Consider the following statements S1:Disk is considered as the maximum size of virtual memory. S2:Long term scheduler controls the degree of multiprogramming S3:Strict Alternation guarantees mutual exclusion and progress. Which of the above statements are correct? I think only S2 ... CPU's MMU and not disk size.That is where logical address is stored. Please let me know what is correct.

commented in Operating System Jan 21, 2019

636 views

3 answers

20

GATE CSE 2008 | Question: 35
For inclusion to hold between two cache levels $L_1$ and $L_2$ in a multi-level cache hierarchy, which of the following are necessary? $L_1$ must be write-through cache $L_2$ must be a write-through cache The associativity of $L_2$ must be greater than that of $L_1$ The ... be at least as large as the $L_1$ cache IV only I and IV only I, II and IV only I, II, III and IV

commented in CO and Architecture Jan 19, 2019

20.1k views

2 answers

21

Compiler Design
Type of ERROR

commented in Compiler Design Jan 19, 2019

646 views

2 answers

22

GATE-ECE-2018
Consider a binary channel code in which each codeword has a fixed length of 5 bits. The Hamming distance between any pair of distinct codewords in this code is at least 2. The maximum number of codewords such a code can contain is _________.

answered in Digital Logic Jan 19, 2019

3.0k views

0 answers

23

ME-MT-CO+OS
consider a 2-level $L_1$ and $L_2$ memory hierarchy system.The associativity of $L_1$ towards processor is more .$L_1$(cache ) has accessing time of 15 ns and $L_2$ (main memory) has an accessing time of 100 ns .writing takes 30 ns for $L_1$ and 150 ns for $L_2$.assume ... simultaneously so $T_w=150 ns$ $T_r=.7*15ns+.3*(100ns+15ns)=45ns$ $T_{avg}=.5*45+.5*150=97.5ns$ please verify it.

commented in CO and Architecture Jan 18, 2019

187 views

0 answers

24

made easy mock1
let L={set of all strings over {0,1}* , containing 01 and 011 as the substring } number of states in the minimal DFA of L’ is? i’m getting 3. please confirm if you are getting 3 or 4.

commented in Theory of Computation Jan 17, 2019

914 views

0 answers

25

self doubt #madeeasy-test-series
given a degree sequence for n vertices i.e.$d_1,d_2, .d_v$.what is worst time complexity to determine if a simple graph is possible with the given degree sequence? answer given as:$O(n^2logn)$. according to me,for first we have to sort them which will take O(nlogn) ... time = for first pass {O(nlogn)}+for n-1 pass O(n) =O($n^2$. correct me if i m wrong.thank you

comment edited in Algorithms Jan 16, 2019

1.5k views

0 answers

26

Gate Preparation in the last 18 days from Now
I have completed some amount of syllabus,I have takes some tests also,I haven't solved all the PYQ's of the GO book.My FLT scores are very poor.I have realized that my ability to take stress is poor one bad score and the time I take to recover ... as I wake up late. I just feel that Gate exam is not my cup of tea and I am wasting my time on it.

commented in GATE Jan 15, 2019

510 views

0 answers

27

commented in CO and Architecture Jan 15, 2019

378 views

0 answers

28

commented in Set Theory & Algebra Jan 14, 2019

715 views

0 answers

29

applied-course-mock-3
Consider a computer system in which cache memory write hit takes 5ns and and miss takes 80ns. Cache memory read hit takes 2ns and miss takes 40ns. The cache is having 95% hit. The system received 1000 instructions out of which, 700 operand fetch operations and 300 operand write operations. The average time taken to execute above 1000 instructions is___________?

commented in CO and Architecture Jan 14, 2019

383 views

1 answer

30

made easy cbt1
FIFO replacement policy ignores locality of reference. true/false

commented in Operating System Jan 13, 2019

750 views