Recent questions tagged made-easy-workbook

Recent questions tagged made-easy-workbook

0 votes

0 answers 47 views

made easy workbook
traceroot is a program in a server side program b. clint side program c . boath a and b none of the above

jugnu1337 asked in Computer Networks Jul 19, 2021

5 points

47 views

0 votes

0 answers 38 views

Madeeasy Workbook
Consider the grammar 1. S-> X1 2. X-> A1B 3. X-> 2 4. A-> 2 5. B-> A How the above grammar is not LR(1)?

tipd asked in Compiler Design Jul 4, 2021

by tipd

5 points

38 views

0 votes

0 answers 41 views

MADE EASY Book
(G,*) is an abelian group .Then, (i). $X$ =$X^{-1}$ for any X belonging to G. (ii). $X$=$X^{2}$ for any X belonging to G. (iii). $(X*Y)^{2}$ = $X^{2}$ * $Y^{2}$ for any X ,Y belonging to G. (iv). G is of finite order

ShivangiChauhan asked in Set Theory & Algebra Jul 4, 2021

by ShivangiChauhan

17 points

41 views

0 votes

0 answers 43 views

MADE EASY Book
N denotes the set of natural numbers,{0,1,2,3 .} ,Z denotes the integers { ..-2,-2,0,1,2, ...} Which of the following statements are true ? (i). For all p $\epsilon$ Z ,p>5 $\rightarrow$ There exists x $\epsilon$ N,$x^{2}$ = 1(mod p). (ii). If m is any natural ... . (a). only (i) is true (b). only (ii) is true ( c). both (i) and (ii) are true (d). both (i) and (ii) are false

ShivangiChauhan asked in Set Theory & Algebra Jul 4, 2021

by ShivangiChauhan

17 points

43 views

0 votes

0 answers 115 views

Made easy workbook
Hello i want to know what is the made easy workbook for cse because i find on made easy publications website and amazon but unable to find and is this books come from postal course or can we buy separately as other books of made easy on their website or the name of book is changed or book printing is end for buying ? so what is “Made easy workbook” is?

ykrishnay asked in Study Resources Jun 20, 2021

103 points

115 views

0 votes

0 answers 56 views

Made easy workbook c programming question
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.

akshansh asked in Programming Jun 15, 2021

15 points

56 views

0 votes

0 answers 59 views

Made Easy Workbook
Please someone solve Q35.

Mellophi asked in Databases Aug 28, 2020

363 points

59 views

0 votes

1 answer 74 views

Made Easy workbook
If a variable is having EX- OR operation itself ‘n’ number of times, then the result is (a) complement of variable if n is even (b) uncomplement of variable if n is even ( C) complement of variable if n is odd (d) uncomplement of variable if n is odd

prashastinama asked in Digital Logic Aug 5, 2020

by prashastinama

5 points

74 views

0 votes

0 answers 99 views

Madeeasy dbms workbook 2020 , chapter : relation algebra ,tuple relational calculus and sql, question number 15

swatiChaudhary asked in Databases Jul 4, 2020

by swatiChaudhary

11 points

99 views

0 votes

0 answers 24 views

Made easy workbook

ayushayush591 asked in CO & Architecture May 13, 2020

by ayushayush591

5 points

24 views

0 votes

0 answers 32 views

madeeasy workbook question of programming methodology

Vikramaditya19 asked in Programming May 9, 2020

by Vikramaditya19

5 points

32 views

0 votes

0 answers 50 views

madeeasy workbook new question
order p is between 2 to p child pointer can store in root node and between [p] to p child can store in other 2 nodes of B tree index . Btree index.how many maximum level of index required to store 300 distict keys in order 5 B tree index?

Chandrabhan Vishwa 1 asked in Databases Apr 28, 2020

by Chandrabhan Vishwa 1

5 points

50 views

0 votes

0 answers 39 views

Made easy work book toc
Why aa*(bb*a)* not a regular expressian for starting and ending with symbol A Dfa

Ritesh123 asked in Theory of Computation Feb 25, 2020

5 points

39 views

0 votes

1 answer 585 views

Madeeasy Workbook DBMS
Given a system using unspanned blocking and 100 byte blocks. A file contains record of 20,50,35,70,40,20. what percentage of space will be wasted in the blocks allocated for the file?

Ashish Pradhan asked in Databases Feb 23, 2020

by Ashish Pradhan

5 points

585 views

0 votes

2 answers 57 views

locking and releasing a lock twice on a data item in 2LP

arunkantdubey asked in Databases Dec 18, 2019

by arunkantdubey

7 points

57 views

0 votes

0 answers 24 views

Madeeasy workbook (Parsing)
Consider the following grammer: S → S | S;S S → V = E V → id[E] | id E → id | (E) Find the number of conflicts in LR(0).

chinmayetw asked in Compiler Design Nov 20, 2019

5 points

24 views

1 vote

1 answer 302 views

