Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User Anmol_Binani
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Anmol_Binani
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.
asked
in
Study Resources
Sep 1, 2018
378
views
is&software-engineering
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 ______
commented
in
Databases
Jan 18, 2018
70.9k
views
gatecse-2017-set2
databases
transaction-and-concurrency
numerical-answers
conflict-serializable
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}$
answered
in
Computer Networks
Jan 16, 2018
14.1k
views
gatecse-2015-set2
computer-networks
subnetting
easy
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.
commented
in
DS
Jan 13, 2018
25.7k
views
gatecse-2017-set1
data-structures
linked-list
normal
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??
commented
in
Algorithms
Jan 11, 2018
540
views
depth-first-search
graph-algorithms
0
answers
6
Test Series
Detailed Solution please..!
commented
in
Digital Logic
Jan 5, 2018
394
views
digital-logic
0
answers
7
General Question
DFA please.
asked
in
Theory of Computation
Jan 5, 2018
161
views
theory-of-computation
0
answers
8
Test Series
How to solve this.. help please.!
asked
in
CO and Architecture
Jan 5, 2018
120
views
co-and-architecture
1
answer
9
Test Series
Explain please. Answer given is D
commented
in
Theory of Computation
Jan 2, 2018
665
views
theory-of-computation
decidability
0
answers
10
Test Series
How to solve this question.?
asked
in
CO and Architecture
Jan 2, 2018
202
views
co-and-architecture
0
answers
11
TEst Series
How to solve this question. Please guide.!
asked
in
CO and Architecture
Jan 2, 2018
229
views
co-and-architecture
0
answers
12
Test Series
How to solve this question in exam.?
commented
in
Mathematical Logic
Jan 2, 2018
293
views
propositional-logic
0
answers
13
Test Series
Solution please.!
closed
in
Theory of Computation
Jan 2, 2018
316
views
theory-of-computation
0
answers
14
Test Series
The answer should be 29.6ms right?
commented
in
Computer Networks
Jan 2, 2018
291
views
computer-networks
0
answers
15
Test Series
Please explain how to solve this question.!
commented
in
Theory of Computation
Jan 2, 2018
363
views
theory-of-computation
turing-machine
0
answers
16
Test Series
What should be the answer.. please explain the solution.!
commented
in
CO and Architecture
Jan 2, 2018
252
views
co-and-architecture
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\}$
commented
in
Theory of Computation
Dec 21, 2017
2.0k
views
isrodec2017
theory-of-computation
context-free-grammar
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)$
answered
in
Programming in C
Dec 20, 2017
3.7k
views
isrodec2017
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; }
commented
in
Programming in C
Dec 20, 2017
433
views
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?
answered
in
Operating System
Dec 10, 2017
1.5k
views
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 ?
commented
in
Programming in C
Nov 9, 2017
2.5k
views
depth-first-search
algorithms
graph-algorithms
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.
commented
in
Computer Networks
Nov 5, 2017
2.1k
views
computer-networks
network
Subscribe to GATE CSE 2024 Test Series
Subscribe to GO Classes for GATE CSE 2024
Quick search syntax
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
Recent Posts
Post GATE 2024 Guidance [Counseling tips and resources]
GATE CSE 2024 Result Responses
[Project Contest] Pytorch backend support for MLCommons Cpp Inference implementation
Participating in MLCommons Inference v4.0 submission (deadline is February 23 12pm IST)
IIITH PGEE 2024 Test Series by GO Classes
Subjects
All categories
General Aptitude
(3.5k)
Engineering Mathematics
(10.4k)
Digital Logic
(3.6k)
Programming and DS
(6.2k)
Algorithms
(4.8k)
Theory of Computation
(6.9k)
Compiler Design
(2.5k)
Operating System
(5.2k)
Databases
(4.8k)
CO and Architecture
(4.0k)
Computer Networks
(4.9k)
Artificial Intelligence
(79)
Machine Learning
(48)
Data Mining and Warehousing
(25)
Non GATE
(1.4k)
Others
(2.7k)
Admissions
(684)
Exam Queries
(1.6k)
Tier 1 Placement Questions
(17)
Job Queries
(80)
Projects
(11)
Unknown Category
(870)
64.3k
questions
77.9k
answers
244k
comments
80.0k
users
Recent Blog Comments
category ?
Hi @Arjun sir, I have obtained a score of 591 in ...
download here
Can you please tell about IIT-H mtech CSE self...
Please add your admission queries here:...