Dark Mode

Answers by Himanshu1

0 votes

1

UGC NET CSE | July 2018 | Part 2 | Question: 86
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ is Z Q R C

answered in Discrete Mathematics Apr 5, 2020

1.5k views

1 vote

2

answered in Calculus Mar 10, 2016

3.5k views

13 votes

3

GATE2012 CY: GA-1
If $(1.001)$^{1259}$= $3.52$ and $(1.001)$^{2062}$= $7.85$, then $(1.001)$^{3321}$= $2.23$ $4.33$ $11.37$ $27.64$

answered in Quantitative Aptitude Feb 21, 2016

2.4k views

150 votes

4

GATE CSE 2016 Set 2 | Question: 33
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.

answered in CO and Architecture Feb 15, 2016

19.0k views

112 votes

5

GATE CSE 2016 Set 2 | Question: 32
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.

answered in CO and Architecture Feb 13, 2016

17.7k views

4 votes

6

In a m*n order Matrix, How many submatrices are possible?
In a m*n order Matrix, How many submatrices are possible?

answered in Linear Algebra Feb 3, 2016

10.0k views

9 votes

7

GATE CSE 2002 | Question: 8
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 ... b. What does the circuit implement?

answered in Digital Logic Jan 26, 2016

3.1k views

35 votes

8

GATE IT 2005 | Question: 52
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 ... $e$ cannot be contained in a cycle. All edges in $G$ have the same weight.

answered in Algorithms Jan 19, 2016

20.5k views

11 votes

9

GATE2013 CE: GA-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. $5$ $10$ $15$ $30$

answered in Quantitative Aptitude Jan 16, 2016

7.9k views

2 votes

10

How should the relation be decomposed so that it is in BCNF ?
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 ... do ABC , then I have C-->A but C is not a superkey in ABC , so how should the decomposition be done ?

answered in Databases Jan 16, 2016

718 views

61 votes

11

GATE IT 2007 | Question: 84
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? $1$ $2$ $3$ $4$

answered in Databases Jan 14, 2016

16.0k views

55 votes

12

GATE CSE 1999 | Question: 21
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).$

answered in Databases Jan 14, 2016

7.9k views

1 vote

13

Final Analysis DIJIKSTRA ALGORITHM
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.

answered in Algorithms Jan 11, 2016

2.0k views

12 votes

14

Aloha
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$

answered in Computer Networks Jan 8, 2016

2.0k views

5 votes

15

Eigenvalues and Eigenvectors
Here answer is B. Can anyone explain this? I am confused with option A and B.

answered in Linear Algebra Jan 7, 2016

5.4k views

1 vote

16

How long does it take for the packet to get to the receiver?
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 ... get to the receiver if the nodes transmit on a "first come first served" basis (in ms) ?

answered in Computer Networks Jan 4, 2016

674 views

3 votes

17

Conflict
If lalr(1) has no conflict then clr(1) never contain any conflict It is true or false If it is false explain

answered in Compiler Design Jan 1, 2016

806 views

2 votes

18

What are the possible values of x and y after completion of the program
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

answered in Operating System Jan 1, 2016

562 views

4 votes

19

Counting number of functions which are neither 1-1 nor onto
Let $A = \left \{1, 2, 3, 4 \right \}$. Number of functions possible on $A$ which are neither $1-1$ nor on-to is _________.

answered in Combinatory Dec 31, 2015

590 views

5 votes

20

Question on combinatorics
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

answered in Combinatory Dec 31, 2015

1.3k views

2 votes

21

Question on counting number of ways scholarship can be distributed
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.

answered in Combinatory Dec 31, 2015

399 views

6 votes

22

What is the correct implementation of UP operation in a binary semaphore
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, it will be forced to sleep again.. Am I missing something, or is the above implementation incorrect ?

answered in Operating System Dec 30, 2015

2.6k views

0 votes

23

What is the approach to find preorder from given inorder?
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

answered in Programming in C Dec 29, 2015

5.6k views

0 votes

24

Solve the problem
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?

answered in Quantitative Aptitude Dec 25, 2015

361 views

0 votes

25

TIFR-2011-Maths-B-15
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

answered in Quantitative Aptitude Dec 23, 2015

580 views

3 votes

26

Drd0 2008 q-11 ch-3 i/o interface
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

answered in CO and Architecture Dec 22, 2015

1.1k views

2 votes

27

maths_mock_test
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}$

answered in Graph Theory Dec 20, 2015

859 views

10 votes

28

Is it lattice
Why is it not lattice?

answered in Set Theory & Algebra Dec 20, 2015

1.2k views

4 votes

29

ER DIAGRAM
I think ans is A,Please Confirm?

answered in Databases Dec 19, 2015

946 views

199 votes

30

GATE IT 2007 | Question: 63
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$ ... mean number of hops per message, assuming all possible router pairs are equally likely is $3$ $4.26$ $4.53$ $5.26$

answered in Computer Networks Dec 19, 2015

18.8k views

Page:

1
2
3
next »