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
Recent activity by joshi_nitish
1
answer
1
ISI2014-DCG-13
Let the function $f(x)$ be defined as $f(x)=\mid x-1 \mid + \mid x-2 \:\mid$. Then which of the following statements is true? $f(x)$ is differentiable at $x=1$ $f(x)$ is differentiable at $x=2$ $f(x)$ is differentiable at $x=1$ but not at $x=2$ none of the above
Let the function $f(x)$ be defined as $f(x)=\mid x-1 \mid + \mid x-2 \:\mid$. Then which of the following statements is true?$f(x)$ is differentiable at $x=1$$f(x)$ is di...
565
views
answered
Oct 14, 2019
Calculus
isi2014-dcg
calculus
differentiation
+
–
0
answers
2
ME TEST
How is g(x) is many one ?
How is g(x) is many one ?
246
views
commented
Dec 20, 2018
Set Theory & Algebra
made-easy-test-series
+
–
0
answers
3
MADE EASY
Consider an array A[100] and each element occupies 4 word a 32-word cache is used and divided into an 8-word block What is the hit ratio for for(i=0;i<100;i++) x=A[i]+100; No of time block 0 is modified.
Consider an array A[100] and each element occupies 4 word a 32-word cache is used and divided into an 8-word blockWhat is the hit ratio for for(i=0;i<100;i++...
507
views
commented
Dec 20, 2018
CO and Architecture
co-and-architecture
array
+
–
4
answers
4
GATE CSE 2018 | Question: 52
Given a language $L$, define $L^i$ as follows:$L^0 = \{ \varepsilon \}$$L^i = L^{i-1} \bullet L \text{ for all } I >0$The order of a language $L$ is defined as the smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1 ($over alphabet $0)$ accepted by the following automaton. The order of $L_1$ is ________.
Given a language $L$, define $L^i$ as follows:$$L^0 = \{ \varepsilon \}$$$$L^i = L^{i-1} \bullet L \text{ for all } I >0$$The order of a language $L$ is defined as the s...
20.7k
views
commented
Oct 5, 2018
Theory of Computation
gatecse-2018
theory-of-computation
numerical-answers
regular-language
2-marks
+
–
0
answers
5
Gate Preparation
Are there resources for formulae of each subject of gate CSE?
Are there resources for formulae of each subject of gate CSE?
1.2k
views
commented
Aug 26, 2018
GATE
gate-preparation
study-resources
+
–
0
answers
6
Integration
$f\left ( x \right )=$\int_{-2}^{2}x^{-\frac{2}{7}}dx$ Is this function f(x) is continuous, bounded and differentiable? (In exam hall is it possible to draw the graph for this function f(x), or some other procedure to follow to ans this)
$f\left ( x \right )=$$\int_{-2}^{2}x^{-\frac{2}{7}}dx$Is this function f(x) is continuous, bounded and differentiable?(In exam hall is it possible to draw the graph for ...
1.8k
views
commented
May 20, 2018
Calculus
integration
+
–
0
answers
7
C (strlen)
In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the correct answer to this question?
In this question the length of a given string is given as 12 in the solution but it should be 11 as strlen function exclude null value and give the length.Please give the...
529
views
commented
May 19, 2018
2
answers
8
Peter Linz Edition 4 Exercise 2.1 Question 21 (Page No. 48)
Let L be the language accepted by the automaton $L = ${$(a^{n})b:n≥0$}. Find a dfa that accepts the language $L^{2} - L$.
Let L be the language accepted by the automaton $L = ${$(a^{n})b:n≥0$}. Find a dfa that accepts the language $L^{2} - L$.
788
views
commented
May 5, 2018
Theory of Computation
theory-of-computation
regular-language
peter-linz
peter-linz-edition4
finite-automata
grammar
+
–
0
answers
9
Test Series
What is the output.My doubt is : What is meant by call by copy restore ? is it same as call by reference or there is some difference ?
What is the output.My doubt is : What is meant by call by copy restore ? is it same as call by reference or there is some difference ?
423
views
commented
May 5, 2018
Programming in C
programming-in-c
parameter-passing
+
–
1
answer
10
Binary Tree
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
What is the number of binary trees with 4 nodes which when traversed in pre-order gives the sequence 1,2,3,4?
751
views
commented
Mar 22, 2018
DS
data-structures
binary-tree
+
–
2
answers
11
finite automata
Draw the DFA for (a*b +b*a)
Draw the DFA for (a*b +b*a)
599
views
answer selected
Mar 17, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
12
Calculate Eigen Vector And Eigen Value
This matrix is singular with rank one. Find three $λ$’s and three eigenvectors. $\begin{bmatrix}1\\2 \\1 \end{bmatrix}$ $\begin{bmatrix}2&1 &2 \end{bmatrix}$ = $\begin{bmatrix}2 & 1 &2\\4 & 2 & 4\\2 & 1 &2\end{bmatrix}$
This matrix is singular with rank one. Find three $λ$’s and three eigenvectors.$\begin{bmatrix}1\\2 \\1 \end{bmatrix}$ $\begin{bmatrix}2&1 &2 \end{bmatrix}$ = $\begin...
1.6k
views
commented
Mar 17, 2018
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
1
answer
13
Peter Linz Edition 4 Exercise 3.1 Question 10 (Page No. 76)
Give a regular expression for L = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
Give a regular expression forL = $\left \{a^{n}b^{m};n\geq 1,m \geq 1,nm \geq3 \right \}$
2.4k
views
commented
Mar 14, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
regular-expression
+
–
1
answer
14
Peter Linz Edition 4 Exercise 3.1 Question 9 (Page No. 76)
Give a regular expression for $L^{R}$ L = $(a+bc)^{*}(c+\phi)$
Give a regular expression for $L^{R}$L = $(a+bc)^{*}(c+\phi)$
378
views
commented
Mar 14, 2018
Theory of Computation
theory-of-computation
regular-language
peter-linz
peter-linz-edition4
regular-expression
+
–
1
answer
15
Peterlinz question
Please write grammar for it and explain with example. $L=\{w \: : n_a(w) > n_b(w) \}$
Please write grammar for it and explain with example.$L=\{w \: : n_a(w) n_b(w) \}$
431
views
commented
Mar 4, 2018
Theory of Computation
grammar
theory-of-computation
+
–
1
answer
16
Aptitude Doubt
In the following figure, side QS is congruent to side SP, RPQ=50o and PSR=600 Then among P,Q,R,S , which two angles are equal?
In the following figure, side QS is congruent to side SP, RPQ=50o and PSR=600Then among P,Q,R,S , which two angles are equal?
439
views
commented
Mar 4, 2018
Quantitative Aptitude
quantitative-aptitude
general-aptitude
+
–
0
answers
17
Peter linz exercise 2.1
$\sum = \left \{ a,b \right \}$ Is it possible to create DFA for given language with less than 10 states? L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \neq 6 \right \}$
$\sum = \left \{ a,b \right \}$Is it possible to create DFA for given language with less than 10 states?L = $\left \{ w: \left | w \right | mod 3 = 0, \left |w \right | \...
478
views
commented
Mar 4, 2018
Theory of Computation
theory-of-computation
finite-automata
+
–
1
answer
18
Eigen value of the following matrix
The eigen value of the following matrix is $\begin{bmatrix}1&1&1\\1&1&1\\1&1&1\end{bmatrix}$ $1, 1, 1$ $1, 0, 0$ $3, 0, 0$ $0, 0, 0$
The eigen value of the following matrix is $\begin{bmatrix}1&1&1\\1&1&1\\1&1&1\end{bmatrix}$ $1, 1, 1$$1, 0, 0$$3, 0, 0$$0, 0, 0$
817
views
answer selected
Mar 2, 2018
Linear Algebra
eigen-value
matrix
+
–
1
answer
19
Finding whether given languages are regular or context free
Given $L_1=\{a^nb^nc^n | n\geq 0\}$ $L_2 =\{a^nb^mc^k|k=n+m \text{ and }n,m\geq 0 \}$ $L_3 =\{a^nb^mc^k|n,m,k \geq 0 \}$ Assume $L_4=L_1 (L_3)^*$ $L_5=(L_1\cap L_2)\cup L_3 $ Which of the following ... is regular and L5 is not regular B. L4 is CFL and L5 is not CFL C. Both L4, L5 are regular D. Both L4, L5 are CFL but not regular
Given$L_1=\{a^nb^nc^n | n\geq 0\}$$L_2 =\{a^nb^mc^k|k=n+m \text{ and }n,m\geq 0 \}$$L_3 =\{a^nb^mc^k|n,m,k \geq 0 \}$Assume $L_4=L_1 (L_3)^*$$L_5=(L_1\cap L_2)\cup L_3...
546
views
commented
Mar 2, 2018
Theory of Computation
regular-language
context-free-language
+
–
1
answer
20
C programming
#include<stdio.h> int main() { printf("%d\n",1==5==5); printf("%d\n",1==5!=5); printf("%d\n",1!=5!=5); printf("%d\n",1!=5==5); return 0; } What is the output?
#include<stdio.h int main() { printf("%d\n",1==5==5); printf("%d\n",1==5!=5); printf("%d\n",1!=5!=5); printf("%d\n",1!=5==5); return 0; }What is the output?
501
views
commented
Mar 1, 2018
Programming in C
programming-in-c
output
+
–
8
answers
21
GATE CSE 2018 | Question: 15
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a tie, they roll the dice repeatedly until there is no tie. Define a ... and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
Two people, $P$ and $Q$, decide to independently roll two identical dice, each with $6$ faces, numbered $1$ to $6$. The person with the lower number wins. In case of a ti...
11.0k
views
commented
Mar 1, 2018
Probability
gatecse-2018
probability
normal
numerical-answers
1-mark
+
–
0
answers
22
which of the following are true
1. $L' = \sum^*−L$ for any language $L$ 2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL 3. If a language is closed under complement,difference then it is closed under intersection since $L1 - L2' = L1 \cap L2$
1. $L' = \sum^*−L$ for any language $L$2. $L=\{a^ma^nb^n\mid m>0 , n>0 \}$ is DCFL3. If a language is closed under complement,difference then it is closed under inters...
519
views
commented
Feb 25, 2018
Theory of Computation
theory-of-computation
+
–
4
answers
23
Number of binary search trees
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
How many different binary search trees can be constructed using six distinct keys? 256 128 132 264
6.8k
views
commented
Feb 25, 2018
DS
binary-tree
binary-search
binary-search-tree
+
–
1
answer
24
Mathematics GATE 2018 EE: 11
Let $f$ be a real-valued function of a real variable defined as $f(x) = x^{2}$ for $x\geq0$ and $f(x) = -x^{2}$ for $x < 0$.Which one of the following statements is true? $f(x) \text{is discontinuous at x = 0}$ ... $f(x) \text{is differentiable but its first derivative is not differentiable at x = 0} $
Let $f$ be a real-valued function of a real variable defined as $f(x) = x^{2}$ for $x\geq0$ and $f(x) = -x^{2}$ for $x < 0$.Which one of the following statements is true...
3.1k
views
comment edited
Feb 21, 2018
Calculus
gate2018-ee
engineering-mathematics
calculus
continuity
differentiation
+
–
1
answer
25
GATE2018 EE: GA-5
Functions $F(a, b)$ and $G(a, b)$ are defined as follows: $F(a, b) = (a − b)^2$ and $G(a, b) = \mid a − b\mid$, where $\mid x \mid$ represents the absolute value of $x$. What would be the value of $G(F(1, 3), G(1, 3))$? $2$ $4$ $6$ $36$
Functions $F(a, b)$ and $G(a, b)$ are defined as follows:$F(a, b) = (a − b)^2$ and $G(a, b) = \mid a − b\mid$, where $\mid x \mid$ represents the absolute value of $x...
1.7k
views
answered
Feb 21, 2018
Quantitative Aptitude
gate2018-ee
general-aptitude
quantitative-aptitude
easy
functions
+
–
2
answers
26
GATE CSE 1988 | Question: 2ix
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
What is the type of the language $L$, where $L=\{a^n b^n \mid 0 < n < 327 \text{-th prime number} \}$
3.0k
views
commented
Feb 21, 2018
Theory of Computation
gate1988
normal
descriptive
theory-of-computation
identify-class-language
+
–
0
answers
27
Given a binary search trees for a set of n=5 keys with thei 0 1 2 3 4 5
336
views
closed
Feb 21, 2018
11
answers
28
GATE IT 2007 | Question: 30
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are: $isEmpty (Q)$ - returns true if the queue is empty, false otherwise. $delete (Q)$ - deletes the element at the front of the queue ... the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$
Suppose you are given an implementation of a queue of integers. The operations that can be performed on the queue are:$isEmpty (Q)$ — returns true if the queue is empty...
16.3k
views
commented
Feb 19, 2018
DS
gateit-2007
data-structures
queue
normal
+
–
1
answer
29
Peter Linz Edition 4 Exercise 2.1 Question 7.e (Page No. 47)
Please help in creating the DFA for (na (w)-nb (w))mod 3>0
Please help in creating the DFA for (na (w)-nb (w))mod 3>0
1.2k
views
commented
Feb 19, 2018
Theory of Computation
theory-of-computation
peter-linz
peter-linz-edition4
finite-automata
+
–
0
answers
30
Sheldon Ross
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and $\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$
Determine the number of vectors $\{x_{1}...x_{n}\}$, such that each $x_{i}$ is either $0$ or $1$ and$\displaystyle{\sum_{i=1}^{n}x_{i}\geq k}$
651
views
commented
Feb 19, 2018
Combinatory
sheldon-ross
combinatory
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register