search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.

Recent questions tagged made-easy-workbook

0 votes
1 answer 10 views
traceroot is a program in a server side program b. clint side program c . boath a and b none of the above
asked Jul 19 in Computer Networks jugnu1337 5 points 10 views
0 votes
1 answer 21 views
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)?
asked Jul 4 in Compiler Design tipd 5 points 21 views
0 votes
1 answer 24 views
(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
asked Jul 4 in Set Theory & Algebra ShivangiChauhan 17 points 24 views
0 votes
1 answer 11 views
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 number satisfying m ... x. (a). only (i) is true (b). only (ii) is true ( c). both (i) and (ii) are true (d). both (i) and (ii) are false
asked Jul 4 in Set Theory & Algebra ShivangiChauhan 17 points 11 views
0 votes
0 answers 18 views
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?
asked Jun 20 in Study Resources ykrishnay 103 points 18 views
0 votes
0 answers 19 views
The correct answer is (b). I am not able to understand how it is the correct answer, please explain.
asked Jun 15 in Programming akshansh 15 points 19 views
0 votes
0 answers 49 views
Please someone solve Q35.
asked Aug 28, 2020 in Databases Mellophi 363 points 49 views
0 votes
1 answer 34 views
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
asked Aug 5, 2020 in Digital Logic prashastinama 5 points 34 views
0 votes
0 answers 18 views
asked May 13, 2020 in CO & Architecture ayushayush591 5 points 18 views
0 votes
0 answers 24 views
Consider the following code int main() { char A[]="gate"; int x; for(x=0; A[x]; x++) { printf("%c", A[x]); } } What is the output printed by the code? (a) gate (b) g (c) runtime error (d) compile time error
asked May 9, 2020 in Programming Vikramaditya19 5 points 24 views
0 votes
0 answers 33 views
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?
asked Apr 28, 2020 in Databases Chandrabhan Vishwa 1 5 points 33 views
0 votes
0 answers 28 views
Why aa*(bb*a)* not a regular expressian for starting and ending with symbol A Dfa
asked Feb 25, 2020 in Theory of Computation Ritesh123 5 points 28 views
0 votes
1 answer 217 views
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?
asked Feb 23, 2020 in Databases Ashish Pradhan 5 points 217 views
0 votes
2 answers 43 views
If a schedule has a transaction that locks an item say A and then release the lock after few steps can it again lock the item A in a 2-phase locking scheme?
asked Dec 18, 2019 in Databases arunkantdubey 7 points 43 views
0 votes
0 answers 20 views
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).
asked Nov 20, 2019 in Compiler Design chinmayetw 5 points 20 views
1 vote
1 answer 210 views
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
asked Oct 9, 2019 in Algorithms Ansaaa24 9 points 210 views
0 votes
1 answer 33 views
0 votes
1 answer 74 views
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?
asked Jul 31, 2019 in Theory of Computation kshubham538 -31 points 74 views
0 votes
1 answer 39 views
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.$ (( ) ((( )) ( )))$
asked Jul 31, 2019 in Theory of Computation kshubham538 -31 points 39 views
1 vote
1 answer 76 views
0 votes
1 answer 129 views
Consider the production grammar S→AB | AS A→a | aA B→b Which of the following regular expressions corresponding to the production grammar?
asked Jul 17, 2019 in Theory of Computation kshubham538 -31 points 129 views
0 votes
1 answer 34 views
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.
asked Jul 17, 2019 in Theory of Computation kshubham538 -31 points 34 views
0 votes
1 answer 50 views
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)*)*
asked Jul 17, 2019 in Theory of Computation kshubham538 -31 points 50 views
1 vote
1 answer 278 views
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)*
asked Jul 16, 2019 in Theory of Computation kshubham538 -31 points 278 views
0 votes
1 answer 65 views
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
asked Jul 15, 2019 in Theory of Computation kshubham538 -31 points 65 views
0 votes
1 answer 38 views
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.
asked Jul 15, 2019 in Theory of Computation kshubham538 -31 points 38 views
0 votes
1 answer 248 views
How many states are there in a minimum state deterministic finite automata accepting L={ba,baa} A. 4 B. 5 C. 7 D. 8
asked Jul 15, 2019 in Theory of Computation kshubham538 -31 points 248 views
0 votes
1 answer 65 views
Which of the following is the dual of ~(~p)$\equiv$p? a.] ~p$\equiv$p b.] ~(~p)$\equiv$p c.] ~p$\equiv$~p d.] p$\equiv$~p
asked Jun 25, 2019 in Mathematical Logic Aditya Patel 71 points 65 views
0 votes
1 answer 38 views
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
asked Jun 24, 2019 in Programming Prakhar Garg 5 points 38 views
To see more, click for the full list of questions or popular tags.
...