# Questions by Kaluti

1
. Given a vector $x ∈ R_{n}$ , we define $||xi||=1$ , $P_{n}(i)=1....n$ $|x_{i} | = |x_{1}| + |x_{2}| + |x_{3}| +.........|x_{n}|$and$P_{n}( i) =1..........n$ $\sqrt{|x_{1}|^{2}+|x_{2}|^{2}+|x_{3}|^{2}.......}$. ... in x. The indices of all true (and no false) statements are (i) . (For example, if you think statements (a) and (b) are true and the rest false, write down (a),(b)' as your answer).
2
Let $S(n)$ be the sum of the digits of positive number $n$ written in decimal notation. For example, $S(725) = = 7 + 2 + 5 = 14$. Then $X$ from $n =0$ $\displaystyle{\sum_{n=0}^{999}S(n)}$
3
Let |U| = $m^{2}$and consider hashing with chaining. For any hash function h : U → {1, 2, . . . , m − 1}, there exists a sequence of m insertions that leads to a chain of length m. Explain
1 vote
4
give an o(n) algorithm to check whether the given binary tree is bst or not
1 vote
5
from where we can practice different variety of programming questions related to output except previous year
6
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
1 vote
7
Give an algorithm for finding the height or depth of the tree
1 vote
8
Give an algorithm for finding the diameter of the binary tree
9
Three men have 4 coats, 5 waist coats, and 6 caps. In how many ways can they wear them? Three men have 4 coats, 5 waist coats, and 6 caps. In how many ways can they wear any type of them?
10
if $A^{3} = 0$ can we conclude that $A^{2} = A$ that will be valid for zero matrix
11
Assume λ=−1 is an eigenvalue of a 3x3 matrix A and x=[2 3 4]T is an eigenvector corresponding to this λ Find A^101x.
12
Let Σ = {a, b}. Given words u, v ∈ Σ ∗ , we say that v extends u if v is of the form xuy for some x, y ∈ Σ ∗ . Given a fixed word u, we are interested in identifying whether a finite state automaton accepts some word that extends u. Describe an algorithm that takes as ... word u ∈ Σ ∗ and reports Yes if some word in the language of A extends u and No if no word in the language of A extends u.
13
Consider a user level threading library that multiplexes $N > 1$ user level threads over $M \geq 1$ kernel threads. The library manages the concurrent scheduling of the multiple user threads that map to the same kernel thread internally, and the programmer using the ... threads can run in parallel on a multi-core machine. (D) User level threads should always use mutexes to protect shared data.
14
Consider a misbehaving TCP receiver. The receiver modifies its TCP such that upon receiving a data segment containing $N$ bytes, the receiver divides the resulting acknowledgment into $M$, where $M\leq N$, separate acknowledgments each covering one of distinct pieces of the received data ... $6004$. (D) Response will be packets with byte sequence numbers $1501, 3001, 4501$ and $6001$.
1 vote
15
how many regular according to me all regular
16
In a paging system, it page size is 2048 bytes. A process might need 15 frames. What is the maximum possible internal fragmentation size ________.
17
If a circular wait condition has arised in a system where multiple process are competing for same resources then this will definitely leads to deadlock. is this true
Suppose $10$ processes $P_1$ to $P_{10}$ share $7$ identical resource units which can be reserved and release $1$ at a time the maximum resource requirement of a processs $P_i$ is $S_P$ where $S_P$ is greater then $0$. The maximum value of $S_i\left(\displaystyle{\sum_{i=1}^{10}S_P}\right)$ that ensures deadlock does not occurs is ________ .​​​​​​​