Dark Mode

Recent activity by Aditya_

7 answers

1

GATE CSE 2019 | Question: 40
Consider the following statements: The smallest element in a max-heap is always at a leaf node The second largest element in a max-heap is always a child of a root node A max-heap can be constructed from a binary search tree in $\Theta(n)$ time A binary search tree ... time Which of the above statements are TRUE? I, II and III I, II and IV I, III and IV II, III and IV

edited in DS Jan 27

15.6k views

0 answers

2

Linear Algebra, Vectors
Find equation of a line passes through the points = (0, 1, 2) and = (-1, 1, 1).

recategorized in Linear Algebra Jan 13

57 views

0 answers

3

Linear Algebra, Vectors
What is the equation of the plane that contains point (-2, 4, 5) and the vector (7, 0, -6) is normal to the plane? And check if this plane intersects the y-axis.

retagged in Linear Algebra Jan 13

66 views

2 answers

4

GATE CSE 1999 | Question: 2.4
If $L1$ is context free language and $L2$ is a regular language which of the following is/are false? $L1-L2$ is not context free $L1 \cap L2$ is context free $\sim L1$ is context free $\sim L2$ is regular

answer edited in Theory of Computation Jan 12

9.9k views

1 answer

5

number system
The decimal equivalent value of given 2's complement number 101001.10 is A -20.5 B -23.5 C -22.5

commented in Digital Logic Jan 5

90 views

0 answers

6

Set Theory Test Series Question
Statement 1: If $A\subseteq B$ and $B \subseteq A$ then $A= B$ Statement 2: If $A= B$ then $A\subseteq B$ or $B \subseteq A$ Which of these statements are true? Statement 1 is standard definition of Equivalence of 2 sets, so always true. Statement 2 seems to be true but I am not sure.

commented in Set Theory & Algebra Jan 4

90 views

0 answers

7

graph theory
Let $G=(V,E)$ where $V=\left \{ 1,2,3,4,.....,150\right \}$ and $(u,v) \in E$ if either $(u mod v) =0$ or $(v mod u)=0$.The Chromatic number of G is ?

commented in Graph Theory Jan 4

141 views

2 answers

8

Floating point representation
What is the 16 bits pattern which represent (-13.5) in normalized signed magnitude fraction . S = 1 bit , Exponent = 7 bits , Mantissa = 8 bits . Represent it in hexadecimal also.

commented in Digital Logic Jan 2

359 views

4 answers

9

GATE CSE 2021 Set 2 | Question: 53
Consider a pipelined processor with $5$ stages, $\text{Instruction Fetch} (\textsf{IF})$, $\text{Instruction Decode} \textsf{(ID)}$, $\text{Execute } \textsf{(EX)}$, $\text{Memory Access } \textsf{(MEM)}$ ... $\textit{Speedup} $ achieved in executing the given instruction sequence on the pipelined processor (rounded to $2$ decimal places) is _____________

commented in CO and Architecture Dec 31, 2022

8.3k views

0 answers

10

Choosing prime implicants in K-maps
I got a K-map with the following boolean function: F(A,B,C,D) = ΠM[3,4,6,9,11,14]+ Σd[0,7,8,10,13,15] In the following K-map following prime-implicants are considered: But I can chose ($\bar{A}$+$\bar{D}$) instead of ($\bar{A}$+$B$) like: So now ... $\bar{C}$+$\bar{D}$)($A$+$C$+$D$) So we get different f in the two cases or am I making a mistake somewhere?

commented in Digital Logic Dec 28, 2022

77 views

1 answer

11

parse tree - context-free grammars - TOC
Given a CFG and a string, what is the relation between the number of leftmost derivations, the number of rightmost derivations and the number of parse trees?

answer edited in Theory of Computation Dec 28, 2022

473 views

2 answers

12

GATE CSE 2008 | Question: 11
Which of the following describes a handle (as applicable to LR-parsing) appropriately? It is the position in a sentential form where the next shift or reduce operation will occur It is non-terminal whose production will be used for reduction in the ... in the next step along with a position in the sentential form where the right hand side of the production may be found

answer edited in Compiler Design Dec 28, 2022

11.1k views

4 answers

13

GATE CSE 2005 | Question: 68
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 ... taken to complete the above sequence of instructions starting from the fetch of $I_1$? $8$ $10$ $12$ $15$

comment edited in CO and Architecture Dec 27, 2022

37.4k views

4 answers

14

GATE CSE 2000 | Question: 1.8
Comparing the time T1 taken for a single instruction on a pipelined CPU with time T2 taken on a non-pipelined but identical CPU, we can say that T1 ≤ T2 T1 ≥ T2 T1 < T2 T1 and T2 plus the time taken for one instruction fetch cycle

answer edited in CO and Architecture Dec 27, 2022

9.5k views

0 answers

15

kenneth h rosen chapter 6
What is the closed form for the generating function for the sequence : 0,1,-2,4,-8,16,-32,64,...

