Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Filter
User joshi_nitish
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by joshi_nitish
0
votes
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
answered
in
Calculus
Oct 14, 2019
381
views
isi2014-dcg
calculus
differentiation
9
votes
2
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} $
answered
in
Calculus
Feb 21, 2018
2.6k
views
gate2018-ee
engineering-mathematics
calculus
continuity
differentiation
4
votes
3
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$
answered
in
Quantitative Aptitude
Feb 21, 2018
1.4k
views
gate2018-ee
general-aptitude
quantitative-aptitude
easy
functions
43
votes
4
GATE CSE 2018 | Question: 25
Consider a long-lived $\text{TCP}$ session with an end-to-end bandwidth of $1\; \text{Gbps}\; (=10^9$ bits-per-second$).$ The session starts with a sequence number of $1234$. The minimum time (in seconds, rounded to the closet integer) before this sequence number can be used again is _________.
answered
in
Computer Networks
Feb 14, 2018
16.5k
views
gatecse-2018
computer-networks
tcp
normal
numerical-answers
1-mark
6
votes
5
ME 2014- Z score probability Normal-Distribution
A nationalized bank has found that the daily balance available in its saving bank accounts follows a normal distribution with a mean of Rs. 500 and a standard deviation of Rs. 50. The percentage of savings account holders who maintain ... Rs. 500 is _______________. Explain the calculation of the probability of Z score. Do GATE provide Z score table?
answered
in
Probability
Jan 23, 2018
1.5k
views
engineering-mathematics
probability
z-score
normal-distribution
1
vote
6
Slop of Curve
please share your solution The maximum slope of the curve -x3+6x2+66x+666
answered
in
Mathematical Logic
Jan 16, 2018
256
views
6
votes
7
Probability NPTEL assignment
Find Value of alpha?
answered
in
Mathematical Logic
Dec 20, 2017
350
views
5
votes
8
ISRO-DEC2017-8
The number of elements in the power set of $\{\{1,2\},\{2,1,1\},\{2,1,1,2\}\}$ is $3$ $8$ $4$ $2$
answered
in
Set Theory & Algebra
Dec 20, 2017
3.8k
views
isrodec2017
3
votes
9
Undecidability
L = { <M> | M is a TM and |L(M)| <= 3 }. Is it Recursively Enumerable or not ?
answered
in
Theory of Computation
Nov 11, 2017
897
views
decidability
theory-of-computation
3
votes
10
Integration
answered
in
Calculus
Nov 3, 2017
298
views
calculus
engineering-mathematics
integration
10
votes
11
Test by Bikram | Mock GATE | Test 4 | Question: 16
Consider a sorted array of $k+1$ elements, where the elements are first $k$ natural numbers $-\left \{ 1, 2, 3, 4, 5,\dots, k \right \}$ and any one of those $k$ numbers is repeated. The time complexity of best algorithm to find that repeated number is: $O\left ( k \right )$ $O\left ( k\log k \right )$ $O\left ( \log k \right )$ $O(1)$
answered
in
Algorithms
Oct 19, 2017
373
views
tbb-mockgate-4
algorithms
time-complexity
4
votes
12
Minimum number of states
$R= 10 +(0 +11)0^{*}1.$ The minimum number of states in any DFA accepting this regular expression.
answered
in
Theory of Computation
Sep 15, 2017
2.8k
views
finite-automata
2
votes
13
self doubt
Which of the following is true: (a) differentiable and continous (d) none of these (c) not differentiable but continous (b) neither differentiable nor continous
answered
in
Calculus
Sep 9, 2017
236
views
3
votes
14
Time Complexity of Iterative Program
The innermost loop will execute when j is multiple of i, and that will happen exactly i times. Please help me to find the time complexity of the below program:
answered
in
Algorithms
Aug 29, 2017
2.1k
views
time-complexity
algorithms
asymptotic-notations
0
votes
15
decidability
S = { < M> | M is a DFA that accepts some string containing an equal number of 0s and 1s}. Then what will be S - a) Recursive enumerable b) undecidable c) decidable d) Turing co-recognizable
answered
in
Theory of Computation
Aug 21, 2017
693
views
4
votes
16
Theory Of Computation
Construct a minimal dfa over {0,1} which neither accept 00 as a substring nor 11 as a substring.
answered
in
Theory of Computation
Aug 20, 2017
2.2k
views
theory-of-computation
finite-automata
normal
1
vote
17
synchronous data transfer
A synchronous transmission T has transfer rate of 100 char/ sec. If T uses some synchronous characters followed by some 8 bit info characters, what is the total number of synchronous bits required where bit rate is 1000 bits/ sec?
answered
in
CO and Architecture
Aug 7, 2017
825
views
synchronous-data
transfer
2
votes
18
TOC Minimal DFA design
Let language defined is { Number of a's =2 and length of string is atleast 3} over alphabet {a,b}.What are number of states in minimal DFA?
answered
in
Theory of Computation
Aug 6, 2017
590
views
theory-of-computation
minimal-state-automata
finite-automata
9
votes
19
Self Doubt
Whether the following statement is true or false?? "The OS maintains scheduling and accounting information for each thread"
answered
in
Operating System
Aug 4, 2017
451
views
operating-system
threads
2
votes
20
Class of language
answered
in
Theory of Computation
Aug 2, 2017
200
views
theory-of-computation
identify-class-language
1
vote
21
CO and architecture
Consider a hypothetical processor which supports the 64Kb physical memory. Processor uses the memory mapped IO configuration in which the 3 MSB bits of the address is 1, then assign them to IO ports. How many IO address and how many memory address are possible in the processor.
answered
in
CO and Architecture
Jul 26, 2017
359
views
2
votes
22
doubt
#include<stdio.h> int main() { char c = 125; c = c+10; printf("%d", c); return 0; } in this we know -121 is printed also know the logic but what will be in int main() { char c = 125; c = c+10; printf("%u", c); return 0; } plz explain with logic
answered
in
Programming
Jul 26, 2017
238
views
programming-in-c
0
votes
23
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}$
answered
in
Linear Algebra
Jul 24, 2017
1.3k
views
engineering-mathematics
linear-algebra
eigen-value
0
votes
24
Sets,Relation and Function
If f : R ---->R defined by f(x) = x2 + 1, then values of f -1 (17) and f -1(-3) are A. {Ø}, (4, - 4) B. {3,-3},{Ø} C. {Ø},{3,-3} D. {4,-4},Ø Answer is "D". But i dint understand how
answered
in
CBSE/UGC NET
Jul 24, 2017
917
views
1
vote
25
self doubt
identify the class of language {a^(m)b^(n)} for following a) m + n = 10 b) m + n <=10 c)m+n>10 d) m+n<10 e) m + n>=10 f) m/n = 10 g) m - n = 10
answered
in
Theory of Computation
Jul 22, 2017
110
views
6
votes
26
Explain the given C program.
<code>#include <stdio.h> int main() { unsigned int b = 20; b = ~b; printf("%d\n", b); }</code>
answered
in
Programming
Jul 14, 2017
762
views
programming-in-c
0
votes
27
Lattice
Is there any example of lattice which is not bounded ??
answered
in
Set Theory & Algebra
Jul 13, 2017
459
views
3
votes
28
Daa........
What is the ans and give reason
answered
in
Algorithms
Jul 12, 2017
461
views
sorting
algorithm-design-techniques
test-series
2
votes
29
Parsing
Someone please explain. Answer given is 2.
answered
in
Compiler Design
Jul 9, 2017
148
views
compiler-design
parsing
numerical-answers
test-series
0
votes
30
Regular Languages and Finite Automata
A language L = {w|w contain 'a' in every odd position, w belongs to {a, b}*} Doubt: Here, null string will be accepted or not. Please explain? This is really confusing in these types of questions whether to include null string or not. Please suggest some way to sort this out.
answered
in
Theory of Computation
Jul 8, 2017
440
views
theory-of-computation
Page:
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
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
Recent Posts
Recruitment of Scientific Officers in the Department of Atomic Energy 2023
GATE CSE 2023 Paper & Analysis - Memory Based
From GATE to Australia
DRDO Previous Year Papers
From Rank 4200 to 64: My Journey to Success in GATE CSE Exam
Subjects
All categories
General Aptitude
(2.5k)
Engineering Mathematics
(9.3k)
Digital Logic
(3.3k)
Programming and DS
(5.9k)
Algorithms
(4.6k)
Theory of Computation
(6.7k)
Compiler Design
(2.3k)
Operating System
(5.0k)
Databases
(4.6k)
CO and Architecture
(3.8k)
Computer Networks
(4.6k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(649)
Exam Queries
(843)
Tier 1 Placement Questions
(17)
Job Queries
(75)
Projects
(9)
Unknown Category
(853)
Recent Blog Comments
+1
1200/1000 = 1.2
Aptitude- 1- there was a question, Like in a...
Suppose typing happens at 1 keystroke per second....
The algorithm for graph colouring was to pick...