Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
jhaanuj2108
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by jhaanuj2108
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.
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 ...
476
views
asked
Jan 13, 2019
Combinatory
discrete-mathematics
generating-functions
made-easy-test-series
+
–
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.
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 func...
458
views
asked
Jan 12, 2019
Calculus
ace-test-series
calculus
integration
+
–
0
answers
3
Ace Test Series: Algorithms - Minimum Spanning Tree
432
views
commented
Jan 4, 2019
Algorithms
ace-test-series
algorithms
minimum-spanning-tree
+
–
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 non-terminal has synthesized attribute ‘val’ to store its value. Then the missing semantic rules will be _______. A. B. C. D.
Consider the following grammar to generate binary fractions:If the above grammar with semantic rules calculate and each non-terminal has synthesized attribute ‘val’ ...
1.7k
views
asked
Sep 30, 2018
Compiler Design
made-easy-test-series
compiler-design
syntax-directed-translation
+
–
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 )
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...
261
views
asked
Sep 30, 2018
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} ]
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} ]
622
views
asked
Sep 26, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
finite-automata
+
–
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 Myhill-Nerode theorem is ________.
Consider the following DFA: The number of distinct sets present in all partitions while converting given DFA into minimal DFA using Myhill-Nerode theorem is ________.
676
views
asked
Sep 26, 2018
Theory of Computation
made-easy-test-series
theory-of-computation
myhill-nerode
finite-automata
+
–
1
answer
8
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)
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 modif...
2.4k
views
commented
Aug 15, 2018
Operating System
made-easy-test-series
operating-system
demand-paging
page-fault
page-replacement
+
–
1
answer
9
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
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...
7.3k
views
commented
Aug 14, 2018
Operating System
made-easy-test-series
operating-system
memory-management
+
–
1
answer
10
Made easy test series
Why option d is incorrect?
Why option d is incorrect?
438
views
answered
Aug 14, 2018
Databases
databases
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register