closed in Combinatory Dec 23, 2022

126 views

1 answer

16

Unacademy All India Mock 18 Dec. 2022.Counting
Let S={0,1,2,3,….,9}. The number of subsets of 5 contains at least two even numbers? HELP ANYONE Ans.-832

answered in Set Theory & Algebra Dec 19, 2022

246 views

4 answers

17

GATE CSE 2021 Set 1 | Question: 45
Consider two hosts $P$ and $Q$ connected through a router $R$. The maximum transfer unit $\text{(MTU)}$ value of the link between $P$ and $R$ is $1500$ bytes, and between $R$ and $Q$ is $820$ bytes. A $\text{TCP}$ segment ... to resend the whole $\text{TCP}$ segment. $\text{TCP}$ destination port can be determined by analysing $\textit{only}$ the second fragment.

retagged in Computer Networks Dec 17, 2022

5.8k views

18 answers

18

GATE CSE 2009 | Question: 57, ISRO2016-75
Frames of $\text{1000 bits}$ are sent over a $10^6$ $\text{bps}$ duplex link between two hosts. The propagation time is $\text{25 ms}$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the ... ? Assume that no time gap needs to be given between transmission of two frames. $I=2$ $I=3$ $I=4$ $I=5$

answer edited in Computer Networks Dec 17, 2022

39.2k views

4 answers

19

GATE CSE 2005 | Question: 84a
We are given $9$ tasks $T_1, T_2, \dots, T_9$. The execution of each task requires one unit of time. We can execute one task at a time. Each task $T_i$ has a profit $P_i$ and a deadline $d_i$. Profit $P_i$ is earned if the task is completed before ... profit? All tasks are completed $T_1$ and $T_6$ are left out $T_1$ and $T_8$ are left out $T_4$ and $T_6$ are left out

answer edited in Algorithms Dec 16, 2022

11.1k views

6 answers

20

GATE IT 2005 | Question: 28
Which of the following statements is FALSE regarding a bridge? Bridge is a layer $2$ device Bridge reduces collision domain Bridge is used to connect two or more LAN segments Bridge reduces broadcast domain

answer edited in Computer Networks Dec 15, 2022

8.4k views

0 answers

21

Since it is already in 3NF, why decompose further?
Since the schema is already in 3NF we can keep the relations to 1, cant we? If you think the answer is different please explain how

comment edited in Databases Dec 15, 2022

86 views

0 answers

22

Calcutta University Question Paper
Consider a relation r1(A, B, C), r2(C, D, E) and r3(E, G) with primary keys A, C and E respectively. Assume that r1 has 1000 tuples, r2 has 1500 tuples and r3 has 750 tuples. The number of resultant tuple in are

comment edited in Databases Dec 15, 2022

137 views

0 answers

23

#TCP/IP
What is the maximum size of data that the Network layer can forward to the Data link layer on the TCP layer, including header data? Any size 65,535 bytes 65,515 bytes 1500 bytes This question has been asked before but given answers don't explain reasoning ... can send 65,535 Bytes data when data link layer cannot have more than 1500 Bytes and fragmentation cannot happen at data link layer.

comment edited in Computer Networks Dec 14, 2022

90 views

1 answer

24

paging
Can anyone diagrammatically explain what is the difference between Page size vs Page table entry size in a page table?

comment edited in Operating System Dec 13, 2022

201 views

1 answer

25

First Order Logic: [email protected] Test series

answer selected in Mathematical Logic Dec 12, 2022

190 views

1 answer

26

Unacademy AIMT - 1
What is the minimized expression for the following k-map? $AB + \bar{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \overline{BCD}$ $AB + \overline{AB}C + \bar{A}CD + A\bar{C}D + AC\bar{D} + \bar{B}\bar{C}\bar{D}$ None of these

comment edited in Digital Logic Dec 11, 2022

260 views

1 answer

27

Probability Doubt
The expected number of times a 6 appears when a fair die is rolled 10 times is equal to?

edited in Probability Dec 10, 2022

156 views

0 answers

28

COA Doubt
What is the bandwidth of the memory , if access time and settling time of main memory are 45 ns and 5 ns respectively ? 20 Hz 20 KHz 20 MHz 50 MHZ

comment edited in CO and Architecture Dec 10, 2022

128 views

1 answer

29

Database | BCNF
Consider the following relation, R(A,B,C) and the following functional dependencies FD={ A→B, B→C, C→A }. Consider the following statements Statement I: The following relation is in BCNF, as A,B and C are key. Statement II: A prime attribute cannot be ... I and II both are correct. None of statement I and II is correct Only statement II is correct. Only statement I is correct.

comment edited in Databases Dec 10, 2022

131 views

1 answer

30

ace academy ToC
I don’t get the explanation, How do you categorize grammer on the basis of production?

answered in Theory of Computation Dec 4, 2022

158 views