Facebook Login
Login
Register
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User Somoshree Datta 5
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Recent Posts
Some Good courses on System Development
My GATE preparation experience (GATE CS 2020 AIR-13)
GATE CSE: IIST Admissions
GATE CSE: IIITH Admissions
Video Solution for Previous Year GATE Questions
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(8.4k)
Digital Logic
(2.9k)
Programming and DS
(5k)
Algorithms
(4.4k)
Theory of Computation
(6.2k)
Compiler Design
(2.2k)
Operating System
(4.6k)
Databases
(4.2k)
CO and Architecture
(3.4k)
Computer Networks
(4.2k)
Non GATE
(1.6k)
Others
(2k)
Admissions
(595)
Exam Queries
(573)
Tier 1 Placement Questions
(23)
Job Queries
(72)
Projects
(18)
Follow @csegate
Recent Blog Comments
50% as in 120 or the 50% of total number of...
congrats!. Best of luck for your next endeavour.
What is the average package offered to mtech cse...
congrats very much
Congratulations ! Indeed Previous year questions...
Answers by Somoshree Datta 5
+8
votes
1
681
views
FAQ-4
What is the ideal expected month of completion of preparation and how to revise after completion of syllabus ?
answered
Apr 29, 2019
in
GATE
681
views
faq
+2
votes
2
125
views
ace test series
please provide the detailed solution
answered
Jan 30, 2019
in
Computer Networks
125
views
0
votes
3
75
views
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
75
views
+1
vote
4
122
views
NIELIT 2018-47
______ sorting algorithms has the lowest worst-case complexity. Selection Sort Bubble Sort Merge Sort Quick Sort
answered
Jan 25, 2019
in
Others
122
views
nielit-2018
+1
vote
5
103
views
NIELIT 2018-50
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
103
views
nielit-2018
+4
votes
6
278
views
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
278
views
engineering-mathematics
linear-algebra
matrices
rank-of-matrix
+1
vote
7
668
views
UGCNET-DEC2018-II-3
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 3, 2019
in
Others
668
views
ugcnetdec2018ii
+1
vote
8
151
views
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 18, 2018
in
DS
151
views
data-structures
linked-lists
+3
votes
9
806
views
Matrix Multiplications
Let $A1, A2, A3, A4, A5$ be five matrices of dimensions $2\times3, 3\times5, 5\times2, 2\times4, 4\times3$ 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
806
views
matrix-chain-ordering
dynamic-programming
algorithms
+1
vote
10
84
views
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
84
views
+1
vote
11
282
views
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
282
views
regular-expressions
theory-of-computation
finite-automata
regular-languages
+3
votes
12
165
views
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
165
views
made-easy-test-series
theory-of-computation
finite-automata
+2
votes
13
227
views
doubt in databases
answered
Sep 27, 2018
in
Databases
227
views
databases
database-normalization
+2
votes
14
354
views
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
354
views
dependency-preserving
databases
lossless-decomposition
database-normalization
+4
votes
15
106
views
#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 round-robin scheduler when the time quantum is 10ms.
answered
Sep 26, 2018
in
Operating System
106
views
+2
votes
16
186
views
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 21, 2018
in
Databases
186
views
bplustrees
0
votes
17
35
views
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 19, 2018
in
Databases
35
views
+4
votes
18
113
views
made easy test series
Can someone Explain these statements?
answered
Sep 19, 2018
in
Theory of Computation
113
views
0
votes
19
120
views
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
120
views
cache-memory
co-and-architecture
+1
vote
20
95
views
Self Doubt
Degree of multiprogramming is controlled by Long-term scheduler? Why? It just moves jobs from Secondary Memory to MM?
answered
Sep 15, 2018
in
Operating System
95
views
operating-system
+2
votes
21
207
views
ME TEST SERIES
HOW TO SOLVE THOSE TYPE OF QUESTION?
answered
Sep 14, 2018
in
Databases
207
views
transaction-and-concurrency
+2
votes
22
183
views
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
183
views
+2
votes
23
83
views
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
83
views
...