# Recent questions tagged self-doubt

Que Consider a circular queue which is of capacity 100 elements and is implemented on an array a[0...99], at a particular instant the front pointer is pointing to index 20 and the rear is pointing at index 10 the number of elements present in the queue is. 10 90 91 None
How to calculate memory reference taken by any instruction in the "instruction decode(ID) phase??
Can anyone provide me good reference for solving Directed Acyclic Graphs(DAG) problems?
1 vote
These are what i ended up with while solving a couple of recurrance relation can anyone help to solve further. $(n^2) log(n/2^{k-1}) + 2(n^2) log(n/2^{k-2}) + 3(n^2) log(n/2^{k-3}) + ...+ (n^2) log(n)$ $2. lg n + lg (n / 2) + lg (n / 4) + ... + lg (n / 2^{lg n})$ Note: Assume base 2 for log terms.
Bag contains 5 black, 2 red and 3 white marbles. Three marbles are drawn simultaneously. Find probability that they're of different colour
when solving questions of disks 10KB is 1024*10B or 1000*10B? different sources are telling different things,even same sources are telling different things at different time.
Can Someone help me understand the time-complexity of dependent loops? for example, Q1> int i,j; for(i=1;i<n;i=i++) { for(j=1;j<=i;j=j*2) } Q2> int i,j; for(i=1;i<=n/2;i=i++) { for(j=1;j<=i;j++) }
1 vote
MSQ Type question.
If a schedule is given and it is asked whether the given schedule is serializable or not, is it asking about conflict serializability or view serializability? And when it is asked about the precedence graph, is it about the precedence graph that we draw to check conflict serializability or the one for view serializability?
In datagrams fragmentation occurs at routers. What about in virtual circuits? As CPU bandwidth and buffers are reserved, is there a chance for fragmentation to occur in router?
How to start preparing for Gate 2022, I am second year engineeering Student ? i know this is a basic question , but whenever take those big books of dbms of sudharson,ds of kenneth rosen , i don’t thinks i cannot cover them,even when i start reading i cannot understand much , how ,where should i start preparing?
https://gateoverflow.in/86224/gate1990-13a for tym complexity ..is it like …..n times we need to search position so O(nlogn) n insertion so O(n) and only two rotation so O(logn)...because i m not rotating for each iteration just doing at last so overall O(nlogn)...please look...
https://gateoverflow.in/19251/tifr2010-b-37 by counter example like for a= 2 and b =1 the loop does not terminate thus remaining options are A and D. But I'm having problem getting D as answer my answer is A as at any random example say a = 4 and b =2 we get final ... evidently z != a*b , so I go with Option A. considering this comment of the.brahmin.guy how it is not terminating using a=2 nd b
A virtual memory with 64 bit virtual address, a 43 bit physical address, a page size 32 KB. TLB with 32 entries. Each TLB entries has TLB tag, physical frame number +3 protection bits. Assume that TLB tag doesnot store any process id. How many bits required for the TLB if TLB is 4 way set associative? Ans given 2464 bits. Is it correct?
1 vote
Q.Considerhe following program segment hypothetical CPU have three resistors r1 r2 and r3 | Instruction operation Instruction size (in word) Mov r1,5000 r1<- memory [5000] 2 Mov r2(r3) r2<- memory [r1] 1 Add r2 r3 r2<- r2+r3 1 Mov 6000 r2 momory[6000] ... 1 clock cycle per word Instruction fetch and decode: 2 clock cyxle per word The total number of clock cycle required to execute the program is?
Why on even in dfa there are loops present we consider it as decidable where in turing machie are undecidable?
#include<stdio.h> struct Ournode{ char x, y, z; }; int main() { struct Ournode p={'1', '0', 'a'+2}; struct Ournode *q=&p; printf("%c, %c", *((char*)q+1), *((char*)q+2)); return 0; } In this question the size of p is 3 byte and q is pointing to p so when we are doig to q+1 why it is not pointing to location p+3
Why functional dependencies of the from Non-Prime → Prime, are not allowed, I had encountered this logic in Made Easy Test Series and was unable to imagine a contradiction for this statement. Explanation with example would be appreciated.
Q. Let Q denote a queue containing 16 numbers and S be an empty stack. Head(Q) returns the element at the head of queue Q without removing it from Q. similarly Top(S) returns the element at the top of S without removing it from S. consider the algorithm given below ... ,x); else x:=Pop(S); Enqueue(Q,x); end end The maximum possible number of iteration of the while loop in the algorithm is_________
Q. What does the following program do when the input is unsigned 16-bit integer? #include<stdio.h> main() { unsigned int num; int i; scanf("%u",&num); for(i=0;i<16;i++) { printf("%d.",(num << i&1 <<15)?1:0); } } (A) it prints all even bits from num (B) it prints all odd bits from num (C) it prints binary equivalent of num (D) none of the above
The question on madeasy test: find out number of temp variables in the 3AC generated for this expression x = (-b + sqrt(b^2 - 4*a*c)) / (2*a) The answer on madeasy makes sense (screenshot below), but in this nptel video - (1 min 30th second) https://www.youtube.com/watch?v ... ) or the 2nd (nptel and wikipedia method): 1. ** 2. **where Tn-1 is √(b^2 - 4ac), and Tn is the nth temporary variable
The data field can carry which of the following? 1) TCP segment 2) UDP segment 3) ICMP messages 4) None of these Correct Answer: ICMP messages But data field can carry TCP segments and UDP segments as well. Why is ICMP the answer? It should be A,B,C.
The number of 1's in the binary representation of (3*4046+15*256+5*16+3) is
https://gateoverflow.in/1925/gate2014-1-47 WHY THE B CANT BE ANSWER IF WE DO THE SAME WAY WE DID FOR A AND D? PLEASE SEE...
Which of the following sorting algorithm gives the same number of swaps as that of the total inversion count in the array? Quick sort Selection sort Merge Sort Bubble Sort
https://gateoverflow.in/141809/ambiguous-to-unambiguous what will be the unambiguous grammar …...
A graph which not having even length cycle then 3 color are sufficient to color vertices of graph such that no two adjacent vertex having same color?
let L1=a^n (which is a regular language) and L2=b^n (which is also a regular language) L1.L2 is also regular.. how?? as (a^nb^n) is not a regular language
int main() { int x=8,y=1; while(x>=y) { x=--x-x--; y=--y-y++; } printf("%d %d",y,x); what is the output?? please give detail solution.
A long thin walled cylindrical shell, closed at both the ends, is subjected to an internal pressure. The ratio of the hoop stress (circumferential stress) to longitudinal stress developed in the shell is
K-map 0 1 0 0 0 1 X 0 0 X X 0 0 0 0 0 X= don’t care Derive the minimum Sum-of-Product form for this.
So, all the array elements has its own cache block and there is no collision. In this question, https://gateoverflow.in/863/gate2002-10, the quoted text is from the Arjun sir’s best answer. Since the array occupies continuous space, there should be 4 elements in a single block. How is the above-quoted sentence justified??