Register
Filter

Questions by Kaluti

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...
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 cha...
1 votes
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
1 votes
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
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
1 votes
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
1 votes
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
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 ...
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
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.
1 votes
1 answer
15
theory of computation
how many regular according to me all regular
how many regular according to me all regular
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 ________.
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
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
Page: