menu
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

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

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 differentiable at $x=2$ $f(x)$ is differentiable at $x=1$ but not at $x=2$ none of the above
answered Oct 14, 2019 in Calculus 112 views
0 answers
2
ME TEST
How is g(x) is many one ?
How is g(x) is many one ?
commented Dec 20, 2018 in Set Theory & Algebra 72 views
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 8 word block What is 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 8 word block What is hit ratio for for(i=0;i<100;i++) x=A[i]+100; No of time block 0 is modified.
commented Dec 20, 2018 in CO and Architecture 64 views
5 answers
4
GATE2018-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 O) 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 smallest $k$ such that $L^k = L^{k+1}$. Consider the language $L_1$ (over alphabet O) accepted by the following automaton. The order of $L_1$ is ____
commented Oct 5, 2018 in Theory of Computation 7.8k views
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?
commented Aug 26, 2018 in GATE 683 views
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 this function f(x), or some other procedure to follow to ans this)
commented May 20, 2018 in Calculus 282 views
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 correct answer to this question?
commented May 19, 2018 in Programming 74 views
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 ?
commented May 5, 2018 in Programming 108 views
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?
commented Mar 22, 2018 in DS 242 views
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{bmatrix}2 & 1 &2\\4 & 2 & 4\\2 & 1 &2\end{bmatrix}$
commented Mar 17, 2018 in Linear Algebra 508 views
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) \}$
commented Mar 5, 2018 in Theory of Computation 180 views
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=600 Then among P,Q,R,S , which two angles are equal?
commented Mar 5, 2018 in Numerical Ability 136 views
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 | \neq 6 \right \}$
commented Mar 4, 2018 in Theory of Computation 192 views
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$
answer selected Mar 3, 2018 in Linear Algebra 184 views
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 $ Which of the following statement is correct? A. L4 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
commented Mar 2, 2018 in Theory of Computation 125 views
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?
commented Mar 1, 2018 in Programming 146 views
6 answers
21
GATE2018-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 trial ... probable 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 tie, they roll the dice repeatedly until there is no tie. Define a trial as a ... equi-probable and that all trials are independent. The probability (rounded to $3$ decimal places) that one of them wins on the third trial is ____
commented Mar 1, 2018 in Probability 4.2k views
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 DCFL 3. If a language is closed under complement,difference then it is closed under intersection since $L1 - L2' = L1 \cap L2$
commented Feb 25, 2018 in Theory of Computation 184 views
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
commented Feb 25, 2018 in DS 1.1k views
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? $f(x) \text{is discontinuous at x = 0}$ ... $f(x) \text{is differentiable but its first derivative is not differentiable at x = 0} $
comment edited Feb 21, 2018 in Calculus 676 views
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$. What would be the value of $G(F(1, 3), G(1, 3))$? $2$ $4$ $6$ $36$
answered Feb 21, 2018 in Numerical Ability 367 views
2 answers
26
GATE1988-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} \}$
commented Feb 21, 2018 in Theory of Computation 851 views
7 answers
28
GATE2007-IT-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 and returns ... 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, false otherwise. $delete (Q)$ - deletes the element at the front of the queue and returns its value ... at the front of the queue $Q$ and inserts it at the rear keeping the other elements in the same order Empties the queue $Q$
commented Feb 19, 2018 in DS 3.7k views
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}$
commented Feb 19, 2018 in Combinatory 139 views
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...