menu
search
Log In
Quick search syntax
tags tag:apple
author user:martin
title title:apple
content content:apple
exclude -tag:apple
force match +apple
views views:100
score score:10
answers answers:2
is accepted isaccepted:true
is closed isclosed:true

Subjects

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Questions by Kaluti

0 votes
0 answers
1
selfdoubt
. 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$ ... . 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).
. 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).
asked May 27, 2018 in Set Theory & Algebra 64 views
0 votes
2 answers
2
self doubt
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)}$
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)}$
asked May 27, 2018 in Mathematical Logic 558 views
0 votes
1 answer
3
Self doubt
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
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
asked Apr 19, 2018 in Algorithms 52 views
1 vote
1 answer
4
self doubt
give an o(n) algorithm to check whether the given binary tree is bst or not
give an o(n) algorithm to check whether the given binary tree is bst or not
asked Mar 31, 2018 in Algorithms 159 views
1 vote
1 answer
5
query
from where we can practice different variety of programming questions related to output except previous year
from where we can practice different variety of programming questions related to output except previous year
asked Mar 30, 2018 in Programming 92 views
0 votes
2 answers
6
self doubt
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
given an array which contains the preorder traversal of full $k-ary$ tree. Give an algorithm for constructing the full $k-ary$ tree
asked Mar 29, 2018 in Algorithms 70 views
1 vote
1 answer
7
self doubt
Give an algorithm for finding the height or depth of the tree
Give an algorithm for finding the height or depth of the tree
asked Mar 28, 2018 in Algorithms 60 views
1 vote
0 answers
8
self doubt
Give an algorithm for finding the diameter of the binary tree
Give an algorithm for finding the diameter of the binary tree
asked Mar 25, 2018 in Algorithms 66 views
0 votes
0 answers
9
self doubt
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?
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?
asked Mar 18, 2018 in Combinatory 72 views
0 votes
1 answer
10
self doubt
if $A^{3} = 0$ can we conclude that $A^{2} = A$ that will be valid for zero matrix
if $A^{3} = 0$ can we conclude that $A^{2} = A$ that will be valid for zero matrix
asked Mar 4, 2018 in Linear Algebra 97 views
0 votes
0 answers
11
self doubt
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.
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.
asked Mar 4, 2018 in Linear Algebra 57 views
0 votes
0 answers
12
cmi2017b
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 ... 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.
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.
asked Mar 1, 2018 in Theory of Computation 33 views
0 votes
1 answer
13
operating system
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 ... can run in parallel on a multi-core machine. (D) User level threads should always use mutexes to protect shared data.
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.
asked Feb 3, 2018 in Theory of Computation 110 views
0 votes
0 answers
14
computer network
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 ... $6004$. (D) Response will be packets with byte sequence numbers $1501, 3001, 4501$ and $6001$.
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$.
asked Feb 3, 2018 in Computer Networks 117 views
1 vote
1 answer
15
theory of computation
how many regular according to me all regular
how many regular according to me all regular
asked Feb 2, 2018 in Theory of Computation 84 views
0 votes
0 answers
16
operating system
In a paging system, it page size is 2048 bytes. A process might need 15 frames. What is the maximum possible internal fragmentation size ________.
In a paging system, it page size is 2048 bytes. A process might need 15 frames. What is the maximum possible internal fragmentation size ________.
asked Feb 2, 2018 in Operating System 525 views
0 votes
1 answer
17
operating System
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
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
asked Feb 2, 2018 in Operating System 105 views
0 votes
1 answer
18
operating system
Context switching time in FCFS scheduling algorithm have less than equal to Round-Robin. explain this statement
Context switching time in FCFS scheduling algorithm have less than equal to Round-Robin. explain this statement
asked Feb 2, 2018 in Operating System 508 views
0 votes
0 answers
19
operating system
Consider the following proposed solution to dining Philosopher's problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. The code will still work fine. Removing (iii) ... work fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.
Consider the following proposed solution to dining Philosopher's problem to avoid deadlock. Consider the binary semaphore lock is initialized to 1. Which of the following is correct? Removing (i) and (ii) will not affect the code. The code will still work fine. Removing (iii) and (iv) ... still work fine. All (i), (ii), (iii) and (iv) are necessary. Removal of any of them will affect the code.
asked Feb 2, 2018 in Operating System 263 views
0 votes
1 answer
20
operating system
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 ________ .​​​​​​​
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 ________ .​​​​​​​
asked Feb 2, 2018 in Operating System 123 views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...