Recent activity by Anmol_Binani / GATE Overflow for GATE CSE

0 answers

1

Software Engineering
Can someone please share with me a link from where I can download the proper pdf of the book Software Engineering by K. K. Agarwal. I got a pdf which is like presentation slides. It does not have the content that good as in the books.

Can someone please share with me a link from where I can download the proper pdf of the book Software Engineering by K. K. Agarwal.I got a pdf which is like presentation ...

389 views

asked Sep 1, 2018

18 answers

2

GATE CSE 2017 Set 2 | Question: 44
Two transactions $T_1$ and $T_2$ are given as $T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$ $T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$ where $r_i(V)$ denotes a $\textit{read}$ operation by transaction $T_i$ on a variable $V$ and $w_i(V)$ denotes a ... by transaction $T_i$ on a variable $V$. The total number of conflict serializable schedules that can be formed by $T_1$ and $T_2$ is ______

Two transactions $T_1$ and $T_2$ are given as$T_1:r_1(X)w_1(X)r_1(Y)w_1(Y)$$T_2:r_2(Y)w_2(Y)r_2(Z)w_2(Z)$where $r_i(V)$ denotes a $\textit{read}$ operation by transaction...

72.9k views

commented Jan 18, 2018

5 answers

3

GATE CSE 2015 Set 2 | Question: 41
Consider the following routing table at an IP router: ... $\text{i-b, ii-c, iii-d, iv-e}$ $\text{i-b, ii-c, iii-e, iv-d}$

Consider the following routing table at an IP router:$$\begin{array}{|l|l|l|} \hline \textbf {Network No} & \textbf {Net Mask} & \textbf{Next Hop} \\\hline \text {128.96...

14.5k views

answered Jan 16, 2018

11 answers

4

GATE CSE 2017 Set 1 | Question: 08
Consider the C code fragment given below. typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->next; } p->next = m; } Assuming that m and n ... append list m to the end of list n. cause a null pointer dereference for all inputs. append list n to the end of list m for all inputs.

Consider the C code fragment given below.typedef struct node { int data; node* next; } node; void join(node* m, node* n) { node* p = n; while(p->next != NULL) { p = p->ne...

25.8k views

commented Jan 13, 2018

2 answers

5

#algo
If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in G will encounter exactly one back edge??

If a directed graph G is cyclic but can be made acyclic by removing one edge,then a depth-first search in Gwill encounter exactly one back edge??

556 views

commented Jan 11, 2018

0 answers

6

Test Series
Detailed Solution please..!

Detailed Solution please..!

408 views

commented Jan 5, 2018

0 answers

7

General Question
DFA please.

DFA please.

159 views

asked Jan 5, 2018

0 answers

8

Test Series
How to solve this.. help please.!

How to solve this.. help please.!

118 views

asked Jan 5, 2018

1 answer

9

Test Series
Explain please. Answer given is D

Explain please. Answer given is D

654 views

commented Jan 2, 2018

0 answers

10

Test Series
How to solve this question.?

How to solve this question.?

206 views

asked Jan 2, 2018

0 answers

11

TEst Series
How to solve this question. Please guide.!

How to solve this question. Please guide.!

231 views

asked Jan 2, 2018

0 answers

12

Test Series
How to solve this question in exam.?

How to solve this question in exam.?

290 views

commented Jan 2, 2018

0 answers

13

Test Series
Solution please.!

Solution please.!

315 views

closed Jan 2, 2018

0 answers

14

Test Series
The answer should be 29.6ms right?

The answer should be 29.6ms right?

286 views

commented Jan 2, 2018

0 answers

15

Test Series
Please explain how to solve this question.!

Please explain how to solve this question.!

363 views

commented Jan 2, 2018

0 answers

16

Test Series
What should be the answer.. please explain the solution.!

What should be the answer.. please explain the solution.!

267 views

commented Jan 2, 2018

2 answers

17

ISRO-DEC2017-23
Identify the language generated by the following grammar $S\rightarrow AB\\ A\rightarrow aAb\mid \varepsilon\\ B\rightarrow bB\mid b$ $\{a^m b^n\mid n\geq m,m>0\}$ $\{a^m b^n\mid n\geq m,m\geq0\}$ $\{a^m b^n\mid n> m,m>0\}$ $\{a^m b^m\mid n> m,m\geq0\}$

Identify the language generated by the following grammar$S\rightarrow AB\\ A\rightarrow aAb\mid \varepsilon\\ B\rightarrow bB\mid b$$\{a^m b^n\mid n\geq m,m>0\}$ $\{a^m b...

2.0k views

commented Dec 21, 2017

2 answers

18

ISRO-DEC2017-19
//Consider the program void function(int n) { int i,j,count=0; for(i=n/2;i<=n;i++) for(j=1;j<=n;j=j*2) count++; } The complexity of the program is $O(\log n)$ $O(n^2)$ $O(n^2 \log n)$ $O(n \log n)$

//Consider the program void function(int n) { int i,j,count=0; for(i=n/2;i<=n;i++) for(j=1;j<=n;j=j*2) count++; }The complexity of the program is$O(\log n)$$O(n^2)$$O(n^2...

3.8k views

answered Dec 20, 2017

1 answer

19

general C programming doubt
How to work on such question ? Answer is : 19 #include <stdio.h> int main() { int i = 4, ans; ans = ++i + ++i + ++i; printf("%d\n", ans); return 0; }

How to work on such question ? Answer is : 19#include <stdio.h>int main() { int i = 4, ans; ans = ++i + ++i + ++i; printf("%d\n", ans); return 0;}

428 views

commented Dec 20, 2017

2 answers

20

ME OS
Which of the following scheduling algorithms may cause starvation? S1 : Short remaining time first (SRTF) S2 : Longest remaining time first (LRTF) S3 : Pre-emptive algorithms S4 : First in first out ME ans is S1 and S3 only but LRTF also cause starvation right? please correct me if i m wrong ans: S1 S2 S3 right?

Which of the following scheduling algorithms may cause starvation?S1 : Short remaining time first (SRTF)S2 : Longest remaining time first (LRTF)S3 : Pre-emptive algori...

1.4k views

answered Dec 10, 2017

1 answer

21

DFS back edge
If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?

If a directed graph G is cyclic but can be made acyclic by removing 1 edge then a DFS will encounter exactly 1 Backedge. True or false ?

2.5k views

commented Nov 9, 2017

2 answers

22

Computer Networks
Consider a network system consisting of three networks connected with two routers. Network-A has MTU of 1500 bytes, Network-B has MTU of 620 bytes, Network-C has MTU of 1500 bytes (MTU includes header size). Station-1 needs to send a segment of1380 bytes. The Total size of the packets received at Network-C is _________ bytes if the header size is 20 B.

Consider a network system consisting of three networks connected with two routers. Network-A has MTU of 1500 bytes, Network-B has MTU of 620 bytes, Network-C has MTU of 1...

2.1k views

commented Nov 5, 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