Recent questions tagged made-easy-test-series - GATE CSE Doubts

0 votes

1 answer

MADE EASY TEST : DISCRETE MATHS
In how many ways 11 chocolates can be distributed to 7 children such that each one gets atleast one is ____

asked 1 day ago in Combinatory by Debapaul (123 points) | 12 views

0 votes

1 answer

MADE EASY DISCRETE MATHS
Number of perfect matching in a complete graph of 5 vertices is _____ ANS should be 0 right? as when odd number of vertices are there we should have no matching right? But they have applied the matching formula and solved it. God knows why

asked 1 day ago in Graph Theory by Debapaul (123 points) | 14 views

0 votes

0 answers

Made Easy test series 2020 computer network question

asked 2 days ago in Computer Networks by vishal burnwal (9 points) | 23 views

0 votes

1 answer

Made Easy : Compilers
Consider the following grammar, where set of non terminals are {S,A,B,C} and set of terminals are {e,f,g, t} S→ SeA | A A→AfB | B B→BgC | C C→t If CLR(1) parser is used to construct the DFA (sets of CLR(1) canonical items) for above grammar, then number of look-ahead for an item B→ •Bgc in initial state are _______

asked 2 days ago in Compiler Design by Debapaul (123 points) | 13 views

0 votes

1 answer

Made Easy Test series Computer Network 2020
In RSA algorithm the number of keys required to support both confidentiality and authentication are ________. Ans: 4 Can someone plz explain ,how the answer is 4?

asked 2 days ago in Computer Networks by vishal burnwal (9 points) | 20 views

0 votes

1 answer

MADE EASY: DISCRETE MATHS

asked 3 days ago in Mathematical Logic by Debapaul (123 points) | 23 views

0 votes

1 answer

MADE EASY : LATTICE
Boolean lattice Complemented lattice Distributive lattice Not a lattice

asked 3 days ago in Set Theory & Algebra by Debapaul (123 points) | 16 views

0 votes

1 answer

MADE EASY TEST 2020

asked 4 days ago in Databases by Debapaul (123 points) | 24 views

0 votes

0 answers

TIme complexity Made easy
What is time complexity for this function?

asked 4 days ago in Algorithms by vupadhayayx86 (6 points) | 17 views

0 votes

0 answers

MADE EASY MULTI SUBJECT COMPILERS

asked 5 days ago in Compiler Design by Debapaul (123 points) | 9 views

0 votes

0 answers

MADE EASY CD 2020-21
S’→ A. A→ .A * B B→ .id None

asked 5 days ago in Compiler Design by Debapaul (123 points) | 12 views

0 votes

1 answer

MADE EASY 2020 COMPILERS
A grammar has no epsilon and unit productions. The maximum number of reduce moves that can be taken during bottom up evaluation of 10 token string by bottom up parsers is ________.

asked 5 days ago in Compiler Design by Debapaul (123 points) | 19 views

+1 vote

0 answers

OS made easy 2020
I wanna talk about the option (C), how it is satisfying Bounded waiting… what if p1 completes execution and again runs… so we can’t really say there is any kind of bounded waiting .. or am i approaching it in a wrong way.

asked Oct 14 in Operating System by Priyansh Singh (41 points) | 18 views

0 votes

1 answer

MADE EASY FULL LENGTH : Discrete Maths
Is this relation on set A{1,2,3,4} , R={ (3,3) (2,1) (1,2) } anti symmetric?

asked Oct 14 in Set Theory & Algebra by Debapaul (123 points) | 13 views

0 votes

0 answers

MADE EASY FULL LENGTH: COMPILERS
let x be the number of nodes and y be the number of edges in DAG, then x+y =__________

asked Oct 14 in Compiler Design by Debapaul (123 points) | 15 views

0 votes

0 answers

programming question made easy 2020
Which of the following statements is correct? Void pointers can be used for de-referencing. Arithmetic operations can be applies on void pointers. The default value of extern class of storage is garbage. A particular extern variable can be declared many times, but ... D) , i wanna know if its right or not and if it is then could anyone explain me with an example.

asked Oct 11 in Programming by Priyansh Singh (41 points) | 10 views

0 votes

0 answers

Madeeasy Test series
Coaching (cname, city) Travel (name, city) Select T1.name from Travel T1 where Not Exist (Select M.city FROM Coaching M where M.cname = madeeasy EXCEPT Select T2.city from Travel T2 where T1.name = T2.name) The above query returns the name of the ... city where madeeasy is located. who have not travelled in all city where madeeasy is located. N.B - This is a 1 mark question.

asked Oct 5 in Databases by MRINMOY_HALDER (32 points) | 18 views

0 votes

0 answers

Made Easy test series 2020: CD test
Which of the following is correct? (A) One of the purpose of using intermediate code in compiler to improve the register allocation. (B) node of the tree is synthesized attribute. (C) The storage used for heap section can grow at run time but not stack section. (D) None of these.

asked Sep 30 in Compiler Design by Verma Ashish (295 points) | 17 views

0 votes

1 answer

Operating System Made easy test series 2020
Consider the following statements: S1 : Translation look aside buffer necessarily be saved on a context switch between processes. S2: Program counter must be saved when context switch between processes. S3: System calls are usually invoked by using a software interrupt. Which of the above statements is/are correct?

asked Sep 29 in Operating System by Surya Pratap Singh S (7 points) | 19 views

0 votes

0 answers

Source : made easy test series DBMS
What should be the answer to this question. Also please provide the explanation for the answer.

asked Sep 21 in Databases by karanvashisht1026 (7 points) | 52 views

0 votes

0 answers

Made Easy test series: Operating Systems full length 2019

asked Jun 26 in Operating System by Sambhrant Maurya (271 points) | 12 views

To see more, click for the full list of questions or popular tags.

1,680 questions

1,088 answers

4,555 comments

89,591 users