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
Answers by Somoshree Datta 5
User Somoshree Datta 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Somoshree Datta 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
+8
votes
1
FAQ4
What is the ideal expected month of completion of preparation and how to revise after completion of syllabus ?
answered
Apr 28, 2019
in
GATE

600
views
faq
+2
votes
2
ace test series
please provide the detailed solution
answered
Jan 30, 2019
in
Computer Networks

107
views
0
votes
3
ace test series Operating System
consider a file system, using a single level directory structure. The Block size is 4 KB & Disk address is 32 bits. The directory is housed in 4 blocks of Disk and holds 32 bit information in its entry. The maximum number of files supported by this file system is ? Ans given is 4096
answered
Jan 25, 2019
in
Operating System

56
views
0
votes
4
NIELIT 201847
______ sorting algorithms has the lowest worstcase complexity. Selection Sort Bubble Sort Merge Sort Quick Sort
answered
Jan 25, 2019
in
Others

38
views
nielit2018
+1
vote
5
NIELIT 201850
The process executes the following code and after execution ______ number of child process get created fork(); fork(); fork(); fork(); $4$ $1$ $15$ $16$
answered
Jan 25, 2019
in
Others

47
views
nielit2018
+3
votes
6
Nullity of matrix
Nullity of a matrix = Total number columns – Rank of that matrix But how to calculate value of x when nullity is already given(1 in this case)
answered
Jan 24, 2019
in
Linear Algebra

188
views
engineeringmathematics
linearalgebra
matrices
rankofmatrix
+1
vote
7
UGCNETDEC2018II3
A box contains six red balls and four green balls. Four balls are selected at random from the box. What is the probability that two of the selected balls will be red and two will be in green? $\frac{1}{14}$ $\frac{3}{7}$ $\frac{1}{35}$ $\frac{1}{9}$
answered
Jan 2, 2019
in
Others

537
views
ugcnetdec2018ii
+1
vote
8
Linked list insertion
In a linked list with $n$ nodes, the time taken to insert an element after an element pointed by some pointer is: $(A) O(1)$ $(B) O(logn)$ $(C) O(n)$ $(D) O(nlogn)$
answered
Oct 17, 2018
in
DS

124
views
datastructures
linkedlists
+3
votes
9
Matrix multiplications
Let A1, A2, A3, A4, A5 be five matrices of dimensions 2×3, 3×5, 5×2, 2×4, 4×3 respectively. The minimum number of scalar multiplications required to find the product A1 A2 A3 A4 A5 using the basic matrix multiplication method is_____
answered
Oct 9, 2018
in
Algorithms

743
views
matrixchainordering
dynamicprogramming
algorithms
+1
vote
10
Deadlock free problem
How the lock variable software synchronization mechanism guarantee that deadlock can never happen in lock variable??
answered
Sep 28, 2018
in
Operating System

57
views
+1
vote
11
TOC (Regular expression)
Given two Regular expressions are equal or not ? 1) (1+01*0)* 2) 1*(01*0)* 1* Give proper explanation also.
answered
Sep 27, 2018
in
Theory of Computation

209
views
regularexpressions
theoryofcomputation
finiteautomata
regularlanguages
+2
votes
12
MadeEasy Test Series: Theory Of Computation  Finite Automata
The difference between the number of states in minimal DFA and minimal NFA, which accepts all strings end with 3rd bit as b is _____. [ Assume $\sum$ = {a,b} ]
answered
Sep 27, 2018
in
Theory of Computation

142
views
madeeasytestseries
theoryofcomputation
finiteautomata
+2
votes
13
doubt in databases
answered
Sep 27, 2018
in
Databases

190
views
databases
databasenormalization
0
votes
14
Lossless Decomposition and Dependency Preservation
Consider R(A,B,C,D,E)with the FD Set F(A>B, A>C, DE>C, DE>B, C>D) Consider this decomposition : R1(A,B,C), R2(B,C,D,E) and R3(A,E) Then, the decompositions is Lossless Decomposition Dependency Preserving Which of the ... 1 is TRUE but 2 is FALSE B) 1 is FALSE but 2 is TRUE C) Both 1 and 2 are TRUE D) Both 1 and 2 are FALSE
answered
Sep 27, 2018
in
Databases

245
views
dependencypreserving
databases
losslessdecomposition
databasenormalization
+4
votes
15
#self doubt
Consider a CPU running 10 i/o bound task and 1 CPU bound task. Assume that i/o bound task issue an i/o operation once for every millisecond of CPU computing and that each i/o operation takes 10 ms to complete. Also, assume that context switching overhead ... all processes are lng running tasks. What is the utilization (in %) for a roundrobin scheduler when the time quantum is 10ms.
answered
Sep 26, 2018
in
Operating System

94
views
+2
votes
16
Test Series
Consider a block of a size such that it can hold: • either 5 records of a relation R, or • be used as a B+ tree internal node with degree 11, or • B+ tree leaf node with degree 10. If R has 1000 records, then the smallest number of blocks that could be used to store R and a sparse B+ tree index on key of R is ________.
answered
Sep 20, 2018
in
Databases

147
views
bplustrees
0
votes
17
doubt on index
if p:order of the internal of b+ tree which represents the maximum number of child pointer that the internal node can have then the minimum number of keys possible in the internal node is (ceil(p/2)1) doubt: if q:order of the leaf node in the b+ ... maximum number of (key,value) pointer pairs present in the leaf node then what is the minimum number of keys possible in the leaf node?
answered
Sep 18, 2018
in
Databases

29
views
+4
votes
18
made easy test series
Can someone Explain these statements?
answered
Sep 18, 2018
in
Theory of Computation

102
views
0
votes
19
Cache
What happens on write miss in a write back cache? First write in main memory then bring the block to cache (dirty bit = 0) or First bring the block to cache then write it (dirty bit = 1).
answered
Sep 15, 2018
in
CO and Architecture

96
views
cachememory
coandarchitecture
+1
vote
20
Self Doubt
Degree of multiprogramming is controlled by Longterm scheduler? Why? It just moves jobs from Secondary Memory to MM?
answered
Sep 15, 2018
in
Operating System

60
views
operatingsystem
+1
vote
21
ME TEST SERIES
HOW TO SOLVE THOSE TYPE OF QUESTION?
answered
Sep 14, 2018
in
Databases

165
views
transactionandconcurrency
+2
votes
22
file index
a. a dense index on R.B b. a sparse index on R.B c. a dense index on S.B d. a sparse index on S.B
answered
Sep 14, 2018
in
Databases

167
views
+2
votes
23
plz someone decompose it in BCNF
$R(ABCD)$ Functional depedndency : { $AB \rightarrow CD , D\rightarrow A$ } AB and DB are candidate key
answered
Jan 11, 2018
in
Databases

75
views
50,741
questions
57,244
answers
198,020
comments
104,614
users