search
Log In

Recent posts tagged gate-cse

5
answer of of 4.12 is c) 10 as in DVR the routers rely completely on their neighbour Routers .So N2 , N4 will send their distance vector to N3 and N3 will find out that in order to reach N1 the option I have are: 1) infinity (from N1)+ 2(N1 N2 distance ) =infinity 2)8 (from N4 )+ 2 (N4 N3 distance)= 10 N3 will choose the minimum of two which is 10.
posted Feb 19 in From GO Admins Lakshman Patel RJIT 26,318 views
16
A $5$ stage pipelined CPU has the following sequence of stages: IF - instruction fetch from instruction memory RD - Instruction decode and register read EX - Execute: ALU operation for data and address computation MA - Data memory access - for write access, the register read ... clock cycles taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$
posted Mar 9, 2017 in Others Dhawal Gajwe 1,469 views
17
Which of the following addressing modes are suitable for program relocation at run time? Absolute addressing Based addressing Relative addressing Indirect addressing I and IV I and II II and III I, II and IV
posted Feb 12, 2017 in Useful Links Anup patel 3,978 views
18
A non-planar graph with minimum number of vertices has $9$ edges, $6$ vertices $6$ edges, $4$ vertices $10$ edges, $5$ vertices $9$ edges, $5$ vertices
posted Dec 28, 2016 in Programming & Data Structures Arjun 3,026 views
19
A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
posted Dec 28, 2016 in Digital Logic Arjun 4,445 views
20
Which of the following problems is not $\text{NP}$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
posted Dec 28, 2016 in Compiler Design Arjun 3,544 views
To see more, click for the full list of questions or popular tags.
...