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 Himanshu1
2
answers
1
UGC NET CSE | December 2014 | Part 2 | Question: 05
If we define the functions $f$, $g$ and $h$ that map $R$ into $R$ by : $f(x)=x^{4}, g(x)= \sqrt{x^{2}+1}, h(x)=x^{2}+72$, then the value of the composite functions $ho(gof)$ and $(hog)of$ are given as $x^{8}-71$ and $x^{8}-71$ $x^{8}-73$ and $x^{8}-73$ $x^{8}+71$ and $x^{8}+71$ $x^{8}+73$ and $x^{8}+73$
If we define the functions $f$, $g$ and $h$ that map $R$ into $R$ by : $f(x)=x^{4}, g(x)= \sqrt{x^{2}+1}, h(x)=x^{2}+72$, then the value of the composite functions $ho(go...
2.4k
views
recategorized
Apr 12, 2020
Set Theory & Algebra
ugcnetcse-dec2014-paper2
discrete-mathematics
functions
+
–
1
answer
2
UGC NET CSE | June 2013 | Part 2 | Question: 40
The truth value of the statements: $\exists ! xP(x) \rightarrow \exists xP(x) \text{ and } \exists ! x \rceil P(x) \rightarrow \rceil \forall xP(x)$, (where the notation $\exists ! x P(x)$ denotes the proposition “There exists a unique $x$ such that $P(x)$ is true”) are: True and False False and True False and False True and True
The truth value of the statements:$\exists ! xP(x) \rightarrow \exists xP(x) \text{ and } \exists ! x \rceil P(x) \rightarrow \rceil \forall xP(x)$, (where the notation $...
1.6k
views
edited
Apr 5, 2020
Mathematical Logic
ugcnetcse-june2013-paper2
+
–
4
answers
3
UGC NET CSE | July 2018 | Part 2 | Question: 86
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ is Z Q R C
If $A_i = \{-i, \dots , -2, -1, 0, 1, 2, \dots , i \}$ then $\cup_{i=1}^\infty A_i$ isZQRC
1.5k
views
answered
Apr 5, 2020
Discrete Mathematics
ugcnetcse-july2018-paper2
discrete-mathematics
+
–
3
answers
4
median of two sorted Arrays
1.6k
views
commented
Jun 5, 2016
Algorithms
algorithms
time-complexity
sorting
test-series
+
–
1
answer
5
1000th power of a matrix
Find the 1000_th power of the matrix -
Find the 1000_th power of the matrix -
1.4k
views
answer reshown
Jun 3, 2016
Linear Algebra
linear-algebra
matrix
+
–
2
answers
6
Probability
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collisions by linear probing is (assume uniform hashing) a)2/3 b)1/3 c)1 d) 1/6
In a hash table of size 6 currently the locations 0,2,4 and 5 are occupied. The probability of a new record going into location 1 with a hash function resolving collision...
726
views
commented
May 2, 2016
0
answers
7
Find the age of Daughters - This was asked in Google
464
views
edited
May 1, 2016
Quantitative Aptitude
quantitative-aptitude
+
–
2
answers
8
Binary Number when interpreted as decimal mod 12
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
What are the Number of states in minimum DFA that accepts Binary strings when interpreted as decimal mod 12 give 0 as remainder.Also give DFA.
1.4k
views
commented
Apr 21, 2016
Theory of Computation
minimal-state-automata
theory-of-computation
+
–
2
answers
9
A better guess on upper bound
It's a question from Cormen book Exercise 4.4-5 and is described like this: Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+T(\frac{n}{2})+n$
It's a question from Cormen book Exercise 4.4-5 and is described like this:Use a recursion tree to determine a good asymptotic upper bound on the recurrence $T(n)=T(n-1)+...
894
views
commented
Apr 18, 2016
Algorithms
asymptotic-notation
recurrence-relation
+
–
2
answers
10
least significant digit of 2 ^ (3 * (10 ^ 100) )
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$ 2 4 6 8
Find the least significant digit of $2^{3 \times 10 ^ {100 }}$2468
967
views
asked
Apr 15, 2016
Quantitative Aptitude
quantitative-aptitude
numerical-answers
+
–
1
answer
11
Identify whether the problem is classification or Regression.
481
views
answer selected
Apr 6, 2016
Artificial Intelligence
machine-learning
non-gate
+
–
1
answer
12
Performance measure P
651
views
edited
Apr 6, 2016
Artificial Intelligence
machine-learning
+
–
0
answers
13
Why aren't CS people scoring high in GATE?
Highest mark in GATE CSE 2016: 88, 2015: 85 and in previous years too it is mostly the same. In other branches like ME, EE etc 98, 99 marks are common. What's the reason for this? Difficult/ambiguous questions are for all streams and this won't count for more than 5 marks. Moreover aptitude/mathematics portion are same for all streams.
Highest mark in GATE CSE 2016: 88, 2015: 85 and in previous years too it is mostly the same.In other branches like ME, EE etc 98, 99 marks are common.What's the reason fo...
493
views
commented
Apr 5, 2016
Others
general
+
–
1
answer
14
Output of c program
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
void fun(int *p) { int q = 10; p = &q; } int main() { int r = 20; int *p = &r; fun(p); printf("%d", *p); return 0; }
8.8k
views
answer selected
Mar 15, 2016
Programming in C
programming-in-c
barc2016
pointers
+
–
3
answers
15
GATE2011 GG: GA-7
In a class of $300$ students in an M.Tech programme, each student is required to take at least one subject from the following three: M600: Advanced Engineering Mathematics C600: Computational Methods for Engineers E600: Experimental Techniques for Engineers The registration data ... number of students in the class who have taken all the above three subjects? $20$ $30$ $40$ $50$
In a class of $300$ students in an M.Tech programme, each student is required to take at least one subject from the following three:M600: Advanced Engineering Mathematics...
3.6k
views
commented
Mar 15, 2016
Quantitative Aptitude
gate2011-gg
quantitative-aptitude
set-theory&algebra
venn-diagram
+
–
1
answer
16
Gate_EE_2006
3.6k
views
answered
Mar 10, 2016
Calculus
engineering-mathematics
integration
+
–
1
answer
17
GATE_2014 ME
Consider a 3 x 3 real symmetric matrix S such that two of its eigen values are a ≠ 0 , b ≠ 0 with respective Eigen vectors [ x1 x2 x3 ] , [ y1 y2 y3 ] . If a ≠ b then x1y1 + x2y2 + x3y3 is a) a b) b c) ab d) 0
Consider a 3 x 3 real symmetric matrix S such that two of its eigen values are a ≠ 0 , b ≠ 0 with respective Eigen vectors [ x1 x2 x3 ] , [ y1 y2 y3 ] . If a &ne...
2.4k
views
answer selected
Mar 8, 2016
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
7
answers
18
GATE CSE 2016 Set 1 | Question: GA08
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$. $P$ always beats $Q$ $R$ always beats $S$ $S$ loses to $P$ only sometimes. $R$ always loses to $Q$ Which of the following can be logically ... $S$ is the absolute worst player in the set (i). only (ii) only (i) and (ii) only' neither (i) nor (ii)
Consider the following statements relating to the level of poker play of four players $P,Q,R \ and \ S$.$P$ always beats $Q$$R$ always beats $S$$S$ loses to $P$ only som...
7.9k
views
commented
Mar 7, 2016
Analytical Aptitude
gatecse-2016-set1
analytical-aptitude
normal
statements-follow
+
–
1
answer
19
Selection of proper domain for masters
Q. What are the various areas , one can choose in IITs/IISc. for masters ? What is their respective future scope ? When this selection is to be made ?
Q. What are the various areas , one can choose in IITs/IISc. for masters ? What is their respective future scope ? When this selection is to be made ?
2.7k
views
comment reshown
Feb 27, 2016
IISc/IITs
area-of-interest
+
–
3
answers
20
IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2 Difference between D&C and Dynamic Programming ?
704
views
commented
Feb 25, 2016
18
answers
21
GATE CSE 2016 Set 1 | Question: 39
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight spanning tree of $G$ can have is __________
Let $G$ be a complete undirected graph on $4$ vertices, having $6$ edges with weights being $1, 2, 3, 4, 5,$ and $6$. The maximum possible weight that a minimum weight s...
35.5k
views
commented
Feb 25, 2016
Algorithms
gatecse-2016-set1
algorithms
spanning-tree
normal
numerical-answers
+
–
2
answers
22
GATE2012 CY: GA-8
The data given in the following table summarizes the monthly budget of an average household. ... $10\%$ $14\%$ $81\%$ $86\%$
The data given in the following table summarizes the monthly budget of an average household.$$\begin{array}{|l|c|c|} \hline \textbf{Category} & \textbf{Amount(Rs.)} \\\hl...
2.7k
views
commented
Feb 21, 2016
Quantitative Aptitude
gate2012-cy
quantitative-aptitude
percentage
+
–
9
answers
23
GATE CSE 2016 Set 1 | Question: 33
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is $\Theta (1)$ $\Theta (\log(n))$ $\Theta (\sqrt{n})$ $\Theta (n)$)
Consider a carry look ahead adder for adding two $n$-bit integers, built using gates of fan-in at most two. The time to perform addition using this adder is$\Theta (1)$$\...
31.1k
views
commented
Feb 21, 2016
Digital Logic
gatecse-2016-set1
digital-logic
adder
normal
+
–
2
answers
24
GATE2012 CY: GA-1
If $(1.001)$^{1259}$= $3.52$ and $(1.001)$^{2062}$= $7.85$, then $(1.001)$^{3321}$= $2.23$ $4.33$ $11.37$ $27.64$
If $(1.001)$$^{1259}$= $3.52$ and $(1.001)$$^{2062}$= $7.85$, then $(1.001)$$^{3321}$=$2.23$$4.33$$11.37$$27.64$
2.4k
views
answered
Feb 21, 2016
Quantitative Aptitude
gate2012-cy
quantitative-aptitude
modular-arithmetic
+
–
4
answers
25
GATE CSE 2016 Set 2 | Question: 32
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.
The width of the physical address on a machine is $40$ bits. The width of the tag field in a $512$ KB $8$-way set associative cache is ________ bits.
17.8k
views
commented
Feb 20, 2016
CO and Architecture
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
+
–
5
answers
26
GATE CSE 2016 Set 1 | Question: 44
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$, and $Z$ reduces to $\overline{X}$ (reduction means the standard ... enumerable. $W$ is not recursively enumerable and $Z$ is recursive. $W$ is not recursively enumerable and $Z$ is not recursive.
Let $X$ be a recursive language and $Y$ be a recursively enumerable but not recursive language. Let $W$ and $Z$ be two languages such that $\overline{Y}$ reduces to $W$,...
12.5k
views
commented
Feb 18, 2016
Theory of Computation
gatecse-2016-set1
theory-of-computation
easy
recursive-and-recursively-enumerable-languages
reduction
+
–
8
answers
27
GATE CSE 2016 Set 2 | Question: 33
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac{3 \tau_2}{4}=2\tau_3$. If the longest pipeline stage is split into two pipeline stages of equal latency , the new frequency is __________ $\text{GHz}$, ignoring delays in the pipeline registers.
Consider a $3 \ \text{GHz}$ (gigahertz) processor with a three stage pipeline and stage latencies $\large\tau_1,\tau_2$ and $\large\tau_3$ such that $\large\tau_1 =\dfrac...
19.2k
views
answered
Feb 15, 2016
CO and Architecture
gatecse-2016-set2
co-and-architecture
pipelining
normal
numerical-answers
+
–
2
answers
28
GATE CSE 2016 Set 2 | Question: 39
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the worst case time complexity of this function is $O(n^{\alpha})$, then the least possible value (accurate up to two decimal positions) of $\alpha$ is ________. Flow chart for Recursive Function $A(n)$.
The given diagram shows the flowchart for a recursive function $A(n)$. Assume that all statements, except for the recursive calls, have $O(1)$ time complexity. If the wor...
16.5k
views
commented
Feb 14, 2016
Algorithms
gatecse-2016-set2
algorithms
time-complexity
recurrence-relation
normal
numerical-answers
+
–
13
answers
29
GATE CSE 2016 Set 2 | Question: 50
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to read a block from the disk is $10$ ms. Assume that the cost ... in multiples of $10$ MB. The smallest cache size required to ensure an average read latency of less than $6$ ms is _________ MB.
A file system uses an in-memory cache to cache disk blocks. The miss rate of the cache is shown in the figure. The latency to read a block from the cache is $1$ ms and to...
15.1k
views
commented
Feb 14, 2016
CO and Architecture
gatecse-2016-set2
co-and-architecture
cache-memory
normal
numerical-answers
+
–
4
answers
30
GATE CSE 2016 Set 2 | Question: 41
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $[u]$ in the adjacency list of $v$. These are called twins of each other. A twin pointer ... $\Theta\left(n+m\right)$ $\Theta\left(m^{2}\right)$ $\Theta\left(n^{4}\right)$
In an adjacency list representation of an undirected simple graph $G=(V, E)$, each edge $(u, v)$ has two adjacency list entries: $[v]$ in the adjacency list of $u$, and $...
19.7k
views
commented
Feb 13, 2016
Algorithms
gatecse-2016-set2
algorithms
graph-algorithms
normal
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register