The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by Kaluti
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kaluti
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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).
asked
May 27, 2018
in
Set Theory & Algebra

42
views
vector
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)}$
asked
May 27, 2018
in
Mathematical Logic

219
views
discretemathematics
engineeringmathematics
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
asked
Apr 19, 2018
in
Algorithms

35
views
+1
vote
1
answer
4
self doubt
give an o(n) algorithm to check whether the given binary tree is bst or not
asked
Mar 31, 2018
in
Algorithms

102
views
+1
vote
1
answer
5
query
from where we can practice different variety of programming questions related to output except previous year
asked
Mar 30, 2018
in
Programming

56
views
0
votes
1
answer
6
self doubt
given an array which contains the preorder traversal of full $kary$ tree. Give an algorithm for constructing the full $kary$ tree
asked
Mar 29, 2018
in
Algorithms

45
views
datastructures
algorithms
+1
vote
1
answer
7
self doubt
Give an algorithm for finding the height or depth of the tree
asked
Mar 28, 2018
in
Algorithms

45
views
+1
vote
0
answers
8
self doubt
Give an algorithm for finding the diameter of the binary tree
asked
Mar 25, 2018
in
Algorithms

50
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?
asked
Mar 18, 2018
in
Combinatory

48
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
asked
Mar 4, 2018
in
Linear Algebra

73
views
matrices
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.
asked
Mar 4, 2018
in
Linear Algebra

45
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.
asked
Mar 1, 2018
in
Theory of Computation

26
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 multicore machine. (D) User level threads should always use mutexes to protect shared data.
asked
Feb 3, 2018
in
Theory of Computation

71
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$.
asked
Feb 3, 2018
in
Computer Networks

83
views
+1
vote
1
answer
15
theory of computation
how many regular according to me all regular
asked
Feb 2, 2018
in
Theory of Computation

69
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 ________.
asked
Feb 2, 2018
in
Operating System

132
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
asked
Feb 2, 2018
in
Operating System

77
views
0
votes
1
answer
18
operating system
Context switching time in FCFS scheduling algorithm have less than equal to RoundRobin. explain this statement
asked
Feb 2, 2018
in
Operating System

231
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.
asked
Feb 2, 2018
in
Operating System

129
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 ________ .
asked
Feb 2, 2018
in
Operating System

99
views
operatingsystem
0
votes
2
answers
21
discrete maths
How many ordered pair of integers (a, b) are needed to guarantee that there are two ordered pairs (a1, b1) and (a2, b1) such that a1 mod 5 = a2 mod 5 and b1 mod 5 = b2 mod 5? should not answer be 25 here
asked
Feb 1, 2018
in
Graph Theory

152
views
0
votes
1
answer
22
discrete maths
What is the coefficient of x^(12) in the power series of
asked
Feb 1, 2018
in
Graph Theory

114
views
0
votes
1
answer
23
discrete maths
Consider the following statements: S1: Every cyclic group is Abelian group. S2: Every Abelian group is cyclic group. S3: Cyclic group of order 10 have 4 generators. Which of the following is true?
asked
Feb 1, 2018
in
Graph Theory

87
views
0
votes
0
answers
24
discrete mathmatics
Consider two sets A and B such that: AUB $\subseteq$ A $\cap$ B Then, which of the following is incorrect? A A = { } and B={} ALWAYS B A = B C A=B D none of these
asked
Jan 31, 2018
in
Mathematical Logic

40
views
0
votes
0
answers
25
computer organization
A DMA is transferring characters to processor from a device transmitting at 8000 bits per sec. Assume DMA using cycle stealing mode. If processor needs access to main memory once every micro second. The percentage processor be slow down due to DMA activity is ______ (in %).
asked
Jan 31, 2018
in
CO and Architecture

64
views
0
votes
1
answer
26
computer organization
A CPU has 24 bit instructions and we have to calculate the sum of n number by using below code: The value of X, if target address of branch is loop, when instruction is uses PC relative addressing mode is ________. (Assume memory is byte addressable)
asked
Jan 31, 2018
in
CO and Architecture

211
views
+2
votes
2
answers
27
computer organization
suppose that in 1000 memory reference there are 40 misses in the first level cache and 20 misses in the second level cache. Assume miss penalty from the L2 cache to memory is 100 cycles the hit time of the L2 cache is 10 clock cycles.the hit time of the L1 cache is 1 clock cycle. what is average memory access time?
asked
Jan 31, 2018
in
CO and Architecture

70
views
0
votes
0
answers
28
computer organization
A computer has a cache, main memory and a disk used for virtual memory. If reference word is in cache $15\hspace{0.1cm} ns$ are required to access it. If it is in main memory but not in cache, $50\hspace{0.1cm} nsec$ are needed to load it into cache and ... on this system will be____________. (in μsec) is this correct equation .$90*15 + .10*(.50*(50+15)+.50*(10000000+50))$
asked
Jan 30, 2018
in
CO and Architecture

38
views
coandarchitecture
0
votes
0
answers
29
computer organization
Consider the following statements : S1 : Delayed control transfer involve starting the execution of the instruction after a branch or control instruction regardless of whether the branch is taken. S2 : A way to implement branch prediction is to store the ... hazards can be avoided completely if at least N' registers are available. Which of the above statements are true ?
asked
Jan 30, 2018
in
CO and Architecture

39
views
0
votes
0
answers
30
computer organization
Assume that we have a two dimensional array of 60 × 60. Each element is of 4 bytes and array is stored in row major order. RAM is 2 MB and cache is 8 KB with each block of 16 bytes. In case of direct mapped cache, the number of cache misses are _______ (Assume that cache is empty initially). i am getting answer as 1290 however answer given as 1288
asked
Jan 30, 2018
in
CO and Architecture

28
views
Page:
1
2
3
4
5
6
next »
50,737
questions
57,324
answers
198,408
comments
105,173
users