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 jhaanuj2108
User jhaanuj2108
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User jhaanuj2108
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
MadeEasy Full Length Test 2019: Combinatory  Generating Functions
Let We define Then ar is equal to. $\binom{r}{2019}$ $\binom{r}{r + 2018}$ $\binom{r}{2019  r}$ $\binom{r}{r  2018}$ Can anyone tell me if this type of question is in Gate 2019 syllabus or ... question in previous year question? If yes, then when can I learn this stuff from. Because I am unable to understand the whole solution.
asked
Jan 13, 2019
in
Combinatory

88
views
discretemathematics
generatingfunctions
madeeasytestseries2019
madeeasytestseries
0
votes
0
answers
2
Ace Test Series: Calculus  Integration
Can anyone help me with solving this type of problem? I want some resource from where I can learn to solve this type on integration, as according to solution it is a function of α, so I did not understand the solution.
asked
Jan 12, 2019
in
Calculus

96
views
acetestseries
calculus
integration
0
votes
0
answers
3
Ace Test Series: Algorithms  Minimum Spanning Tree
asked
Jan 4, 2019
in
Algorithms

68
views
acetestseries
algorithms
mst
+6
votes
1
answer
4
MadeEasy Test Series: Compiler Design  Syntax Directed Translation
Consider the following grammar to generate binary fractions: If the above grammar with semantic rules calculate and each nonterminal has synthesized attribute ‘val’ to store its value. Then the missing semantic rules will be _______. A. B. C. D.
asked
Sep 30, 2018
in
Compiler Design

191
views
madeeasytestseries
compilerdesign
syntaxdirectedtranslation
0
votes
0
answers
5
Made Easy Test Series
A shift reduce parser carries out the actions. Specified within braces immediately after reducing with the corresponding rule of grammar: ( Please explain what S.nA1 and S.nA2 mean along with the solution )
asked
Sep 30, 2018
in
Compiler Design

42
views
0
votes
2
answers
6
MadeEasy Test Series: Theory Of Computation  Finite Automata
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
asked
Sep 26, 2018
in
Theory of Computation

148
views
madeeasytestseries
theoryofcomputation
finiteautomata
0
votes
1
answer
7
MadeEasy Test Series: Theory Of Computation  Finite Automata
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using MyhillNerode theorem is ________.
asked
Sep 26, 2018
in
Theory of Computation

125
views
madeeasytestseries
theoryofcomputation
myhillnerode
finiteautomata
+1
vote
1
answer
8
MadeEasy Test Series: Operating System  Memory Management
Consider five memory partitions of size 100 KB, 500 KB, 200 KB, 450 KB and 600 KB in same order. If sequence of requests for blocks of size 212 KB, 417 KB, 112 KB and 426 KB in same order come, then which of the following ... efficient use of memory? A) BEST FIT B) FIRST FIT C) NEXT FIT D) BOTH NEXT FIT AND BEST FIT RESULTS IN SAME
asked
Aug 14, 2018
in
Operating System

437
views
madeeasytestseries
operatingsystem
memorymanagement
+1
vote
2
answers
9
MadeEasy Test Series: Operating System  Page Replacement
Consider a demand paged memory system, page table is held in registers. It takes 800 nsec to service a page fault if empty page is available or replaced page is not modified and 950 nsec if the replaced page is modified, ... modified 85% of time and page faultrate is 20% then average memory access time is ________. (Upto 1 decimal place)
asked
Aug 14, 2018
in
Operating System

262
views
madeeasytestseries
operatingsystem
demandpaging
pagefault
pagereplacement
50,833
questions
57,723
answers
199,442
comments
107,785
users