Recent activity by parabol / GATE Overflow for GATE CSE

1 answer

1

GO pdf hard copy
Pre booking for GO pdf hardcopy available?

Pre booking for GO pdf hardcopy available?

710 views

commented Jun 2, 2019

5 answers

2

GATE CSE 2015 Set 1 | Question: 40
An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-key operations on a set of data ... if the goal is to achieve the best total asymptotic complexity considering all the operations? Unsorted array Min - heap Sorted array Sorted doubly linked list

An algorithm performs $(\log N)^{\frac{1}{2}}$ find operations , $N$ insert operations, $(\log N)^{\frac{1}{2}}$ delete operations, and $(\log N)^{\frac{1}{2}}$ decrease-...

23.9k views

commented Jan 25, 2019

7 answers

3

GATE CSE 2009 | Question: 58
Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maximally pack them in transit (within the link). Let $I$ be ... before starting transmission of the next frame? (Identify the closest choice ignoring the frame processing time) $16ms$ $18ms$ $20ms$ $22ms$

Frames of $1000\text{ bits}$ are sent over a $10^6$ bps duplex link between two hosts. The propagation time is $25ms$. Frames are to be transmitted into this link to maxi...

30.3k views

commented Jan 19, 2019

0 answers

4

What are the Algorithms which are (from all topics) important for GATE ?
It would be great, if the time complexities associated with them are included.

It would be great, if the time complexities associated with them are included.

372 views

asked Dec 30, 2018

14 answers

5

GATE CSE 2008 | Question: 67
A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level page table is used for virtual to physical address translation, where the virtual address is used as ... tables are respectively $\text{20,20,20}$ $\text{24,24,24}$ $\text{24,24,20}$ $\text{25,25,24}$

A processor uses $36$ bit physical address and $32$ bit virtual addresses, with a page frame size of $4$ Kbytes. Each page table entry is of size $4$ bytes. A three level...

76.8k views

commented Dec 27, 2018

6 answers

6

GATE2018 CE-1: GA-10
Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G \times E)$ and $(D \times E \times F)$ are equal. Which integer among the following choices cannot be represented by the letters $A, B, C, D, E, F \ or \ G?$ A D B G E C F $4$ $5$ $6$ $9$

Each of the letters arranged as below represents a unique integer from $1$ to $9.$ The letters are positioned in the figure such that $(A \times B \times C), (B \times G ...

2.6k views

commented Dec 12, 2018

0 answers

7

DBMS, Made easy practice book
Can primary keys be updated using sql update query? Is such a query accepted/rejected?

Can primary keys be updated using sql update query?Is such a query accepted/rejected?

511 views

commented Dec 12, 2018

2 answers

8

Gateforum Test Series: Programming & DS - Binary Tree
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is? A)C-A-B B)A-B-C C)C-B-A D)Can't be determined from given information.

Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is?A)C-A-BB)A-...

1.4k views

commented Dec 11, 2018

0 answers

9

made_easy_test_2019 (Algorithms)
explain how to solve the above question !

explain how to solve the above question !

541 views

commented Dec 11, 2018

0 answers

10

testbook
explain this i am not able to understand even question. ans is c.

explain this i am not able to understand even question. ans is c.

356 views

commented Dec 11, 2018

0 answers

11

Gateforum Test Series: Digital Logic - Digital Counter
The circuit shown in figure is using one 4-bit BCD counter and one 4-bit binary counter. The MOD value for the counter is ?

The circuit shown in figure is using one 4-bit BCD counter and one 4-bit binary counter. The MOD value for the counter is ?

572 views

commented Dec 11, 2018

0 answers

12

Context Free Languages
Can we claim that a CFL is closed under complementation by transforming it’s NPDA in a way such that it’s non-final states become final states and final states become non-final ?

Can we claim that a CFL is closed under complementation by transforming it’s NPDA in a way such that it’s non-final states become final states and final states become...

222 views

commented Dec 11, 2018

1 answer

13

Ace Test Series
Can any one explain I am not able to understand.

Can any one explain I am not able to understand.

1.1k views

commented Dec 11, 2018

1 answer

14

DCFL Grammar
Equality of languages in DCFL decidable or not???

Equality of languages in DCFL decidable or not???

2.2k views

commented Dec 10, 2018

1 answer

15

Reversal of DFA doubt
in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state

in reversal of DFA if there are more than one final states then which one will be made the initial state? a DFA can have only one initial state

2.3k views

commented Dec 10, 2018

0 answers

16

previous
https://gateoverflow.in/3767/gate2005-it-22 It isn’t mentioned that the fields are atomic then how could answer be 1NF?

https://gateoverflow.in/3767/gate2005-it-22It isn’t mentioned that the fields are atomic then how could answer be 1NF?

424 views

commented Dec 10, 2018

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