MadeEasy Workbook, DRDO 2008
Consider a sequence A of length n which is sorted except for one item that appears out of order.Which of the following can sort the sequence in O(n) time? (a) Heap sort (b) Quick sort (c) Merge sort (d) Insertion sort

Ansaaa24 asked in Algorithms Oct 9, 2019

9 points

302 views

0 votes

1 answer 38 views

Recursive languages

kshubham538 asked in Theory of Computation Sep 2, 2019

-31 points

38 views

0 votes

1 answer 105 views

Context free grammar: string derivation
Consider the following CFG S→aAbBC | abB A→bBd | ∈ B→eBf | g C→f How many derivative steps required to derive the string abegff using the above grammar when start symbol S is available?

kshubham538 asked in Theory of Computation Jul 31, 2019

-31 points

105 views

0 votes

1 answer 49 views

String generation
Identify from the following the string generated by following $ S→SS , $ $S \rightarrow \ (S_1, $ $ S_1→S) ,$ $S_1 \rightarrow ) $ A. $(( ) ( ) ))$ B. $((((( )))))) ($ C. $( ) ( ) ( ) ( ))$ D.$ (( ) ((( )) ( )))$

kshubham538 asked in Theory of Computation Jul 31, 2019

-31 points

49 views

1 vote

1 answer 97 views

Binary semaphore

kshubham538 asked in Operating System Jul 30, 2019

-31 points

97 views

0 votes

1 answer 109 views

Context free grammar

kshubham538 asked in Theory of Computation Jul 25, 2019

-31 points

109 views

0 votes

1 answer 60 views

No. of states in minimum DFA for given Regular Expression

kshubham538 asked in Theory of Computation Jul 22, 2019

-31 points

60 views

0 votes

1 answer 32 views

Finite-automata

kshubham538 asked in Theory of Computation Jul 19, 2019

-31 points

32 views

0 votes

2 answers 223 views

Regular grammar to string production

kshubham538 asked in Theory of Computation Jul 17, 2019

-31 points

223 views

0 votes

1 answer 466 views

Regular production Grammar
Consider the production grammar S→AB | AS A→a | aA B→b Which of the following regular expressions corresponding to the production grammar?

kshubham538 asked in Theory of Computation Jul 17, 2019

-31 points

466 views

0 votes

1 answer 46 views

Regular expression to finite automata
The regular expression for even number of zeroes is A. (1* 01* 01*)* B. (1* 001*)* C. 1* + (1* 01* 01*)* D. ((0 + 1)* 0(0 + 1)* 0(0 + 1)*)* Also draw the finite automata.

kshubham538 asked in Theory of Computation Jul 17, 2019

-31 points

46 views

0 votes

1 answer 67 views

Finite automata to Regular Expression
The language recognized by the given finite automata is A. (aa + ∊) (b + ba) (bab)* B. (aab + ba) (bab)* C. (aab) (bab)* + (bab)* D. (aab) (∈ + (bab)*)*

kshubham538 asked in Theory of Computation Jul 17, 2019

-31 points

67 views

1 vote

1 answer 1.5k views

Regular expression
Which of the following regular expression over {0,1} denotes the set of all strings not containing 100 as sub string A. 0* (1*0)* B. 0* 10 10* C. 0* 1* 01* D. 0* (10 + 1)*

kshubham538 asked in Theory of Computation Jul 16, 2019

-31 points

1.5k views

0 votes

1 answer 94 views

Closure properties of Regular Language
If L1 is regular and L2 ⊆ L1, then which of the following has to be regular? A. L2 B. L1 ∩ L2 C. L2^n D. L1^n

kshubham538 asked in Theory of Computation Jul 15, 2019

-31 points

94 views

0 votes

1 answer 48 views

Regular expression and regular language
R1=11(0+1)* R2=(0+1)* 11 R2=11(0+1)* 11 + 111 + 11 Which is true? A. L(R1)=L(R2)=L(R3) B. L(R1) ∪ L(R2)=L(R3) C. L(R1) ⊆ L(R3) D. L(R1) ∩ L(R2)=L(R3) Please answer with proper explanation.

kshubham538 asked in Theory of Computation Jul 15, 2019

-31 points

48 views

0 votes

1 answer 427 views

How many states are there in a minimum state deterministic finite automata accepting L={ba,baa}?

kshubham538 asked in Theory of Computation Jul 15, 2019

-31 points

427 views

1 vote

0 answers 1.9k views

if x and y are boolean variables which of the following is the equivalent of x xor y xor xy

shabanam asked in Digital Logic Jul 15, 2019

9 points

1.9k views

0 votes

1 answer 81 views

Which of the following is the dual of ~(~p)$\equiv$p?

Aditya Patel asked in Mathematical Logic Jun 25, 2019

by Aditya Patel

71 points

81 views

0 votes

1 answer 51 views

Madeeasy workbook
Consider a declaration Int a=5,*b=&a; printf("%d",a*b); The output is A) 25 B) garbage C)5 * address of b D) error message

Prakhar Garg asked in Programming Jun 24, 2019

by Prakhar Garg

5 points

51 views

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

Search GATE CSE Doubts