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
Questions by Hirak
2
votes
0
answers
31
Vani Question Bank:Operating System
259
views
asked
May 9, 2019
Operating System
operating-system
page-replacement
page-fault
paging
+
–
3
votes
2
answers
32
Self Doubt :Bit Stuffing
End delimeter is → 0111 data to be sent 0111111111. What is the data we should send to the reciever?
End delimeter is → 0111data to be sent 0111111111.What is the data we should send to the reciever?
2.0k
views
asked
May 8, 2019
Computer Networks
computer-networks
bit-stuffing
+
–
0
votes
1
answer
33
VANI QB OPERATING SYSTEM Q45
The output is ____________________.
The output is ____________________.
379
views
asked
May 5, 2019
Operating System
operating-system
+
–
0
votes
0
answers
34
VANI QB OPERATING SYSTEM
The output is ____________________.
The output is ____________________.
148
views
asked
May 5, 2019
1
votes
0
answers
35
Made Easy Databases
Consider the following schedules with data item x The number of serial schedules which are view equal to schedules but not conflict equal is ___________.
Consider the following schedules with data item xThe number of serial schedules which are view equal to schedules but not conflict equal is ___________.
699
views
asked
May 5, 2019
Databases
view-serializable
conflict-serializable
serializability
+
–
0
votes
2
answers
36
MADE EASY FREE TEST Q47
Find the total number of tables required. Ans given was 4, bit how can it be 4? According to me, E1 and E2 will require 2 tables at begining, then for E3 and E1 we need another table, then for E2 and E3 we need another and for E3 and E2’s many to many relation i need another one. So total =5. But ans given was 4.. explain pls.
Find the total number of tables required.Ans given was 4, bit how can it be 4? According to me, E1 and E2 will require 2 tables at begining, then for E3 and E1 we need an...
356
views
asked
May 4, 2019
Databases
databases
rdbms
+
–
1
votes
1
answer
37
MADE EASY FREE TEST
a)Mutual exclusion, progress, bounded wait all are satisfied b)Mutual exclusion, progress satisfied but bounded wait not satisfied c)Mutual exclusion satisfied progress, bounded wait not satisfied
a)Mutual exclusion, progress, bounded wait all are satisfiedb)Mutual exclusion, progress satisfied but bounded wait not satisfiedc)Mutual exclusion satisfied progress, bo...
932
views
asked
May 4, 2019
Operating System
semaphore
+
–
0
votes
0
answers
38
CSIR UGC NET
Let $A$ be a $3 \times 3$ real matrix. Suppose 1 and -1 are two of the three Eigen values of $A$ and 18 is one of the Eigen values of $A^2+3 A$. Then Both $A$ and $A^2+3 A$ are invertible $A^2+3 A$ is invertible but $A$ is not invertible $A$ is invertible but $A^2+3 A$ is not invertible Both $\mathrm{A}$ and $A^2+3 A$ are not invertible.
Let $A$ be a $3 \times 3$ real matrix. Suppose 1 and -1 are two of the three Eigen values of $A$ and 18 is one of the Eigen values of $A^2+3 A$. ThenBoth $A$ and $A^2+3 A...
575
views
asked
Apr 28, 2019
Linear Algebra
linear-algebra
eigen-value
matrix
+
–
0
votes
0
answers
39
Made Easy Engineering Maths book
The ans given is b, but i am not able to understande why. According to me the largest eigen value is 2, and therefore none of the option matches..!
The ans given is b, but i am not able to understande why. According to me the largest eigen value is 2, and therefore none of the option matches..!
897
views
asked
Apr 27, 2019
4
votes
1
answer
40
Vani Institute Question Bank Pg-231 chapter 6
The Eigen values of $A=\begin{bmatrix} a& 1& 0\\1 &a &1 \\0 &1 &a \end{bmatrix}$ are______ $a,a,a$ $0,a,2a$ $-a,2a,2a$ $a,a+\sqrt{2},a-\sqrt{2}$
The Eigen values of $A=\begin{bmatrix} a& 1& 0\\1 &a &1 \\0 &1 &a \end{bmatrix}$ are______$a,a,a$$0,a,2a$$-a,2a,2a$$a,a+\sqrt{2},a-\sqrt{2}$
1.3k
views
asked
Apr 25, 2019
Linear Algebra
engineering-mathematics
linear-algebra
eigen-value
+
–
0
votes
1
answer
41
Vani Question Bank
Find the total number of comparisons if merge sort is used. Explain with proper steps. 2, 5, 8, 4, 1, 7, 6, 3 Total no of comparison.
Find the total number of comparisons if merge sort is used. Explain with proper steps.2, 5, 8, 4, 1, 7, 6, 3Total no of comparison.
959
views
asked
Apr 7, 2019
Algorithms
algorithms
merge-sort
normal
+
–
0
votes
1
answer
42
Vani institute question bank
5. For n ≥ 0, Ln = {a^i b^k | i ≥ n, 0 < k < i} (a) Ln is regular, independent of value of n (b) Ln is not regular, independent of value of n (c) Ln is regular only for small value of n (d) None of above
5. For n ≥ 0, Ln = {a^i b^k | i ≥ n, 0 < k < i} (a) Ln is regular, independent of value of n(b) Ln is not regular, independent of value of n(c) Ln is regular only ...
542
views
asked
Apr 7, 2019
Theory of Computation
theory-of-computation
pushdown-automata
finite-automata
+
–
0
votes
0
answers
43
Doubt While self study
Can Layer 3 firewall block ports?
Can Layer 3 firewall block ports?
160
views
asked
Apr 5, 2019
Computer Networks
computer-networks
+
–
Page:
« prev
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register