Recent activity by wh04m1 / GATE Overflow for GATE CSE

3 answers

1

Kenneth Rosen Edition 6th Exercise 6.1 Question 9d (Page No. 401)
Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$

Solve the recurrence relation $a_n = a_{n-1} + 2n + 3, a_0 = 4$

913 views

answered Dec 21, 2018

4 answers

2

Kenneth Rosen Edition 6th Exercise 5.3 Question 35 (Page No. 362)
How many bit strings contain exactly eight 0s and 10 1s if every 0 must be immediately followed by a 1 ?

How many bit strings contain exactly eight 0s and 10 1s if every 0 must be immediately followed by a 1 ?

943 views

answered Dec 21, 2018

2 answers

3

MadeEasy Test Series 2019: Combinatory- Generating Functions
Let $M(x) = \frac{x^{2018}}{(1-x)^{2019}}$ we define $M(x) = \sum_{r=0}^{\infty}a_{r}x^{r}$ ,then $a_{r}$ is equal to- $A)\binom{r}{2019}$ $B)\binom{r}{r+2018}$ $C)\binom{r}{2019-r}$ $D)\binom{r}{r-2018}$

Let $M(x) = \frac{x^{2018}}{(1-x)^{2019}}$we define $M(x) = \sum_{r=0}^{\infty}a_{r}x^{r}$ ,then $a_{r}$ is equal to-$A)\binom{r}{2019}$$B)\binom{r}{r+2018}$$C)\binom{r}{...

974 views

answered Dec 21, 2018

2 answers

4

#discrete matmatics
recurrence relation 2a$_{n}=a_{n-1}+2^{n}$ intial condtion a$_{0}$=1 value of a$_{100}$

recurrence relation 2a$_{n}=a_{n-1}+2^{n}$ intial condtion a$_{0}$=1 value of a$_{100}$

485 views

answered Dec 21, 2018

3 answers

5

CMI2011-A-08
In programming languages like C, C++, Python $\dots$ the memory used by a program is typically separated into two parts, the stack and the heap. Consider the following statements: A stack is efficient for managing nested function calls. Stack space is limited while heap space is not. ... $2$ is false. $2$ and $3$ are true but $1$ is false. All three statements are true.

In programming languages like C, C++, Python $\dots$ the memory used by a program is typically separated into two parts, the stack and the heap. Consider the following st...

1.7k views

commented Nov 15, 2018

3 answers

6

ISRO2018-2
Consider the following declaration : structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &person; Then *$(kd->name + 2)$ can be used instead of: $person.name+2$ $kd-> (name+2)$ $*((*kd).name+2)$ either $A)$ or $B)$ , not $C)$

Consider the following declaration :structaddr { char city[10]; char street[30]; int pin; }; struct { char name[30]; int gender; struct addr locate; } person, *kd = &pers...

5.6k views

answered Jul 12, 2018

1 answer

7

#Toc #PeterLinz
Find a DFA for the following language on {a,b} L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }

Find a DFA for the following language on {a,b}L = { w : ( na(w) + 2nb(w)) mod 3 < 2 }

4.7k views

commented Jul 9, 2018

1 answer

8

Decision properties of finite automata
Is equivalence problem decidable problem or not?

Is equivalence problem decidable problem or not?

1.6k views

answered Jul 9, 2018

1 answer

9

dragon book - exercise 6.2.2 i)
How to represent a=b[i]+c[j] in quadruple?

How to represent a=b[i]+c[j] in quadruple?

887 views

answered Jun 14, 2018

2 answers

10

compiler design (run time environments)
can anyone tell broadly about "Arbitrary lifetime in case of heap allocation".

can anyone tell broadly about "Arbitrary lifetime in case of heap allocation".

782 views

answered Jun 14, 2018

1 answer

11

Top Down Parsing
Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D -> d first or B -> B first?

Since it is a Bottom Up Parser do we need to evaluate expressions following Right Hand Derivations or Left Hand Derivations,i.e. should we evaluate D - d first or B - B f...

1.1k views

answered Jun 12, 2018

3 answers

12

Compiler Design Activation Record
As actual parameters are stored in the Actual parameter field in case of Activation record then where does formal parameters will be stored? f(a,b) { a(e,f) } Here e,f are actual parameters that will be stored in actual parameter field,but where does formal parameters a,b will be stored for f activation record?

As actual parameters are stored in the Actual parameter field in case of Activation record then where does formal parameters will be stored?f(a,b){a(e,f)}Here e,f are act...

1.6k views

answered Jun 12, 2018

3 answers

13

what is true about the syntax directed translation scheme given below :
S->aSb { S.c=S.c+2 } S->bSa { S.c=S.c+2 } S->epsilon {S.c=0 } 1. Equal no of a's and b's . 2. No of a's or no of b's in a given string . 3. No of a's and no of b's in a given string .. 4. None of these . According to me , it should be total no of a's and no of b's .

S->aSb { S.c=S.c+2 }S->bSa { S.c=S.c+2 }S->epsilon {S.c=0 } 1. Equal no of a's and b's .2. No of a's or no of b's in a given string .3. No of a's and no of b's in a given...

3.2k views

answered Jun 12, 2018

1 answer

14

Parse tree
Consider the following grammar $S \rightarrow SS/Sa/aS/a$ Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?

Consider the following grammar$S \rightarrow SS/Sa/aS/a$Construct Parse Tree for $w=aaaa$ as many as possible? How many parse trees are possible?

788 views

answer edited Jun 12, 2018

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