Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by just_bhavana
30
votes
1
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.3k
views
answered
Dec 30, 2017
Compiler Design
gatecse-2017-set1
compiler-design
parsing
normal
numerical-answers
+
–
5
votes
2
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
answered
Dec 24, 2017
Probability
probability
+
–
3
votes
3
Discrete Maths
407
views
answered
Dec 6, 2017
Combinatory
discrete-mathematics
+
–
3
votes
4
DFA no of states
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
What is the min no. of states required in DFA which accepts all strings starting with 1 and whose decimal value is divisible by 7?
1.1k
views
answered
Dec 1, 2017
Theory of Computation
theory-of-computation
minimal-state-automata
finite-automata
+
–
7
votes
5
Regular Expression
Let L1= 10* and L2=101* Find L1 Union L2 , L1 intersection L2 , L1 - L2 in the form of regular expressions.
Let L1= 10* and L2=101* Find L1 Union L2 , L1 intersection L2 , L1 - L2 in the form of regular expressions.
1.9k
views
answered
Nov 28, 2017
Theory of Computation
theory-of-computation
regular-expression
+
–
148
votes
6
GATE CSE 2014 Set 1 | Question: 5
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
The value of the dot product of the eigenvectors corresponding to any pair of different eigenvalues of a $4-by-4$ symmetric positive definite matrix is ___________
14.5k
views
answered
Nov 27, 2017
Linear Algebra
gatecse-2014-set1
linear-algebra
eigen-value
numerical-answers
normal
+
–
3
votes
7
Micro Instruction
Conditional bit(Flag) Micro-opn. Next Address Micro-Instruction Format If a micro program supports 46μ operations with a parallelism of 2,how many and what size of field exists in micro operation field? Given size of micro-opn field is 9bits. Answer: Total 9 bis divided in 4 and 5 bit. Can anyone explain how this division is being done.
Conditional bit(Flag)Micro-opn.Next Address Micro-Instruction FormatIf a micro program supports 46μ operations with a parallel...
2.4k
views
answered
Nov 25, 2017
CO and Architecture
microprogramming
co-and-architecture
control-unit
cpu
+
–
3
votes
8
Probability
433
views
answered
Nov 22, 2017
4
votes
9
GATE Overflow | Algorithms | Test 1 | Question: 10
Consider the following recurrence relation. $T(n) = \begin{cases}1 & \quad if \: n = 1 \\ T(n-1) + 2^n \quad & otherwise \end{cases}$ What will be the value of $T(10)$?
Consider the following recurrence relation.$$T(n) = \begin{cases}1 & \quad if \: n = 1 \\ T(n-1) + 2^n \quad & otherwise \end{cases}$$What will be the value of $T(10)$?
567
views
answered
Nov 22, 2017
Algorithms
go-alogrithms-1
numerical-answers
recurrence-relation
+
–
4
votes
10
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
724
views
answered
Nov 11, 2017
Calculus
engineering-mathematics
calculus
integration
definite-integral
+
–
1
votes
11
TOC regular language
L={a^p|p is prime} is not regular.but kleene closure of L is regular.How? L* is regular how??
L={a^p|p is prime} is not regular.but kleene closure of L is regular.How?L* is regular how??
525
views
answered
Nov 11, 2017
1
votes
12
aptitute
How many five-digit integers can be possible?[NOTE:- not positive integers]
How many five-digit integers can be possible?[NOTE:- not positive integers]
336
views
answered
Nov 10, 2017
5
votes
13
gate 2008 matrices engineering maths
If the rank of a (5X6) matrix Q is 4, then which one of the following statement is correct (A) Q will have four linearly independent rows and four linearly independent columns (B) Q will have four linearly independent rows and five linearly independent columns (C) QQT will be invertible (D) QTQ will be invertible
If the rank of a (5X6) matrix Q is 4, then which one of the following statement is correct(A) Q will have four linearly independent rows and four linearly independent co...
3.2k
views
answered
Nov 9, 2017
Linear Algebra
matrix
linear-algebra
engineering-mathematics
+
–
3
votes
14
question on minimum number f bits
what is minimum no. of bits required to represent // (8)base 10 in binary formula : n >= log(8) base 2 = 3 but answer should be 4 ?? binary of 8 = 1000
what is minimum no. of bits required to represent // (8)base 10 in binary formula : n >= log(8) base 2 = 3 but answer should be 4 ?? binary of 8 = 1...
1.4k
views
answered
Nov 9, 2017
4
votes
15
UGC NET CSE | November 2017 | Part 3 | Question: 31
Consider a full binary tree with $n$ internal nodes, internal path length $I$, and external path length $e$. the internal length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path ... of the following is correct for the full binary tree? $e=i+n$ $e=i+2n$ $e=2i+n$ $e=2n+i$
Consider a full binary tree with $n$ internal nodes, internal path length $I$, and external path length $e$. the internal length of a full binary tree is the sum, taken o...
2.2k
views
answered
Nov 8, 2017
Graph Theory
ugcnetcse-nov2017-paper3
data-structures
binary-tree
+
–
15
votes
16
minimum number of comparisons
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
You are given an array of 64 elements, minimum number of comparisons required to find out second largest element among all will be _______.
8.2k
views
answered
Nov 4, 2017
Algorithms
algorithms
normal
numerical-answers
sorting
+
–
2
votes
17
Gate 2012 CE Probability
The annual precipitation data of a city is normally distributed with mean and standard deviation as $1000$ $mm$ and $200$ $mm$, respectively. The probability that the annual precipitation will be more than $1200$ $mm$ is $<50\%$ $50\%$ $75\%$ $100\%$
The annual precipitation data of a city is normally distributed with mean and standard deviation as $1000$ $mm$ and $200$ $mm$, respectively. The probability that the ann...
2.7k
views
answered
Nov 1, 2017
Probability
engineering-mathematics
probability
+
–
2
votes
18
Program
Consider the following function that computes the value of $\binom{m}{n}$ correctly for legal m and n int func(int m,int n) { if(n==0)||(m==n) return 1; else return E; } In the function which is correct expression for E? a)func(m-1,n)+func(m-1,n-1) b)func(m-1,n+1)+func(m-1,n) c)func(m,n)+func(m,n-1) d)None
Consider the following function that computes the value of $\binom{m}{n}$ correctly for legal m and nint func(int m,int n) { if(n==0)||(m==n) return 1; else return E; }In...
571
views
answered
Oct 31, 2017
Programming in C
programming-in-c
+
–
2
votes
19
EM: Limits
Please solve the following question:
Please solve the following question:
620
views
answered
Oct 29, 2017
Calculus
calculus
limits
engineering-mathematics
+
–
7
votes
20
Deadlock
There are 5 processes and 10 instances of a Resource. If each process needs ‘P’ instances which is the minimum value of ‘P’ for the deadlock to occur? (a) 1 (b) 2 (c) 3 (d) 4
There are 5 processes and 10 instances of a Resource. If each process needs ‘P’ instances which is the minimum value of ‘P’ for the deadlock to occur?(a) 1 ...
3.3k
views
answered
Oct 29, 2017
Operating System
deadlock-prevention-avoidance-detection
operating-system
process-synchronization
circular-wait
+
–
32
votes
21
Kenneth Rosen Edition 6th Exercise 6.4 Question 5 d (Page No. 440)
What could be the closed form of the generating function for the sequence {an} where an=2n+3 for n=0,1,2,3.... ?
What could be the closed form of the generating function for the sequence {an} wherean=2n+3 for n=0,1,2,3.... ?
2.1k
views
answered
Oct 29, 2017
Combinatory
kenneth-rosen
discrete-mathematics
generating-functions
+
–
0
votes
22
Combinatorics
The number of ways in which 4 person each rolling a single dice once can have total of 17??? Plz explain.... The answer is 104 ways,
The number of ways in which 4 person each rolling a single dice once can have total of 17???Plz explain....The answer is 104 ways,
611
views
answered
Oct 27, 2017
4
votes
23
no of superkeys
889
views
answered
Oct 26, 2017
Databases
databases
+
–
2
votes
24
Probability
518
views
answered
Oct 25, 2017
Probability
probability
conditional-probability
+
–
2
votes
25
SQL query
consider the following table customer: customer_id cust_name city grade salesman_id ----------- ------------ ---------- ---------- ----------- 3002 Nick Rimando New York 100 5001 3005 Graham Zusi California 200 5002 3001 Brad Guzan London 5005 ... is the given answer, query 2 is my answer where I'm using < operator, so both queries will produce the same result for given problem???
consider the following table customer:customer_id cust_name city grade salesman_id - - 3002 Nick Rimando New York 100 5001 3005 Graham Zusi California 200 5002 3...
1.1k
views
answered
Oct 24, 2017
Databases
sql
+
–
7
votes
26
GATE CSE 2007 | Question: 3
What is the maximum number of different Boolean functions involving $n$ Boolean variables? $n^2$ $2^n$ $2^{2^n}$ $2^{n^2}$
What is the maximum number of different Boolean functions involving $n$ Boolean variables?$n^2$$2^n$$2^{2^n}$$2^{n^2}$
10.2k
views
answered
Oct 14, 2017
Set Theory & Algebra
gatecse-2007
combinatory
functions
normal
+
–
3
votes
27
integration question
$f(x) = \int_{- \infty}^{\infty} f(x) e^{2\pi x} dx$ solve f(x)
$f(x) = \int_{- \infty}^{\infty} f(x) e^{2\pi x} dx$solve f(x)
2.6k
views
answered
Oct 11, 2017
Calculus
integration
definite-integral
calculus
engineering-mathematics
+
–
0
votes
28
Inverse of a function
Consider a function f from A to B such that f : A → B is bijective. f–1 represents inverse of f. Than could we say that f-1 :B->A is also bijective..Please give proper reasoning thanks
Consider a function f from A to B such that f : A → B is bijective.f–1 represents inverse of f.Than could we say that f-1 :B->A is also bijective..Please give proper ...
818
views
answered
Oct 7, 2017
Set Theory & Algebra
discrete-mathematics
functions
+
–
0
votes
29
compound interest
Rs . 5887 is divided between ram and shyam such that shyams share at the end of 9 years is equal to ram's share at the end of 11 years compounded annualy at the rate of 5%. The share of shyam is _________________
Rs . 5887 is divided between ram and shyam such that shyams share at the end of 9 years is equal to ram's share at the end of 11 years compounded annualy at the rate of 5...
1.9k
views
answered
Sep 27, 2017
1
votes
30
Self doubt--Byte Offset or Word Offset-Eg from Stallings
Here is a simple problem from Stallings.My confusion is with the offset bits in the address.If we are not mentioned anything about word addressing and byte addressing,what is the safest thing to assume? For example below exercise ... ?Hence it is like 2 bits for word addressing and 2 bits for internally selecting byte inside a word??
Here is a simple problem from Stallings.My confusion is with the offset bits in the address.If we are not mentioned anything about word addressing and byte addressing,wha...
1.0k
views
answered
Sep 27, 2017
CO and Architecture
co-and-architecture
+
–
Page:
1
2
3
4
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register