The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by aaru14
User aaru14
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User aaru14
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
answer
1
mmadeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=14725486734069728898 in this question what is the total transmission in go back N? someone plz tell?
asked
Dec 20, 2017
in
Computer Networks

49
views
computernetworks
0
votes
1
answer
2
madeeasy work book
Tcp operates over a 40 Gbps link if TCP uses the full bandwidth continously how long in ms would it take the sequence number to wraparound completely?? answer is 0.859sec ??
asked
Dec 15, 2017
in
Computer Networks

44
views
computernetworks
0
votes
0
answers
3
madeeasy booklet
while(1) { flag[i]=true; while(flag[j]); <cs> flag[i]=false; } someone please tell bounded wait is satisfying or not???
asked
Dec 12, 2017
in
Operating System

55
views
operatingsystem
btree
0
votes
0
answers
4
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=17252928676307264993 how to solve these type of question someone please help?
asked
Dec 11, 2017
in
Operating System

98
views
operating
system
0
votes
1
answer
5
MadeEasy Test Series: Operating System  Virtual Memory
Certain computer with paged virtual memory has 4KB pages, a 32 bit byte addressable virtual address space and 30 bit byte addressable physical address space. The system manages an inverted page table. Where each entry includes page ... plus 12 overhead bits. What is size of basic inverted page table including page number and overhead bits is?
asked
Dec 10, 2017
in
Operating System

366
views
madeeasytestseries
operatingsystem
invertedpagetable
virtualmemory
0
votes
1
answer
6
MadeEasy Test Series: Operating System  Resource Allocation
https://gateoverflow.in/?qa=blob&qa_blobid=16406706223773445572 someone plz help how to detect deadlock in this type of question??
asked
Dec 10, 2017
in
Operating System

73
views
madeeasytestseries
operatingsystem
resourceallocation
0
votes
0
answers
7
madeeasy work book
consider a system having one process which is reffering ' M' pages in the logical address and out of which 'N ' unique pages occur in it And 's' is the number of frames allocated to the process then what is the minimum and maximum number of page faults possible?
asked
Dec 10, 2017
in
Operating System

41
views
operatingsystem
0
votes
1
answer
8
MadeEasy Test Series: Programming & DS  Trees
assume the preorder tŕaversal of binary tree is "abc" how many total different binary trees are possible whose postorder traversal.is "cba" with the given preorder traversal.?? how to find it ?
asked
Dec 7, 2017
in
Programming

206
views
madeeasytestseries
datastructure
trees
treetraversal
0
votes
0
answers
9
madeeasy work book
Assume that a lower traingular matrix A[0.....n1,0...n1] is stored in a linear array B [0....1/2 n (n+1)1] in row by row order for n=100 if A[0,0] is stored inB[0] where is A[90,80] stored in B array??
asked
Dec 7, 2017
in
Programming

38
views
datastructure
0
votes
1
answer
10
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=12037309044418228871 someone plz solve this question??
asked
Dec 7, 2017
in
Programming

75
views
data
datastructure
0
votes
1
answer
11
pointer
int *p, A[3]={0,1,2}; p=A; *(P+2)=5; p=A++; *P=7; what are the values stored in the atray A from index 0 to index 2 after execution of the above cod?
asked
Dec 6, 2017
in
Programming

94
views
programminginc
pointers
0
votes
0
answers
12
data structure
what is complexity 1)to convert infix to prefix 2) to convert infix to postfix 3)convert infix to prefix using stack plz someone tell?
asked
Dec 4, 2017
in
Programming

54
views
datastructure
+1
vote
1
answer
13
probability
a dice is tossed seven times what is the probability that all six faces appear at least once? a)63/64 b)35/648 c)2/9 d)5/324
asked
Dec 3, 2017
in
Verbal Ability

165
views
probability
0
votes
1
answer
14
huffman code
question based on huffman coding for symbol A with probability 0.3 , B with 0.15 ,c with 0.1 ,D with 0.25 ,E with 0.2 (with the convention 0 labeled for left branch and 1 for right) the minimum no of bits required to represent all the symbols together is?? a)1 b)2 c)3 d)4 which bit this question asking??
asked
Dec 3, 2017
in
Algorithms

469
views
huffmancode
0
votes
0
answers
15
gateforum test series
construct a min heap from the 120 140 40 50 80 70 60 90 20 100[ heap property must be maintained after adding each individual element ] now after deleting the root element from the heap what will be the post order traversal of the heap? a)140 100 90 80 50 120 70 60 40 b)140 100 90 80 120 70 50 60 40 c)140 100 80 90 120 70 50 60 40 d)140 90 100 50 80 40 120 60 70
asked
Dec 1, 2017
in
Algorithms

72
views
gateforumtestseries
0
votes
1
answer
16
MadeEasy Workbook: Algorithms  Graph Algorithms
asked
Dec 1, 2017
in
Algorithms

127
views
algorithms
graphalgorithms
madeeasybooklet
0
votes
1
answer
17
MadeEasy Subject Test: Algorithms  Graph Algorithms
complexity of kruskal algorithum for finding the minimum cost spanning tree of an undirected graph contain n vertices and m edges if the edge are already sorted.??
asked
Nov 30, 2017
in
Algorithms

98
views
madeeasytestseries
algorithms
graphalgorithms
0
votes
1
answer
18
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=6688289756503573539 how to solve this questn??
asked
Nov 30, 2017
in
Algorithms

55
views
algorithms
0
votes
0
answers
19
MadeEasy Workbook: Programming & DS  Programming In C
how it will be solve plz someone help?
asked
Nov 28, 2017
in
Programming

72
views
madeeasybooklet
programming
programminginc
0
votes
0
answers
20
madeeasy class notes
https://gateoverflow.in/?qa=blob&qa_blobid=15895383759487537860 find complexity ?? where n is prime. someone plz explain??
asked
Nov 27, 2017
in
Algorithms

41
views
algorithms
+1
vote
2
answers
21
MadeEasy Subject Test: Digital Logic  Boolean Expressions
https://gateoverflow.in/?qa=blob&qa_blobid=13313697975716394852 how to solve this??
asked
Nov 23, 2017
in
Digital Logic

107
views
madeeasytestseries
digitallogic
booleanalgebra
+2
votes
0
answers
22
MadeEasy Subject Test: Algorithms  Time Complexity
https://gateoverflow.in/?qa=blob&qa_blobid=6856287731579574233 someone plz tell ??
asked
Nov 23, 2017
in
Algorithms

112
views
madeeasytestseries
algorithms
timecomplexity
0
votes
1
answer
23
ace test series
E>TE/a T>ET/b first set of E and T??
asked
Nov 23, 2017
in
Compiler Design

68
views
compilerdesign
0
votes
3
answers
24
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=5160308422617895878 someone plz tell why this is not left factored?
asked
Nov 22, 2017
in
Compiler Design

60
views
compilerdesign
0
votes
1
answer
25
madeeasy work book
X>Yaf Y>bYd Z>cZe FOLLOW(Z)???
asked
Nov 22, 2017
in
Compiler Design

65
views
compilerdesign
+1
vote
1
answer
26
MadeEasy Subject Test: Compiler Design  Lexical Analysis
in c programming which of the following is not used as a token seprator during lexical analysis? a)white space b)comment c)semicolon d)none of these token seprator means??
asked
Nov 22, 2017
in
Compiler Design

112
views
madeeasytestseries
compilerdesign
lexicalanalysis
0
votes
0
answers
27
arihant publication
a relation EMP is defined with attribute empcode, name ,street ,city ,state and pincode for any pincode there is only one city and street also for any given city,street and state there is just one pin code. highest normal form of EMP???
asked
Nov 21, 2017
in
Databases

34
views
databases
0
votes
0
answers
28
madeeasy work book
https://gateoverflow.in/?qa=blob&qa_blobid=13192646339913379886 please someone exaplain ?
asked
Nov 18, 2017
in
Theory of Computation

69
views
theoryofcomputation
0
votes
1
answer
29
MadeEasy Subject Test: Theory of Computation  Regular Languages
https://gateoverflow.in/?qa=blob&qa_blobid=9622019941645658924 please some one explain this??
asked
Nov 18, 2017
in
Theory of Computation

63
views
madeeasytestseries
theoryofcomputation
regularlanguages
+1
vote
1
answer
30
MadeEasy Subject Test: Theory of Computation  Regular Languages
a)every regular languahe on alphabet{0} has the form C^mx+b where m and b are positive integer constants and 0<=X<=infinite b) A language on alphabet {0} defined by L={0^n ,n is a multiple of 3 } is regular c) the language {0^m 1^n ; n= 100m } is regular. which is false answr is c ??? i think c also regular
asked
Nov 17, 2017
in
Theory of Computation

73
views
madeeasytestseries
theoryofcomputation
regularlanguages
Page:
1
2
3
next »
50,644
questions
56,523
answers
195,611
comments
101,287
users