Dark Mode

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$

recategorized in Set Theory & Algebra Apr 12, 2020

2.4k views

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

edited in Mathematical Logic Apr 5, 2020

1.6k views

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

answered in Discrete Mathematics Apr 5, 2020

1.5k views

3 answers

4

median of two sorted Arrays

commented in Algorithms Jun 5, 2016

1.6k views

1 answer

5

1000th power of a matrix
Find the 1000_th power of the matrix -

answer reshown in Linear Algebra Jun 3, 2016

1.4k views

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

commented in Programming in C May 2, 2016

723 views

0 answers

7

Find the age of Daughters - This was asked in Google

edited in Quantitative Aptitude May 1, 2016

463 views

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.

commented in Theory of Computation Apr 21, 2016

1.4k views

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$

commented in Algorithms Apr 18, 2016

882 views

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

asked in Quantitative Aptitude Apr 15, 2016

949 views

1 answer

11

Identify whether the problem is classification or Regression.

answer selected in Artificial Intelligence Apr 6, 2016

480 views

1 answer

12

Performance measure P

edited in Artificial Intelligence Apr 6, 2016

642 views

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.

commented in Others Apr 5, 2016

494 views

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; }

answer selected in Programming in C Mar 15, 2016

8.7k views

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$

commented in Quantitative Aptitude Mar 15, 2016

3.6k views

1 answer

16

answered in Calculus Mar 10, 2016

3.5k views

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

answer selected in Linear Algebra Mar 8, 2016

2.4k views

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)

commented in Analytical Aptitude Mar 7, 2016

7.9k views

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 ?

comment reshown in IISc/IITs Feb 27, 2016

2.7k views

3 answers

20

IISc2012Research
#IISc2012Research 1>Recurrence relation and worst case time complexity of Merge sort 2> Difference between D&C and Dynamic Programming ?

commented in Interview Questions Feb 25, 2016

692 views

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 __________

commented in Algorithms Feb 25, 2016

35.3k views

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\%$

commented in Quantitative Aptitude Feb 21, 2016

2.6k views

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)$)

commented in Digital Logic Feb 21, 2016

30.9k views

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$

answered in Quantitative Aptitude Feb 21, 2016

2.4k views

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.

commented in CO and Architecture Feb 20, 2016

17.7k views

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.

commented in Theory of Computation Feb 18, 2016

12.4k views

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.

answered in CO and Architecture Feb 15, 2016

19.1k views

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)$.

commented in Algorithms Feb 14, 2016

16.3k views

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.

commented in CO and Architecture Feb 14, 2016

15.0k views

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)$

commented in Algorithms Feb 13, 2016

19.6k views