1
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ is Z Q R C
1 vote
2
3
If $(1.001)$^{1259}$=$3.52$and$(1.001)$^{2062}$= $7.85$, then $(1.001)$^{3321}$=$2.234.3311.3727.64$121 votes 4 Consider a$3 \ \text{GHz}$(gigahertz) processor with a three stage pipeline and stage latencies$\large\tau_1,\tau_2$and$\large\tau_3$such that$\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________$\text{GHz}$, ignoring delays in the pipeline registers. 82 votes 5 The width of the physical address on a machine is$40$bits. The width of the tag field in a$512$KB$8$-way set associative cache is ________ bits. 4 votes 6 In a m*n order Matrix, How many submatrices are possible? 6 votes 7 Consider the following circuit.$A = a_2a_1a_0$and$B=b_2b_1b_0$are three bit binary numbers input to the circuit. The output is$Z=z_3z_2z_1z_0$. R0, R1 and R2 are registers with loading clock shown. The registers are loaded with their input data with the falling edge of a clock pulse ... b. What does the circuit implement? 27 votes 8 Let$G$be a weighted undirected graph and e be an edge with maximum weight in$G$. Suppose there is a minimum weight spanning tree in$G$containing the edge$e$. Which of the following statements is always TRUE? There exists a cutset in$G$having all edges of maximum ... in$G$having all edges of maximum weight. Edge$e$cannot be contained in a cycle. All edges in$G$have the same weight. 6 votes 9 A firm is selling its product at Rs.$60$per unit. The total cost of production is Rs.$100$and firm is earning total profit of Rs.$500$. Later, the total cost increased by$30\%.$By what percentage the price should be increased to maintained the same profit level.$5101530$2 votes 10 In the relation R(ABCD) , AB-->C , C-->AD How should the table be decomposed so that it is in BCNF , One decomposed relation will be ACD ,what should be other should it be BC , but if it is then there is no functional dependency corresponding to it and if I do ABC , then I have C-->A but C is not a superkey in ABC , so how should the decomposition be done ? 51 votes 11 Consider the$B^+$tree in the adjoining figure, where each node has at most two keys and three links. Keys$K15$and then$K25$are inserted into this tree in that order. Exactly how many of the following nodes (disregarding the links) will be present in the tree after the two insertions?$1234$36 votes 12 Consider a B-tree with degree$m$, that is, the number of children,$c$, of any internal node (except the root) is such that$m \leq c \leq 2m-1$. Derive the maximum and minimum number of records in the leaf nodes for such a B-tree with height$h, h \geq 1$. (Assume that the root of a tree is at height 0). 1 vote 13 Acc. to dijkstra's algorithm: What will be the shortest path from A to B ? 1) When the edge of length 15 is present. 2) when the edge of length 15 is removed. 12 votes 14 You have two computers,$A$and$B$, sharing a wireless network in your room. The network runs the slotted Aloha protocol with equal-sized packets. You want$B$to get twice the throughout over the wireless network as$A$whenever both nodes are backlogged. You configure$A$to send packets with ... of$B$to, in order to achieve your throughout goal?$p/(1+p)p/(1+2p)2p/(1+p)1/2$5 votes 15 Here answer is B. Can anyone explain this? I am confused with option A and B. 1 vote 16 Consider a route in a store and forward network going through 9 intermediate nodes. The packet contains 1100 bits and are transmitted at 64 Kbps. Assume propagation delay over the links are negligible. As a packet travels along the route, it encounters an average of 5 packets when ... take for the packet to get to the receiver if the nodes transmit on a "first come first served" basis (in ms) ? 3 votes 17 If lalr(1) has no conflict then clr(1) never contain any conflict It is true or false If it is false explain 2 votes 18 int x=0,y=0; par begin begin x=1; y=y+x; end begin y=2; x=x+3; end par end what are the possible values of x and y after completion of the program? a. x=1 ,y=2 b.x=1,y=3 c.x=4,y=6 4 votes 19 Let$A = \left \{1, 2, 3, 4 \right \}$. Number of functions possible on$A$which are neither$1-1$nor on-to is _________. 5 votes 20 Given solution of this question: I think that number of 5 elements subsets with 7 should be C(n-1, 4) instead of C(n,4) as we have already fixed 7 so number of elements left will be n-1. Please check 2 votes 21 Given explanation of the question: I believe that in place of last C(8,3) it should be C(7,3) because 3 people have been already chosen before that. Please check whether I am correct or not. 4 votes 22 these are the codes for down and up operations in a binary semaphore. The down operation's code seems to be correct, but I am having some doubt in the UP's code. Suppose a process p1 arrives and executes down. the initial value of "value" is 1. now p1 will ... if p2 wakes up and executes down, it will be forced to sleep again.. Am I missing something, or is the above implementation incorrect ? 0 votes 23 The in-order traversal of a tree resulted in FBGADCE. Then pre-order traversal would result in. a)FGBDECA b)ABFGCDE C)BFGCDEA d)AFGBDEC 0 votes 24 A boy sells apples for 12 cents each and pears for 7 cents each.Suppose the boy collected$3.21.How many apples and pears did he sell?
25
A gardener throws $18$ seeds onto an equilateral triangle shaped plot of land with sides of length one metre. Then at least two seeds are within a distance of $25$ centimetres. TRUE/FALSE
26
In an n- CPU shared bus system, if z is the probability that any CPU requests the bus in a given cycle, the probability that only one CPU uses the bus is given by- A. Nz(1-z)n-1  B. Z(1-z)n-1 C. N(1-z)n D. (N-1)z(1-z)n
1 vote
27
How many labelled sub-graphs of $K_n$ are isomorphic to $W_{n-1}$? (Where $K_n$ : Complete graph with $n$ vertices , $W_n$ : Wheel graph with $n+1$ vertices) 1.$\frac{(n-1)!}{2}$ 2. $\frac{(n-2)!}{2}$ 3. $\frac{n!}{2(n-1)}$ 4. $\frac{n!}{2(n-1)^2}$
A group of $15$ routers is interconnected in a centralized complete binary tree with a router at each tree node. Router $i$ communicates with router $j$ by sending a message to the root of the tree. The root then sends the message back down to router $j$. The mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$