Recent activity by pps121 / GATE Overflow for GATE CSE

5 answers

1

GATE CSE 2007 | Question: 61
Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want to find the employees who get higher salary than anyone in the department $5,$ ... $Q_1$ and $Q_2$ produce the same answer Neither $Q_1$ nor $Q_2$ is the correct query

Consider the table employee(empId, name, department, salary) and the two queries $Q_1, \, Q_2$ below. Assuming that department $5$ has more than one employee, and we want...

26.9k views

commented Jan 19, 2019

1 answer

2

Virtual Gate Test Series: Discrete Mathematics - Graph Theory
Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following: 1. There is a vertex of degree smaller than $8$ in $G.$ 2. There is a vertex such that there are less than $16$ vertices at a distance exactly $2$ from it. Which of the following is TRUE: 1 only 2 only Both 1 and 2 Neither 1 nor 2

Let $G$ be a graph on $n$ vertices with $4n-16$ edges.Consider the following:1. There is a vertex of degree smaller than $8$ in $G.$2. There is a vertex such that there a...

661 views

commented Jan 10, 2019

1 answer

3

doubt
is this preemptive or non-preemptive?

is this preemptive or non-preemptive?

510 views

asked Dec 15, 2018

2 answers

4

Test by Bikram | Mock GATE | Test 2 | Question: 30
Which of the following statements are true? Every totally ordered set is a lattice Every lattice has a least element and a greatest element All totally ordered posets are also well ordered posets. i only ii and iiii only ii only i, ii and iii

Which of the following statements are true?Every totally ordered set is a latticeEvery lattice has a least element and a greatest elementAll totally ordered posets are al...

820 views

commented Dec 14, 2018

0 answers

5

Self doubt
which is/are TRUE: 1)All recursive lang are decidable problems? 2)All decidable problems are recursive language? - is both of them are true? any proof please?

which is/are TRUE:1)All recursive lang are decidable problems?2)All decidable problems are recursive language?- is both of them are true? any proof please?

200 views

asked Dec 8, 2018

3 answers

6

Self doubt in decidability in TOC
Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?

Suppose in question we are given the language is Turing Decidable , can I consider it a CFL or Regular?

649 views

commented Dec 8, 2018

0 answers

7

GATEBOOK
Please mention proper approach to solve similar questions

Please mention proper approach to solve similar questions

596 views

asked Dec 7, 2018

4 answers

8

Identify the type of Grammar
The Grammar E$\rightarrow$ EE | a is LR(1) SLR(1) LR(0) None

The Grammar E$\rightarrow$ EE | a isLR(1)SLR(1)LR(0)None

3.8k views

commented Dec 6, 2018

8 answers

9

GATE CSE 2018 | Question: 54
Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forwarded to an $\textsf{IPv4}$ router that supports a ... that the fragmentation offset value stored in the first fragment is $0$. The fragmentation offset value stored in the third fragment is ________.

Consider an IP packet with a length of $4,500\;\text{bytes}$ that includes a $20\text{-byte}\;\textsf{IPv4}$ header ans $40\text{-byte}$ TCP header. The packet is forward...

19.2k views

commented Dec 6, 2018

2 answers

10

Eigen Vector

1.8k views

commented Dec 6, 2018

1 answer

11

NIELIT Qtn
Consider there are n/logn min heap trees each of size logn. What will be the time complexity to find the smallest element and greatest element in these min heap trees respectively? A) O(n/logn), O(n) B) O(n), O(n/logn) C) O(n), O(n) D) O(logn), O(logn)

Consider there are n/logn min heap trees each of size logn. What will be the time complexity to find the smallest element and greatest element in these min heap trees res...

553 views

comment edited Dec 2, 2018

0 answers

12

NIELIT Qtn
Consider the following possible outcomes of executing a Turing machine over a given input. Which of the following outcome is NOT possible? A)TM halts and accepts the input B)TM halts and rejects the input C)TM hangs and accepts the input D)TM never halts.

Consider the following possible outcomes of executing a Turing machine over a given input. Which of the following outcome is NOT possible?A)TM halts and accepts the input...

263 views

commented Dec 2, 2018

1 answer

13

What is the exact difference between total recursive function, primitive recursive function, partial recursive function?

1.2k views

answered Nov 30, 2018

1 answer

14

ox cs education
alternate definition of semi decidable Definition: an enumerator for a language L ⊂ Σ ∗ is a TM that writes on its output tape #x1#x2#x3# . . . and L = {x1, x2, x3, . . .}. pleasee elaborate this http://www.cs.ox.ac.uk/people/paul.goldberg/FCS/slides3.pdf

alternate definition of semi decidableDefinition: an enumerator for a language L ⊂ Σ ∗ is a TM that writes on its output tape #x1#x2#x3# . . . and L = {x1, x2, x3, ....

283 views

answered Nov 14, 2018

2 answers

15

Test by Bikram | Databases | Test 2 | Question: 17
Which of the following is TRUE about the given schedule S? ... is conflict serializable. It is view serializable but not conflict serializable. It is conflict serializable but not view serializable. It is not serializable.

Which of the following is TRUE about the given schedule S?$\begin{array}{|c|c|} \hline \text{Schedule:} & S \\ \hline T1 & T2 \\ \hline R(A) & {} \\ \hline A=A+100 & {} ...

486 views

commented Oct 11, 2018

1 answer

16

