Dark Mode

Answers by bharti

1 vote

1

Subnetting
Consider a router that interconnects three subnets: Subnet 1, Subnet 2 and Subnet 3. Suppose all of the interfaces in each of these three subnets are required to have the prefix 223.1.17/24. Also, subnet-1 is required to support upto 125 interfaces and subnet-2 and 3 are each required to support upto 60 interfaces Write a feasible set of subnet address / subnet mask pairs?

answered in Computer Networks Jan 9, 2018

6.0k views

7 votes

2

#DBMS What will be the Minimum Number of Tuples?
Say we have two relations R (a,b,c) and S (b,d,e). Now, R has 200 tuples and S has 300 tuples. What will be Minimum number of tuples when we do R ⋈ S ( ⋈ = Natural Join)?

answered in Databases Dec 23, 2017

1.3k views

1 vote

3

compiler
S->SAS | a A->AA | b is the grammar a) LR(0) b)SLR(1) c)LALR(1) d)none

answered in Compiler Design Oct 21, 2017

336 views

4 votes

4

Multilevel Pagetable
Ques. On a System with 32 bit address and 4KB pages how many levels are required in multilevel page table(assuming page table entry is of 4 bytes of storage)? (A). 2 (B). 3 (C). 1 (D) None plz explain the solution

answered in CO and Architecture Oct 18, 2017

3.3k views

0 votes

5

MadeEasy Workbook: Theory of Computation - Finite Automata
Any given transition diagram has an equivalent a) regular expression b) NDFSM c) DFSM d) all of these

answered in Theory of Computation Oct 7, 2017

848 views

0 votes

6

Parameter Passing | GATE 1993 | common data questions 6 marks
Consider the block of code given below: Program PARAM(input,output); var m,n:integer; procedure P(var x,y:integer); var m:integer; begin m:=1; x:=y+1; end; procedure Q(x:integer; var y:integer); begin x:=y+1; end; begin m:=0; P ... of the above 32. What is the scope of m declared in the main program? a)PARAM,P,Q b)PARAM,P c)PARAM,Q d)P,Q

answered in Compiler Design Aug 31, 2017

3.3k views

22 votes

7

GATE IT 2008 | Question: 49
What is the output printed by the following C code? # include <stdio.h> int main () { char a [6] = "world"; int i, j; for (i = 0, j = 5; i < j; a [i++] = a [j--]); printf ("%s\n", a); } dlrow Null string dlrld worow

answered in Programming in C Aug 30, 2017

9.6k views

0 votes

8

Non vectored interrupt.
In non vectored interrupt, the address of ISR is a) assigned to fixed memory location b) obtained from interrupt vector table c) none of the above

answered in CO and Architecture Aug 28, 2017

3.8k views

0 votes

9

#flooding
Two copies of same packet reach the router at same time during flooding. Which one will it accept ?

answered in Computer Networks Aug 27, 2017

399 views

0 votes

10

answered in Programming in C Aug 27, 2017

476 views

2 votes

11

self doubt
how many subsets of a set with 100 elements have more than one element? answer should be 2^(100)-1 ot it should be 2^(100)-101 which one correct?

answered in Combinatory Aug 27, 2017

435 views

9 votes

12

Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 24
A byte addressable computer can support maximum of $2^i$ KB memory and has $2^j$ instructions. An instruction involving $2$ operands and $1$ operator needs how many bits ? $3i$ $2i + j$ $2i + j + 20$ $i + j$

answered in CO and Architecture Aug 25, 2017

295 views

4 votes

13

