Which is true for typical RISC architecture? A.Micro Programmed Control Unit B.Instruction takes multiple clock cycles. C.Have few register in CPU D.Emphasis on optimising instruction pipelines
is bubble sort an online algorithm? cause whenever new element is fed, it can be take to its place by swapping the adjacent numbers. is my thinking right?
I am reading packet switching vs circuit switching from computer networking a top down approach(pg no. 57) . I came across an example: Suppose there are 10 users and that one user suddenly generates one thousand 1000-bit packets, while other users remain quiescent and don't ... data has been transmitted. Now I don,t know how author got 10s as answer while i am getting 100s as answer. Kindly help.
Let $\langle M \rangle$ denote an encoding of an automaton $M$. Suppose that $\Sigma = \{0,1\}$. Which of the following languages is/are $\text{NOT}$ recursive? $L= \{ \langle M \rangle \mid M$ is a $\text{DFA}$ such that $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is ... $L(M)=\emptyset \}$ $L= \{ \langle M \rangle \mid M$ is a $\text{PDA}$ such that $L(M)=\Sigma ^* \}$
Consider the following three functions. $f_1=10^n\quad f_2=n^{\log n}\quad f_3=n^{\sqrt {n}}$ Which one of the following options arranges the functions in the increasing order of asymptotic growth rate? $f_3, f_2, f_1$ $f_2, f_1, f_3$ $f_1, f_2,f_3$ $f_2, f_3, f_1$
What is the range of IP addresses spanned by the CIDR address 192.168.10.0/20?
for an almost sorted array, which algorithm is better, shell sort or insertion sort? and also for a fully sorted array?
I am currently studying dynamic programming for GATE 2022. I am kinda stuck with which problems to prioritize. Can someone help? #dynamic-programming
what is difference between preemption and inturrupts on process state diagram
if we require a large(more than size of array or 1000000mb) but constant( irrespective of size of input array) extra space for an algorithm, will the algorithm be in place or not? the extra space is not required to manipulate the elements of array but may be required for some other purpose.
operating-system cpu-scheduling . someone please guide me how to approach this problem.
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.
If some T FFs are connected in series. The 1st FF is supplied by a clock with frequency 1 MHz and the last FF signal out is 31.25 KHz. Find the number of the Flip Flops are used in the circuit.
I was scrolling through sample questions when I chanced over this question. Consider a sliding window flow control protocol between hosts A and B. Suppose the link propagation delay is 1 time unit, the retransmission timeout is 3 time units, and the window size is ... the drops? I would really appreciate any help regarding this question. Also, can someone please leave a link to similar questions?
"Normal distribution" :- probability density function f(x) =1/√2π σ e^-(x- μ )^2/( σ ) ^2. My question is, why are use √2π as constant. Please explain in details.
In what subject 'endian' concept had and where I study endian concept?
Let R be a relation. Which of the following comments about the relation R are correct ? R will necessarily have a composite key if R is in BCNF but not in 4NF If R is in 3NF and if every key of R is simple, then R is in BCNF If R is in BCNF and if R has at least one simple key , then R is in ... and if its every key is simple, then R is in 5NF a) 1 and 4 b) 2 and 3 c) 1, 2 and 3 d) 1, 2, 3 and 4
Redundancy is dangerous as it is a potentiad threat to data integrity consistency sufficiency both 1 and 2 Answer is 4 but why ?
Consider the following counter. If the initial states of Q0(MSB) and Q1(LSB) are 0. What is the sequence Q0 Q1 given by the following diagram?
In state transition diagram of scheduling if there is transition from running to ready then it will be preemptive scheduling otherwise not?? My doubt is if process request for io then it will move to blocked state and after completion then it will be pushed to ready state and again can go to running the. It also should be preemptive scheduling na !! Plz clear this doubt.
Can a person with B.E chemical do Mtech in CSE through Gate??Which colleges allow and at what rank??
I cannot understand why is option D) incorrect? Can anyone give an example of how in option D) first one can contain duplicate values and second one cannot ? Kindly help me. Thanks in advance
Currently I have retained MTech CSE of iit kanpur one time in round 2 of COAP , and round 3 , i have only got iitK again. I will be retaining iitK again , but now I have retained iitK two times. I want iitMadras but in. Internet I found Iit madras last rank ends upto exactly ... round 4 I got no new offer , then what should I do, retain iitK?? Or Take risk for round 5 ?? What Would You advice ??
I had a doubt regarding one scenario in Go Back N flow control algorithm. Consider the following scenario shown in the image The left hand side is the sender and the right hand side is the reciever. I referred to Kurose Ross Extended FSM Description of GBN sender and reciever ... the entire window(packets 1, 2 and 3). Is this correct? Can such a scenario even occur in real life? Thanks in advance.
Do we have hdlc and ppp protocols(flow and error control) in syllabus?
Given language L = strings starting with 'a'. Sigma(Alphabet) = {a,b} DFA: It should only accept the given language and reject other languages. Therefore only strings starting with 'a' MUST be accepted by the DFA, and the strings starting with 'b' MUST ... and Regular expressions are not correctly defined by me, can you please define all these clearly so that it becomes easy to distinguish them.
consider a direct mapped cache of 8 blocks used to implement the following program segment float a[10][10]; int i; for(i=0;i<10;i++) for(j=0;j<10;j++) a[i][j]=8.0; float element occupies 4 bytes, the block size is 12 bytes and array is stored in row-major form. Find the number of hits. also, if the array was stored in coloumn-major, What the number of hits would’ve been?
What is the output of program? void swap (char *x, char *y) { char *t = x; x = y; y = t; } int main() { char *x = "IGATE"; char *y = "BEST IN CG"; char *t; swap(x, y); printf("(%s, %s)", x, y); t = x; x = y; y = t; printf("\n(%s, %s)", x, y); return ... CG, IGATE) . B: (BEST IN CG, IGATE) (IGATE, BEST IN CG) . C: (IGATE, BEST IN CG) (IGATE, BEST IN CG). D: (BEST IN CG, IGATE) (BEST IN CG, IGATE).
Two processes, P1 and P2, need to access a critical section of code. Consider the following synchronization construct used by the processes: /* P1 */ while (true) { wants1 = true; while (wants2 == true); /* Critical Section */ wants1 = false; } /* ... IT IS WRITTEN PROGRESS IS THERE? In the case when both wants1 and wants2 are true it will indefinitely be postponed then why progress is there?
How is the regular expression (0+1)*0(0+1)*1(0+1)* is equivalent to (0+1)*01(0+1)* ?
We can reduce the space complexity of heapsort to o(1) by using heapify using loops, then why we dont reduce the space complexity of heapify from o(logn) to o(1) by using loops here also.?
Consider the following relation R(XYZ) with X as the primary key and Z as the foreign key referencing X with a delete cascade. X Y Z X1 Y1 X7 X3 Y1 X2 X5 Y4 X3 X2 Y2 X1 X9 Y5 X3 X7 Y3 X8 X4 Y2 X2 Suppose tuple (X2, Y2, X1) is deleted, as a result what will be the number of tuples in R after deletion?
I am getting admission in IIIT Lucknow Mtech in ML. Their course and placements seems awesome. Should I take it as it would be first batch. What are the risks? I cannot give next year gate this was my last attempt and I have 6lpa job. Please suggest immediately.
The value of k at the end of the execution of following program: int increase(int p) { int amount = 0; amount = amount +p; return(amount); } main( ) { int i, j, k; for(i = 0: i < 4; i++) { for( j = 0: j <=i; j++) { k = increase(j); } } } A) 4 B) 10 C) 20 D) 6
A relation R (ABCDE) with functional dependency F= {AB ->CD, A->E, C->D} The decomposition of R into R1(ABC), R2(BCD) and R3(CDE) (i) lossless join (ii) lossy decomposition (iii) dependency preserving (iv) not dependency preserving (A) i & ii (B) i & iv (C) ii & iii (D) ii & iv
can we make DFA for a language where there is comparion between symbols but lanuage is finite a^nb^n;n<=3