Test by Bikram | Databases | Test 2 | Question: 10
We are using timestamp-based concurrency control, and there are two transactions T1 and T2 with timestamps 100 and 200, respectively. The following schedule is executed in the order shown below using time stamping protocols: ... Basic Timestamp Ordering Protocol and Thomas Write Rule, but is allowed under Multi-version Timestamp Ordering Protocol.

We are using timestamp-based concurrency control, and there are two transactions T1 and T2 with timestamps 100 and 200, respectively.The following schedule is executed in...

920 views

commented Oct 11, 2018

0 answers

17

number system
How to convert a floating point number from Number system X to Number system Y? Ex: Given a number .75, I need to convert to base 9, say. Please help.

How to convert a floating point number from Number system X to Number system Y? Ex: Given a number .75, I need to convert to base 9, say. Please help.

333 views

commented Aug 6, 2018

1 answer

18

IIT Kanpur Interview Question
In which segment of memory layout the information about dynamic linked libraries is stored?

In which segment of memory layout the information about dynamic linked libraries is stored?

714 views

answered May 14, 2017

8 answers

19

MadeEasy Test Series: Algorithms - Shortest Paths
Consider the following statements For every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to $t$. At the termination of the Bellman-ford algorithm, ... shortest path is found for a vertex for which shortest path is well-defined. Which of the above statements are true?

Consider the following statementsFor every weighted graph and any two vertices $s$ and $t$, Bellman-Ford algorithm starting at $s$ will always return the shortest path to...

4.4k views

comment edited Feb 5, 2017

1 answer

20

Digital Counters
Q..A 4 bit Counter having flip-flops with identical propagation delay time of 50ns will have maximum frequency limit of ____ MHZ??? My question is how to know wheather the question is talking about Synchronous counter or Asynchronous counter??? For Sync. it will be 1/50ns for Async. it will be 1/(4*50)ns which obe to take?????

Q..A 4 bit Counter having flip-flops with identical propagation delay time of 50ns will have maximum frequency limit of ____ MHZ???My question is how to know wheather the...

751 views

answered Jan 31, 2017

2 answers

21

Virtual Gate Test Series: Digital Logic - Counter

663 views

commented Jan 31, 2017

3 answers

22

Test by Bikram | Mock GATE | Test 1 | Question: 30
A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, $10$ $ns$ are required to access it. If it is main memory but not in the cache, total $200$ $ns$ are needed to load it ... is found in the given level of the memory hierarchy. $732000$ $ns$ $485750$ $ns$ $500012$ $ns$ $23009$ $ns$

A computer has a cache, main memory, and a disk used for virtual memory. If a referenced word is in the cache, $10$ $ns$ are required to access it. If it is main memory b...

785 views

answered Jan 30, 2017

1 answer

23

Test by Bikram | Mock GATE | Test 1 | Question: 54
A pipeline system has $4$ stages and each stage takes $10ns$. $30\%$ instructions are branch-instructions and branch-instruction introduce a delay of $3$ stall cycles. The speed-up factor compared to same non-pipelined environment if there are $100000$ instructions to be executed is ___________.

A pipeline system has $4$ stages and each stage takes $10ns$.$30\%$ instructions are branch-instructions and branch-instruction introduce a delay of $3$ stall cycles. The...

1.3k views

commented Jan 28, 2017

2 answers

24

Test by Bikram | Mock GATE | Test 1 | Question: 16
Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision? $0.123$ $0.145$ $0.800$ $0.750$

Hash a list of $3$ keys into hash table with $20$ locations. What will be the probability of the event $A$ in which hashing the three keys causes a collision?$0.123$$0.14...

888 views

answered Jan 28, 2017

1 answer

25

Test by Bikram | Mock GATE | Test 1 | Question: 5
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

Which of the following statements is $FALSE$ regarding a bridge:Bridge is a layer $2$ deviceBridge reduces collision domainBridge is used to connect two or more $LAN$ seg...

877 views

commented Jan 27, 2017

1 answer

26

Test by Bikram | Mock GATE | Test 1 | Question: 4
Which of the following statements is $TRUE$ about $CSMA/CD$: $IEEE$ $802.11$ wireless $LAN$ runs $CSMA/CD$ protocol Ethernet is not based on $CSMA/CD$ protocol $CSMA/CD$ is not suitable for a high propagation There is no contention in a $CSMA/CD$ network

Which of the following statements is $TRUE$ about $CSMA/CD$:$IEEE$ $802.11$ wireless $LAN$ runs $CSMA/CD$ protocolEthernet is not based on $CSMA/CD$ protocol$CSMA/CD$ is ...

656 views

commented Jan 27, 2017

1 answer

27

Virtual Gate Test Series: CO & Architecture - Cache Access
my question is even in case of a miss the cache will still be accessed and then main memory, right? please explain this when to consider higher memory level access time and when not to consider it

my question is even in case of a miss the cache will still be accessed and then main memory, right? please explain this when to consider higher memory level access time a...

311 views

answered Jan 26, 2017

1 answer

28

Virtual Gate Test Series: Algorithms - Recurrence Relation

306 views

asked Jan 25, 2017

9 answers

29

GATE CSE 2016 Set 1 | Question: 38
Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$ ... integer value of $x$, for which at least one shortest path between some pair of vertices will contain the edge with weight $x$ is ___________.

Consider the weighted undirected graph with $4$ vertices, where the weight of edge $\{i,j\}$ is given by the entry $W_{ij}$ in the matrix $W$. W=$\begin{bmatrix} 0&2 &8 &...

24.0k views

commented Jan 20, 2017

0 answers

30

CO Doubt
Cache Doubt

Cache Doubt

193 views

asked Jan 17, 2017

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