Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
just_bhavana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent activity by just_bhavana
11
answers
1
GATE CSE 2018 | Question: 1
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$? $\frac{3}{(1-x)^2}$ $\frac{3x}{(1-x)^2}$ $\frac{2-x}{(1-x)^2}$ $\frac{3-x}{(1-x)^2}$
Which one of the following is a closed form expression for the generating function of the sequence $\{a_n\}$, where $a_n = 2n +3 \text{ for all } n=0, 1, 2, \dots$?$\frac...
22.4k
views
commented
Feb 14, 2018
Combinatory
gatecse-2018
generating-functions
normal
combinatory
1-mark
+
–
1
answer
2
Programming
#include<stdio.h> int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); } Please enlighten about the 2nd printf statement. Also what is the difference between the two statements?
#include<stdio.h int main() { char arr[5][7][6]; char *p[5][7][6]; printf("%d\t", (unsigned)(arr+1)-(unsigned)arr); printf("%d", (unsigned)(p+1)-(unsigned)p); }Please enl...
1.5k
views
answer selected
Jan 19, 2018
Programming in C
non-gate
+
–
0
answers
3
made easy
i think ans 2018 but ans is given 2016 please correct me if i wrong
i think ans 2018 but ans is given 2016 please correct me if i wrong
215
views
commented
Jan 18, 2018
0
answers
4
Bayes theorem
The chances that doctor A will diagnose a disease X correctly is 60%. The chances that a patient will die by his treatment after correct diagnosis is 40% and the chances of death by wrong diagnosis is 70%. A patient of doctor A, who had disease X, died ... disease was diagnosed correctly is ________%. I had solved it using Bayes theorem. and getting 66.66% but answer given is 46.15.
The chances that doctor A will diagnose a disease X correctly is 60%. The chances that a patient will die by his treatment after correct diagnosis is 40% and the chances ...
2.1k
views
commented
Jan 15, 2018
Calculus
conditional-probability
probability
engineering-mathematics
+
–
0
answers
5
Addressing Sectors
I am getting $ \Large1374845$ Is it right? Please explain your logic if you got other from this !
I am getting $ \Large1374845$ Is it right? Please explain your logic if you got other from this !
364
views
commented
Jan 5, 2018
CO and Architecture
co-and-architecture
+
–
0
answers
6
Number of Records
What is the number of records in 4 level B+ tree Answer is $24 \times 24 \times24 \times 19$ is correct na ?
What is the number of records in 4 level B+ treeAnswer is $24 \times 24 \times24 \times 19$ is correct na ?
679
views
commented
Jan 2, 2018
Databases
databases
+
–
1
answer
7
Turing machine
If L is accepted by TM, which halts on every string over alphabet {a, b}, then L′ is recursive language. True or False ? I think false because L′ = TM halts on no string in {a,b} = $\phi$ and L(TM) = $\phi$ is non RE, let alone it being recursive
If L is accepted by TM, which halts on every string over alphabet {a, b}, then L′ is recursive language.True or False ?I think false because L′ = TM halts on no strin...
769
views
commented
Jan 1, 2018
Theory of Computation
theory-of-computation
recursive-and-recursively-enumerable-languages
+
–
11
answers
8
GATE CSE 2017 Set 1 | Question: 43
Consider the following grammar: stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$ expr $\rightarrow$ term relop term | term term $\rightarrow$ id | number id $\rightarrow$ a | b | c number $\rightarrow [0-9]$ where relop is a relational ... program if $e_1$ then $e_2$ else $e_3$ has $2$ control flow paths. $e_1 \rightarrow e_2$ and $e_1 \rightarrow e_3$.
Consider the following grammar:stmt $\rightarrow$ if expr then expr else expr; stmt | $Ò$expr $\rightarrow$ term relop term | termterm $\rightarrow$ id | numberid $\righ...
20.2k
views
commented
Jan 1, 2018
Compiler Design
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
+
–
1
answer
9
Associative mapping in cache
If main memory $=128 \ KB$ and cache memory is of $2KB$ with $16B$ lines .and uses associative mapping . What would be the # of bits used for Tag for each block?
If main memory $=128 \ KB$ and cache memory is of $2KB$ with $16B$ lines .and uses associative mapping .What would be the # of bits used for Tag for each block?
1.8k
views
commented
Jan 1, 2018
CO and Architecture
co-and-architecture
cache-memory
+
–
1
answer
10
Need derivation
What is the value of 1.111111111? Is it same as $\left (2-2^{-9} \right )$?
What is the value of 1.111111111? Is it same as $\left (2-2^{-9} \right )$?
366
views
answer edited
Dec 29, 2017
Digital Logic
digital-logic
+
–
0
answers
11
Discrete_poset
It took me a while to solve, any hack on this?
It took me a while to solve, any hack on this?
417
views
commented
Dec 27, 2017
Set Theory & Algebra
discrete-mathematics
+
–
0
answers
12
self doubt
In a box, 10 coins are drawn at random out of 50 coins numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn coins? answer is given 250 i am getting 255??
In a box, 10 coins are drawn at random out of 50 coins numbered from 1 to 50. What is the expected value of the sum of numbers on the drawn coins?answer is given 250 i am...
251
views
commented
Dec 26, 2017
1
answer
13
test series
onsider the following schedule for transaction T1, T2 and T3. r1(x), r2(y), r3(y) w1(x), w3(x), r2(z), w1(x) Also assume that the time-stamp for the three transaction is {30, 10, 20}. Which of the following statement is ... The schedule is allowed under Thomas write time-stamp protocol but not basic time-stamp protocol. .. plz explain with precedance graph and with proper explanaion
onsider the following schedule for transaction T1, T2 and T3.r1(x), r2(y), r3(y) w1(x), w3(x), r2(z), w1(x)Also assume that the time-stamp for the three transaction is {3...
592
views
answer selected
Dec 25, 2017
2
answers
14
NIELIT DEC 2017 SET-C 62
If a random coin is tossed 11 times then what is the probability that for 7th toss head appears exactly 4 times? 5/32 15/128 35/128 None of the options
If a random coin is tossed 11 times then what is the probability that for 7th toss head appears exactly 4 times?5/3215/12835/128None of the options
2.1k
views
commented
Dec 24, 2017
Probability
probability
+
–
1
answer
15
regular expression
Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1 and X2 are related as follows: X0 = 1 X1 X1 = 0 X1 + 1 X2 X2 = 0 X1 + {λ} Which one of the following choices precisely represents the ... + (10)*)1 B 10 (0* + (10)*)*1 C 1(0* + 10)*1 D 10 (0 + 10)*1 + 110 (0 + 10)*1
Consider alphabet ∑ = {0, 1}, the null/empty string λ and the sets of strings X0, X1 and X2 generated by the corresponding non-terminals of a regular grammar. X0, X1 a...
294
views
commented
Dec 22, 2017
Theory of Computation
theory-of-computation
+
–
9
answers
16
GATE CSE 2005 | Question: 61
Consider line number $3$ of the following C-program. int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ } Identify the compiler’s response about this line while creating the object-module: No compilation error Only a lexical error Only syntactic errors Both lexical and syntactic errors
Consider line number $3$ of the following C-program.int main() { /*Line 1 */ int I, N; /*Line 2 */ fro (I=0, I<N, I++); /*Line 3 */ }Identify the compiler’s response ab...
21.3k
views
commented
Dec 22, 2017
Compiler Design
gatecse-2005
compiler-design
compilation-phases
normal
+
–
6
answers
17
GATE CSE 2003 | Question: 90
Consider the function $f$ defined below. struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p ->next -> data) && f(p- ... order of data value the elements in the list are sorted in non-increasing order of data value not all elements in the list have the same data value
Consider the function $f$ defined below.struct item { int data; struct item * next; }; int f(struct item *p) { return ((p == NULL) || (p->next == NULL)|| ((p->data <= p -...
17.5k
views
commented
Dec 18, 2017
DS
gatecse-2003
data-structures
linked-list
normal
+
–
2
answers
18
Inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous? (A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$ (B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$ ... (D) Both (B) and (C) Plz explain.. ..........Is there any criteria on the basis of which we could identify inherently ambiguous grammar
Q- Which one of following languages is inherently ambiguous?(A) The set of all strings of the form $\left\{a^nb^n,n>0 \right\}$(B) $\left\{a^nb^nc^md^m,n,m>0 \right\}$(C)...
15.4k
views
commented
Dec 16, 2017
Theory of Computation
theory-of-computation
inherently-ambiguous
+
–
1
answer
19
c programming
295
views
commented
Dec 16, 2017
1
answer
20
CPU bound and IO bound process
2.7k
views
commented
Dec 16, 2017
Operating System
process-scheduling
operating-system
+
–
0
answers
21
Regular or not
L={0^p1^q | p=5-q} is this language is regular or not. My doubt is Since every finite language is regular and we can see the all possible values of (p,q) will be (0,5),(1,4),(2,3),(3,2),(4,1),(5,0) so the ... 00011,00001,00000} So the language is regular. But somewhere i read that whenever any linear equation come with language then language is not regular. Please clear my doubt
L={0^p1^q | p=5-q} is this language is regular or not.My doubt isSince every finite language is regular and we can see the all possible values of (p,q) will be (0,5),(1,...
291
views
commented
Dec 14, 2017
Theory of Computation
regular-language
theory-of-computation
+
–
1
answer
22
Storage of array variables
Is all the array variables are stored in data segment or it is depends on the scope (local or global)?
Is all the array variables are stored in data segment or it is depends on the scope (local or global)?
497
views
answer selected
Dec 14, 2017
Programming in C
programming-in-c
+
–
1
answer
23
#TOC DOUBT
A)Is it useful to draw FA if we need to tell the language of the following grammar...? B)What is the language of the following grammar..? C) What will be the final state Of FA and what is the criteria to find out final state.if a given a regular grammar.? S→aB|bA A→aS|bAA|a B→bS|aBB|b
A)Is it useful to draw FA if we need to tell the language of the following grammar...?B)What is the language of the following grammar..?C) What will be the final state O...
787
views
commented
Dec 13, 2017
Theory of Computation
theory-of-computation
finite-automata
regular-grammar
+
–
3
answers
24
integration
$\int_{-4}^{4}|3-x|dx$ a) 13 b)8 c)25 d)24
$\int_{-4}^{4}|3-x|dx$a) 13 b)8 c)25 d)24
694
views
answer edited
Dec 12, 2017
Calculus
engineering-mathematics
calculus
integration
definite-integral
+
–
2
answers
25
RSA cryptosystem
Alice chooses 5 and 11 as P and Q respectively and e is a random number 13. Public key for Alice 35. Private key for Bob 17. What is the value of Cipher text for Alice,Plain text for Bob, Private key for Alice, Public key for Bob? ------------------------------ ... --------------------------------- Now I got confuse with formula and logic Can someone tell me which logic used where?
Alice chooses 5 and 11 as P and Q respectively and e is a random number 13. Public key for Alice 35. Private key for Bob 17. What is the value of Cipher text for Alice,Pl...
3.3k
views
commented
Dec 10, 2017
Computer Networks
computer-networks
rsa-security-networks
+
–
0
answers
26
Output
390
views
commented
Dec 9, 2017
Programming in C
programming
programming-in-c
+
–
2
answers
27
Output
529
views
commented
Dec 9, 2017
Programming in C
programming-in-c
output
+
–
2
answers
28
Test Book Test Series
Is following grammar LR(1)? S-> asa | bS |epsilon
Is following grammar LR(1)?S- asa | bS |epsilon
494
views
commented
Dec 8, 2017
Compiler Design
compiler-design
parsing
lr-parser
descriptive
testbook-test-series
+
–
1
answer
29
Discrete Maths
388
views
commented
Dec 6, 2017
Combinatory
discrete-mathematics
+
–
0
answers
30
TOC doubts test series
State whether statement is true or false. 1. (a+b)*.anbn is regular . 2. Language produced by grammar S -> AaB A->aC | $\epsilon$ B->aB|bB|$\epsilon$ C->aCb|$\epsilon$ is regular. 3. Language produced by grammar S->AB ... in w is equal to number of occurrences of "ba" } 6. Given a grammar, checking if the grammar is not regular is decidable problem.
State whether statement is true or false.1. (a+b)*.anbn is regular .2. Language produced by grammar S - AaB A->aC | $\epsilon$ B->aB|bB|$\epsilon$ C->aCb|$\epsilon$ is ...
873
views
commented
Dec 5, 2017
Theory of Computation
theory-of-computation
regular-language
context-free-language
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register