Log In

Recent activity by Nandkishor3939

4 answers
Consider the set of (column) vectors defined by$X = \left \{x \in R^3 \mid x_1 + x_2 + x_3 = 0, \text{ where } x^T = \left[x_1,x_2,x_3\right]^T\right \}$.Which of the following is TRUE? $\left\{\left[1,-1,0\right]^T,\left[1,0,-1\right]^T\right\}$ is a ... is a linearly independent set, but it does not span $X$ and therefore is not a basis of $X$. $X$ is not a subspace of $R^3$. None of the above
commented Oct 3, 2019 in Linear Algebra 4.7k views
4 answers
How many different non-isomorphic Abelian groups of order $4$ are there? $2$ $3$ $4$ $5$
commented Oct 3, 2019 in Set Theory & Algebra 7.3k views
6 answers
Mala has the colouring book in which each English letter is drawn two times. She wants to paint each of these $52$ prints with one of $k$ colours, such that the colour pairs used to colour any two letters are different. Both prints of a letter can also be coloured with the same colour. What is the minimum value of $k$ that satisfies this requirement? $9$ $8$ $7$ $6$
commented Oct 1, 2019 in Combinatory 5.2k views
1 answer
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)
edited Oct 1, 2019 in Linear Algebra 429 views
1 answer
Token Bucket mechanism is used for congestion control at router. Bucket capacity in 700 Bytes (initially full), token arrival rate is 200 Bytes/sec and maximum output rate is 300 Bytes/sec. The amount of time (in sec) required to transmit 3000 Bytes file is _____.
commented Sep 30, 2019 in Computer Networks 1.3k views
3 answers
Which of the following statements is true for every planar graph on $n$ vertices? The graph is connected The graph is Eulerian The graph has a vertex-cover of size at most $\frac{3n}{4}$ The graph has an independent set of size at least $\frac{n}{3}$
commented Sep 29, 2019 in Graph Theory 4.1k views
3 answers
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ be another predicate such that $\text{equivalent} (a,b)$ ...
commented Sep 28, 2019 in Mathematical Logic 5k views
3 answers
What is the correct translation of the following statement into mathematical logic? “Some real numbers are rational” $\exists x (real(x) \lor rational(x))$ $\forall x (real(x) \to rational(x))$ $\exists x (real(x) \wedge rational(x))$ $\exists x (rational(x) \to real(x))$
commented Sep 28, 2019 in Mathematical Logic 2.4k views
8 answers
Which of the following first order formulae is logically valid? Here $\alpha(x)$ is a first order formula with $x$ as a free variable, and $\beta$ ... $[(\forall x, \alpha(x)) \rightarrow \beta] \rightarrow [\forall x, \alpha(x) \rightarrow \beta]$
commented Sep 28, 2019 in Mathematical Logic 5.5k views
4 answers
What is the size of the smallest MIS (Maximal Independent Set) of a chain of nine nodes? $5$ $4$ $3$ $2$
commented Sep 28, 2019 in DS 5.4k views
3 answers
The following code segment is executed on a processor which allows only register operands in its instructions. Each instruction can have atmost two source operands and one destination operand. Assume that all variables are dead after this code segment. c = a + b; d = c ... place to another while preserving correctness. What is the minimum number of spills to memory in the compiled code? 0 1 2 3
commented Sep 27, 2019 in Compiler Design 10.2k views
9 answers
Let $P$ be a singly linked list. Let $Q$ be the pointer to an intermediate node $x$ in the list. What is the worst-case time complexity of the best-known algorithm to delete the node $x$ from the list ? $O(n)$ $O(\log^2 n)$ $O(\log n)$ $O(1)$
commented Sep 27, 2019 in DS 7k views
3 answers
A priority queue $Q$ is used to implement a stack that stores characters. PUSH (C) is implemented as INSERT $(Q, C, K)$ where $K$ is an appropriate integer key chosen by the implementation. POP is implemented as DELETEMIN$(Q)$. For a sequence of operations, the keys chosen are in non-increasing order non-decreasing order strictly increasing order strictly decreasing order
commented Sep 27, 2019 in DS 6.2k views
1 answer
What is the syllabus for Engineering Mathematics - Numerical methods?
commented Sep 25, 2019 in Mathematical Logic 757 views
8 answers
Let $G = (V, E)$ be a simple undirected graph, and $s$ be a particular vertex in it called the source. For $x \in V$, let $d(x)$ denote the shortest distance in $G$ from $s$ to $x$. A breadth first search (BFS) is performed starting at $s$. Let $T$ ... of $G$ that is not in $T$, then which one of the following CANNOT be the value of $d(u) - d(v)$? $-1$ $0$ $1$ $2$
commented Sep 21, 2019 in Algorithms 6.5k views
6 answers
A multithreaded program $P$ executes with $x$ number of threads and uses $y$ number of locks for ensuring mutual exclusion while operating on shared memory locations. All locks in the program are non-reentrant, i.e., if a thread holds a lock $l$, then it cannot re-acquire lock $l$ without releasing it. If a thread is ... deadlock are: $x = 1, y = 2$ $x = 2, y = 1$ $x = 2, y = 2$ $x = 1, y = 1$
commented Sep 19, 2019 in Operating System 12.7k views
3 answers
Let $u$ and $v$ be two vectors in R2 whose Euclidean norms satisfy $\left \| u \right \| = 2\left \| v \right \|$. What is the value of $\alpha$ such that $w = u + \alpha v$ bisects the angle between $u$ and $v$? $2$ $\frac{1}{2}$ $1$ $\frac{ -1}{2}$
commented Sep 19, 2019 in Linear Algebra 6.3k views
5 answers
Let $c_{1}.....c_{n}$ be scalars, not all zero, such that $\sum_{i=1}^{n}c_{i}a_{i}$ = 0 where $a_{i}$ are column vectors in $R^{n}$. Consider the set of linear equations $Ax = b$ where $A=\left [ a_{1}.....a_{n} \right ]$ ... set of equations has a unique solution at $x=J_{n}$ where $J_{n}$ denotes a $n$-dimensional vector of all 1. no solution infinitely many solutions finitely many solutions
commented Sep 19, 2019 in Linear Algebra 7.7k views
14 answers
Consider a system with a two-level paging scheme in which a regular memory access takes $150$ $nanoseconds$, and servicing a page fault takes $8$ $milliseconds$. An average instruction takes $100$ nanoseconds of CPU time, and two memory accesses. The TLB ... average instruction execution time? $\text{645 nanoseconds}$ $\text{1050 nanoseconds}$ $\text{1215 nanoseconds}$ $\text{1230 nanoseconds}$
commented Sep 4, 2019 in CO and Architecture 26.8k views
1 answer
Does semaphore solution fulfill the condition of bounded wait for more than 2 processes I know we can implement the waiting list in such a way that makes it satisfy bounded wait but what is the standard?
commented Sep 1, 2019 in Operating System 782 views
3 answers
Suppose $Y$ is distributed uniformly in the open interval $(1,6)$. The probability that the polynomial $3x^2 +6xY+3Y+6$ has only real roots is (rounded off to $1$ decimal place) _______
commented Aug 14, 2019 in Probability 5.5k views
0 answers
The string for which the grammar has maximum of two derivation trees is (a) lion tiger lion (c) tiger lion (b) lion tiger (d) None of the above
commented Aug 11, 2019 in Theory of Computation 219 views
5 answers
Consider the following operation along with Enqueue and Dequeue operations on queues, where $k$ is a global parameter. MultiDequeue(Q){ m = k while (Q is not empty) and (m > 0) { Dequeue(Q) m = m – 1 } } What is the worst case time complexity of a sequence of $n$ queue operations on an initially empty queue? $Θ(n)$ $Θ(n + k)$ $Θ(nk)$ $Θ(n^2)$
commented Aug 5, 2019 in DS 10.7k views
3 answers
The minimum size that an array may require to store a binary tree with n nodes $2^{\left \lceil(log_2(n+1)) \right \rceil -1}$ $2n-1$ $2n-n+1$ $n+1$
commented Jul 15, 2019 in DS 1.2k views
0 answers
The minimum size that an array may require to store a binary tree with n nodes (A) 2celi(log2(n+1))-1 (B)2n-1 (C)2n-n+1 (D)n+1 answer given by them is option A. but I think it should be B. Please clear my doubt
commented Jul 15, 2019 in Programming 306 views
0 answers
1 answer
What are the important topics in WIFI : It would be very helpful if some one answered this thank you:)
asked Mar 7, 2019 in Computer Networks 262 views
7 answers
A certain processor uses a fully associative cache of size $16$ kB, The cache block size is $16$ bytes. Assume that the main memory is byte addressable and uses a $32$-bit address. How many bits are required for the Tag and the Index fields respectively in the addresses generated by the processor? $24$ bits and $0$ bits $28$ bits and $4$ bits $24$ bits and $4$ bits $28$ bits and $0$ bits
commented Feb 7, 2019 in CO and Architecture 6.7k views
3 answers
What was the Expectancy in the full binary tree question asked in the exam ? I got 3
commented Feb 5, 2019 in GATE 705 views