Test by Bikram | Computer Organization and Architecture | Test 2 | Question: 9
A two word instruction is stored in memory at an address designated by symbol $S$. The address field of the instruction (stored at $S+1$ ... $P = M [S ] + (K + 2)$ $P = (S + 2) + M [ K ]$

answered in CO and Architecture Aug 25, 2017

607 views

11 votes

14

GATE CSE 1995 | Question: 1.25
The minimum number of edges in a connected cyclic graph on $n$ vertices is: $n-1$ $n$ $n+1$ None of the above

answered in Graph Theory Aug 23, 2017

21.0k views

8 votes

15

GATE IT 2008 | Question: 27
$G$ is a simple undirected graph. Some vertices of $G$ are of odd degree. Add a node $v$ to $G$ and make it adjacent to each odd degree vertex of $G$. The resultant graph is sure to be regular complete Hamiltonian Euler

answered in Graph Theory Aug 23, 2017

14.0k views

4 votes

16

TIFR CSE 2014 | Part B | Question: 16
Consider the ordering relation $x\mid y \subseteq N \times N$ over natural numbers $N$ such that $x \mid y$ if there exists $z \in N$ such that $x ∙ z = y$. A set is called lattice if every finite subset has a least upper bound and greatest lower ... $(N, \mid)$ is a complete lattice. $(N, \mid)$ is a lattice but not a complete lattice.

answered in Set Theory & Algebra Aug 19, 2017

5.2k views

0 votes

17

TIFR CSE 2013 | Part B | Question: 4
A set $S$ together with partial order $\ll$ is called a well order if it has no infinite descending chains, i.e. there is no infinite sequence $x_1, x_2,\ldots$ of elements from $S$ such that $x_{i+1} \ll x_i$ and $x_{i+1} \neq x_i$ for all $i$. ... $2^{24}$ words. $W$ is not a partial order. $W$ is a partial order but not a well order. $W$ is a well order.

answered in Set Theory & Algebra Aug 19, 2017

3.2k views

1 vote

18

TIFR CSE 2012 | Part B | Question: 4
Let $\wedge $, $\vee $ denote the meet and join operations of lattice. A lattice is called distributive if for all $x, y, z,$ ... , but not distributive lattice. Distributive lattice. Lattice but not a complete lattice. Under the give ordering positive integers do not form a lattice.

answered in Set Theory & Algebra Aug 19, 2017

4.5k views

4 votes

19

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 Aug 19, 2017

19.1k views

1 vote

20

computer architecture
The flags are affected when conditional CALL or JUMP instructions are executed. True/False

answered in CO and Architecture Aug 18, 2017

571 views

50 votes

21

GATE CSE 1990 | Question: 4-ii
State whether the following statements are TRUE or FALSE with reason: The data transfer between memory and I/O devices using programmed I/O is faster than interrupt-driven I/O.

answered in CO and Architecture Aug 14, 2017

7.5k views

19 votes

22

GATE CSE 2000 | Question: 2.4
A polynomial $p(x)$ satisfies the following: $p(1) = p(3) = p(5) = 1$ $p(2) = p(4) = -1$ The minimum degree of such a polynomial is $1$ $2$ $3$ $4$

answered in Set Theory & Algebra Aug 11, 2017

7.7k views

12 votes

23

GATE IT 2005 | Question: 33
Let $A$ be a set with $n$ elements. Let $C$ be a collection of distinct subsets of $A$ such that for any two subsets $S_1$ and $S_2$ in $C$, either $S_1 \subset S_2$ or $S_2\subset S_1$. What is the maximum cardinality of $C?$ $n$ $n+1$ $2^{n-1} + 1$ $n!$

answered in Set Theory & Algebra Aug 11, 2017

11.8k views

4 votes

24

GATE CSE 1999 | Question: 2.3
Let $L$ be a set with a relation $R$ which is transitive, anti-symmetric and reflexive and for any two elements $a, b \in L$, let the least upper bound $lub (a, b)$ and the greatest lower bound $glb (a, b)$ exist. Which of the following is/are true? $L$ is a poset $L$ is a Boolean algebra $L$ is a lattice None of the above

answered in Set Theory & Algebra Aug 10, 2017

5.6k views

4 votes

25

GATE CSE 2015 Set 3 | Question: 36
Two hosts are connected via a packet switch with $10^7$ bits per second links. Each link has a propagation delay of $20$ microseconds. The switch begins forwarding a packet $35$ microseconds after it receives the same. If $10000$ bits of ... between the transmission of the first bit of data and the reception of the last bit of the data in microseconds is ______.

answered in Computer Networks Jun 24, 2017

32.9k views

3 votes

26

combinatrics
A box contains five set of balls while there are three balls in each set. Each set of balls has one colour which is different from every other set. What is the least number of balls that must be removed from the box in order to claim with certainty that a pair of balls of the same colour has been removed? (a) 6 (b) 7 (c) 9 (d) 11

answered in Quantitative Aptitude May 25, 2017

1.5k views

3 votes

27

Isomorphism and subgraph
If there are two graphs G1 and G2 and both are Isomorphic to each other...Is G1 subset of G2?

answered in Graph Theory May 19, 2017

1.8k views

1 vote

28

structure
Which option is correct? & why?

answered in Programming in C May 17, 2017

269 views

1 vote

29

stack
I think both are True But i m not 100% sure .Please tell if any false? what is base pointer?

answered in DS May 17, 2017

246 views

Page: