Recent activity by Himanshu555 / GATE Overflow for GATE CSE

1 answer

1

GO Classes 2023 | IIITH Mock Test 1 | Question: 22
Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$ If the network follows link state routing algorithm to determine next hop for least cost path then which constraints on $x$ and $y$ guarantee traffic from $\text{B}$ to $\text{C}$ will always flow through node $\text{A}?$ $x>4$ $y+x<6$ $y+x<4$ $x<4$

Consider the network given below with routers $\text{A, B, C, D}$ and $\text{E}.$If the network follows link state routing algorithm to determine next hop for least cost ...

728 views

answered Mar 27, 2023

2 answers

2

Applied test series
We know that the paging scheme suffers from internal fragmentation. S1 : If the CPU attempts to access the unused portion of the last page, the valid/invalid bits will block such accesses. S2 : A possible solution to handle the internal fragmentation issue is to use multiple page sizes. can anyone plz explain me this ? we have to select from s1 and s2 which is correct

We know that the paging scheme suffers from internal fragmentation.S1 : If the CPU attempts to access the unused portion of the last page, the valid/invalid bits will blo...

465 views

answered Jan 12, 2023

1 answer

3

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

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} + \...

689 views

answered Dec 10, 2022

1 answer

4

UGC NET CSE | October 2022 | Part 1 | Question: 87
Consider the following algorithms and their running times : Algorithms Complexities (A) Breadth First Search (I) $\theta(v+E)$ (B) Rabin-Karp Algorithm (II) $O(v+E)$ (C) Depth-First Search (III) $\theta((n-m-1) m)$ (D) Heap sort (worst case) (IV) $O\left(n^2\right)$ (E) ... $\text{(A)-(III), (B)-(I), (C)-(II), (D)-(IV), (E)-(V)}$

Consider the following algorithms and their running times :AlgorithmsComplexities(A) Breadth First Search(I) $\theta(v+E)$(B) Rabin-Karp Algorithm(II) $O(v+E)$(C) Depth-F...

303 views

answered Nov 12, 2022

2 answers

5

mde esy test series
Which of the following statements is/are true? A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree. B. In a labelled undirected connected simple graph, G, all the breadth first search from same node form same ... is descendent of u in all possible depth-first search forest of G. (u.d is discover time of node u in DFS).

Which of the following statements is/are true?A. In a labelled undirected connected simple graph G, all the depth-first search from same node form same tree.B. In a label...

626 views

commented Nov 8, 2022

1 answer

6

Made easy test
i=10 j=1 a=i*j b=i+j if a<=b goto 3 else goto 8 a=a+1 i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the above code?

i=10j=1a=i*jb=i+jif a<=b goto 3else goto 8a=a+1i=i-1 goto 2 Include start and end nodes Find the number of nodes and edges in the control flow graph of the...

2.0k views

commented Oct 30, 2022

1 answer

7

Theory of Computation
State True or False. All Linear languages are non-deterministic context free language.

State True or False. All Linear languages are non-deterministic context free language.

781 views

answered Oct 28, 2022

1 answer

8

Throughput of Scheduling algorithm
How do we measure the throughput of a scheduling algorithm? In every algorithm,the total time will be the sum of the burst times..and the same number of tasks will get executed in that time.? In that case how do we determine which one has maximum throughput?

How do we measure the throughput of a scheduling algorithm? In every algorithm,the total time will be the sum of the burst times..and the same number of tasks will get ex...

11.0k views

commented Oct 27, 2022

1 answer

9

Computer Networks (Routing Algorithm)
St.No. Routing Protocols Persistent looping Count to infinity problem I Distance vector routing protocol (DVRP) Yes Yes II Split horizon in DVR No Yes III Split horizon with poison reverse in DVR No No IV Link State Routing Protocol (LSRP) No No Which ... as Persistent looping and count to infinity are the same thing. Only IV II and IV All of I,II,III and IV

St.No.Routing ProtocolsPersistent loopingCount to infinity problemIDistance vector routing protocol (DVRP)YesYesIISplit horizon in DVRNoYesIIISplit horizon with poison re...

951 views

commented Oct 26, 2022

3 answers

10

GATE Overflow | Compiler Design | Test 1 | Parsing | Question: 5
Which of the following statements regarding $LR(0)$ parser is FALSE? A $LR(0)$ configurating set cannot have multiple reduce items A $LR(0)$ configurating set cannot have both shift as well as reduce items If a reduce item is ... a $LR(0)$ configurating set it cannot have any other item A $LR(0)$ parser can parse any regular grammar

Which of the following statements regarding $LR(0)$ parser is FALSE?A $LR(0)$ configurating set cannot have multiple reduce itemsA $LR(0)$ configurating set cannot have ...

3.2k views

commented Oct 26, 2022

0 answers

11

made easy test series
Caption

Caption

401 views

commented Oct 24, 2022

1 answer

12

Applied Gate Test Series
How to solve this?

How to solve this?

740 views

commented Oct 16, 2022

16 answers

13

GATE CSE 2015 Set 3 | Question: 5
The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ________.

The number of $4$ digit numbers having their digits in non-decreasing order (from left to right) constructed by using the digits belonging to the set $\{1, 2, 3\}$ is ___...

15.7k views

answered Aug 11, 2022

0 answers

14

TOC doubt
How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countable? Please explain I am getting confused in this.

How a language which is not recursively enumerable is uncountable,because as we know every language is a subset of sigma(input alphabet) star which is known to be countab...

172 views

commented Aug 5, 2022

4 answers

15

GATE CSE 1998 | Question: 10b
Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m < n$ and $R^m = R^n$.

Let $R$ be a binary relation on $A = \{a, b, c, d, e, f, g, h\}$ represented by the following two component digraph. Find the smallest integers $m$ and $n$ such that $m <...

4.3k views

commented Aug 5, 2022

1 answer

16

Class Practice Question | Thomas Write Rule | Basic Time Stamp | Unacademy
Which of the following time stamp ordering protocol(s) allow(s) the following schedule? S: W1(A), W2(A), W3(A), R2(A), R4(A); Time Stamps: T1:5, T2:10, T3:15, T4:20 Tomas Write Rule Basic Time Stamp Only 1 Only 2 Both 1 and 2 Neither 1 nor 2 Please describe your answer.

Which of the following time stamp ordering protocol(s) allow(s) the following schedule?S: W1(A), W2(A), W3(A), R2(A), R4(A);Time Stamps: T1:5, T2:10, T3:15, T4:20Tomas Wr...

260 views

answered Jul 27, 2022

0 answers

17

Gate@Zeal Test series 2022
column major order formula would be a+w*[(E3L2+E2)L1+E1] if i solve getting ans 1956 but given 1513 for 3d array. Please explain how

column major order formula would bea+w*[(E3L2+E2)L1+E1] if i solve getting ans 1956 but given 1513 for 3d array. Please explain how

479 views

commented Jul 26, 2022

2 answers

18

MADE EASY TEST SERIES
Consider the following relations and query given below: Emp( Id, Name, Sex, Salary) Proj(No, Name, Dno) and Works_on(No, IDs) contains atleast one tuples. Consider the following query: Select Name From Emp Where NOT Exists ((Select No From Proj where Dno = 106) EXCEPT (select No from works_on where Id = IDs)); What does this query return?

Consider the following relations and query given below:Emp( Id, Name, Sex, Salary)Proj(No, Name, Dno) andWorks_on(No, IDs) contains atleast one tuples.Consider the follow...

526 views

answered Jun 22, 2022

1 answer

19

MadeEasy Full Length Test 2019: Operating System - Process Schedule

1.3k views

answered May 29, 2022

1 answer

20

MadeEasy Test Series: Operating System - Resource Allocation
Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which system is guaranteed to be deadlock-free ... Similar to https://gateoverflow.in/220031/deadlock. It seems many answers are possible and no proper explanation is present.

Consider two processes P1 and P2, each needed 3 resources 1, 2 and 3 in a database. If each processes ask them in any order, then the number of ways possible in which sys...

1.1k views

answered May 28, 2022

1 answer

21

Applied Test Series
It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mutual exclusion. Initial value of M is 1. The value of M is decremented by any process ... = 1, E = 7, F = 0 Out of the four combinations given above, the total number of combinations which cannot exist is ____

It is given that in a system, processes P and C communicate by means of 3 semaphores and one buffer. The buffer size is given as 10. A semaphore M is used to implement mu...

658 views

answered May 24, 2022

2 answers

22

GATE IT 2008 | Question: 22
Which of the following is the negation of $[∀ x, α → (∃y, β → (∀ u, ∃v, y))]$ $[∃ x, α → (∀y, β → (∃u, ∀ v, y))]$ $[∃ x, α → (∀y, β → (∃u, ∀ v, ¬y))]$ $[∀ x, ¬α → (∃y, ¬β → (∀u, ∃ v, ¬y))]$ $[∃ x, α \wedge (∀y, β \wedge (∃u, ∀ v, ¬y))]$

Which of the following is the negation of $[∀ x, α → (∃y, β → (∀ u, ∃v, y))]$$[∃ x, α → (∀y, β → (∃u, ∀ v, y))]$$[∃ x, α → (∀y, β → ...

7.8k views

commented Jun 23, 2020

tags	tag:apple
author	user:martin
title	title:apple
content	content:apple
exclude	-tag:apple
force match	+apple
views	views:100
score	score:10
answers	answers:2
is accepted	isaccepted:true
is closed	isclosed:true