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 Akash Mittal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by Akash Mittal
1
answer
1
#CN #selfdoubt
what is difference between RTT and Total Time?
commented
in
Computer Networks
Jan 15, 2018
152
views
1
answer
2
made easy test series
commented
in
Theory of Computation
Jan 7, 2018
318
views
0
answers
3
IP header
Shouldn't ans be 40 B
commented
in
Computer Networks
Jan 7, 2018
240
views
computer-networks
2
answers
4
BST(Test Series)
Consider a Binary Search Tree is created using element 1 to n in following order: 3, 2, 1, 6, 5, 4, 9, 8, 7, 12, 11, 10, ....., n – 3, n – 4, n – 5, n – 2, n – 1, n What is the worst time complexity of searching a number in the Binary Search Tree?
commented
in
DS
Jan 3, 2018
616
views
data-structures
binary-search-tree
made-easy-test-series
1
answer
5
Conflict equivalent
Find the number of conflict equivalent schedule: $r_{1}\left ( x \right ),w_{1}\left ( y \right ),w_{1}\left ( z \right ) , r_{2}\left ( x \right ),w_{2}\left ( y \right ),w_{2}\left ( z \right )$
commented
in
Databases
Jan 3, 2018
979
views
conflict-serializable
1
answer
6
test Q
main(){ static int n[3][3] = {2,4,3,6,8,5,3,5,1}; Int i,j; for(i=2;i>=0;i--){ for (j=2;j>=0;j--){ printf(“%d ”,*(*(n+i)+j)); } } What will be the output of the program?
answered
in
Programming
Jan 2, 2018
180
views
0
answers
7
Test Series
What should be the answer.. please explain the solution.!
commented
in
CO and Architecture
Jan 2, 2018
100
views
co-and-architecture
2
answers
8
pipelining
We have two designs P 1 and P 2 for a synchronous pipeline processor. P1 has 8 pipeline stages with execution time of 3 nsec, 2 nsec, 4 nsec, 7 nsec, 2 nsec, 5 nsec, 4 nsec and 2 nsec while design P2 has 5 stages each with 6 nsec execution time. How much time can be saved using design P2 over design P1 for executing 400 instructions?
answered
in
CO and Architecture
Jan 2, 2018
814
views
co-and-architecture
pipelining
1
answer
9
GRAPH THEORY
A graph G=(V,E)satisfies |E|≤3|v|-6, the min degree of G is defined asmin{degree(v) } v∈V. Therefore min degree of ‘G’ can be? A. 11 B. 4 C. 6 D. 5
commented
in
Graph Theory
Dec 30, 2017
343
views
graph-theory
discrete-mathematics
0
answers
10
Relation- Reflexive Irreflexive
$Let A = \{ 1,2,3\}\\ R = \{\{1,1\},\{2,2\},\{2,3\}\}$ Is the above relation neither reflexive nor irreflexive?
commented
in
Set Theory & Algebra
Dec 28, 2017
514
views
discrete-mathematics
set-theory&algebra
relations
0
answers
11
Ace Test Series: Computer Networks - Congestion Control
commented
in
Computer Networks
Dec 27, 2017
273
views
ace-test-series
computer-networks
congestion-control
0
answers
12
#matrix
Let A be a 4 × 4 matrix with real entries such that -1, 1, 2, -2 are its eigen values. If B = A4 - 5A2 + 5I where I denotes 4 × 4 identity matrix, then which of the following is correct? (det(X) represents determinant of X) (A) det(A + B) = 0 (B) det(B) = 1 (C) trace of A + B is 4 (D) all of these
commented
in
Linear Algebra
Dec 27, 2017
1.8k
views
0
answers
13
#graph
commented
in
Graph Theory
Dec 26, 2017
151
views
0
answers
14
#matrix
commented
in
Linear Algebra
Dec 25, 2017
166
views
0
answers
15
#matrix
1). If the row reduced form of a matrix has more than two non-zero entries in any row, then the corresponding system of equations has inifinitely many solutions. 2). If the row reduced form of a matrix has more than two non-zero entries in any row. then the corresponding system of equations either has infinitely many solutions or no solutions. T/F?
commented
in
Linear Algebra
Dec 25, 2017
248
views
1
answer
16
congestion control
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a time-out occurs, ... to send first full window of 18 KB is____________ (in msec). Assume window size at the start of slow start phase is 2 KB.
answered
in
Computer Networks
Dec 24, 2017
220
views
1
answer
17
#COMBINATORY
answered
in
Combinatory
Dec 23, 2017
155
views
0
answers
18
Ace test series question on scheduling policy
which scheduling policy is starvation free? A) LIFO B) FIFO C) SJF D)PRIORITY
commented
in
Operating System
Dec 23, 2017
426
views
2
answers
19
graph theory
Maximum no of edges in a triangle-free, simple planar graph with 10 vertices
answered
in
Graph Theory
Dec 23, 2017
649
views
graph-theory
discrete-mathematics
graph-connectivity
graph-matching
engineering-mathematics
0
answers
20
Ace Test series: CO & Architecture - Pipelining
Consider the following program which is executed on $4$ stage pipelined processor. IF=$2$ clocks/word ID=$2$ clocks/word EX stage takes $2$ clocks for register operands and $3$ clocks for memory operand WR stage takes ... Minimum number of clocks needed to complete the above program is _________________ Note:Pipeline stage sequence is IF,ID,EX and WR
commented
in
CO and Architecture
Dec 22, 2017
671
views
ace-test-series
co-and-architecture
pipelining
1
answer
21
fork
#include<stdio.h> #include<unistd.h> int main() { for(i=0;i<2;i++) { if(fork()==0) printf("hello"); } }
commented
in
Operating System
Dec 22, 2017
3.4k
views
fork-system-call
1
answer
22
combinatorics
In how many different ways can 8 identical balls be distributed among three children if each receives at least two balls and no more than four balls ________? A 3 B 9 C 6 D 12
answered
in
Mathematical Logic
Dec 22, 2017
354
views
discrete-mathematics
1
answer
23
DOUBTS
Plz solve Question 6.what will be it's output
commented
in
Programming
Dec 22, 2017
246
views
programming-in-c
functions
3
answers
24
Is the following language CFL?
Not able to understand whether it is CFL or not due to the condition 'm>=481'.
answered
in
Theory of Computation
Dec 22, 2017
1.2k
views
theory-of-computation
context-free-language
pushdown-automata
dcfl
1
answer
25
number of string
Consider a bit-string of length 10 containing only 0 and 1. The number of string contain exactly 3 0’s or exactly 31’s are ________
answered
in
Mathematical Logic
Dec 22, 2017
192
views
combinatory
1
answer
26
Matching number in complete bipartitite graph
I am not convinced by this. Please explain or please tell me the source from where I can clear this out.
answered
in
Mathematical Logic
Dec 21, 2017
345
views
1
answer
27
#fork
answered
in
Operating System
Dec 21, 2017
161
views
0
answers
28
C Prog
#include<stdio.h> int reverse(int); int main() { int num=4; reverse(num); return 0; } int reverse(num) { if(num==0) return 0; else printf("%d",num); reverse(num--); } What is the output ?
commented
in
Programming
Dec 20, 2017
559
views
programming-in-c
output
0
answers
29
DBMS Q
Which of the following represents the total number of attributes in the minimized relation of above ER diagram ? A. 12 B. 15 C.16 D.17
commented
in
Databases
Dec 20, 2017
249
views
2
answers
30
C PROGRAMMING
Assuming no syntax error:
answered
in
Programming
Dec 20, 2017
949
views
programming
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(842)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...
@Aakash_Bhardwaj all the best bro . For your...