menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
User target2017
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
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
Recent Posts
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
IITH CSE interview M Tech RA Winter admission 2021
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
I tried calling IISC Admission Dept, but they...
Mock 2 are live now.
sir ,it's already 17th
It will be live soon.
This Year IISc is not taking students of computer...
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
Questions by target2017
3
votes
2
answers
1
MadeEasy CBT 2017: Databases - Er Diagram
Please explain how they merged.(Modified)
Please explain how they merged.(Modified)
asked
Jan 30, 2017
in
Databases
944
views
made-easy-test-series
cbt-2017
databases
er-diagram
0
votes
0
answers
2
Made Easy FLT1 Circular Queue
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
Doubt: dequeue really deletes the element or just moves the pointer? I'm not getting the answer.
asked
Jan 21, 2017
in
DS
384
views
data-structures
queue
circular-queue
0
votes
1
answer
3
MadeEasy Subject Test: Programming & DS - Trees
I think in last level we can't choose any 4.
I think in last level we can't choose any 4.
asked
Jan 15, 2017
in
DS
197
views
made-easy-test-series
data-structures
avl-tree
8
votes
5
answers
4
Data Structure stack-max
How it is 24? I'm not getting it.
How it is 24? I'm not getting it.
asked
Jan 7, 2017
in
DS
1.6k
views
made-easy-test-series
data-structures
stack
bad-question
2
votes
0
answers
5
Aloha
I have a lot of problems to solve numericals of Aloha. In Test series they are asking such questions which i'm unable to understand. Is there any good material for it? Please provide it or explain some concepts.
I have a lot of problems to solve numericals of Aloha. In Test series they are asking such questions which i'm unable to understand. Is there any good material for it? Please provide it or explain some concepts.
asked
Jan 5, 2017
in
Computer Networks
914
views
computer-networks
slotted-aloha
pure-aloha
0
votes
1
answer
6
No of comparisons
Q.15 An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the no. of comparisons needed? (a) Atleast 2n-C comparisons are needed (b) Atmost 1.5n-2 comparisons are needed (c) Atleast nlog2 n comparisons are needed (d) None of the above
Q.15 An array of n numbers is given, where n is an even number. The maximum as well as the minimum of these n numbers needs to be determined. Which of the following is TRUE about the no. of comparisons needed? (a) Atleast 2n-C comparisons are needed (b) Atmost 1.5n-2 comparisons are needed (c) Atleast nlog2 n comparisons are needed (d) None of the above
asked
Dec 18, 2016
in
Algorithms
483
views
algorithms
sorting
0
votes
0
answers
7
Insertion Sort
asked
Dec 16, 2016
in
Algorithms
793
views
algorithms
sorting
2
votes
2
answers
8
MadeEasy Test Series: Operating System - File System
What does it mean - Maximum Possible File Size: ? In solution they have taken only triple indirect block addresses. Why?
What does it mean - Maximum Possible File Size: ? In solution they have taken only triple indirect block addresses. Why?
asked
Dec 13, 2016
in
Operating System
485
views
made-easy-test-series
operating-system
file-system
1
vote
0
answers
9
fork()
Please explain:
Please explain:
asked
Dec 13, 2016
in
Operating System
716
views
fork
operating-system
3
votes
1
answer
10
Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.
asked
Dec 12, 2016
in
Others
361
views
difficult
gate-2006
2
votes
1
answer
11
Doubt in Circular-Look and Circular-Scan
In C-Look or in C-Scan when we take the circular move (from last to first), is this movement counted or not? After searching I found that: It should included: http://www2.cs.uregina.ca/~hamilton/courses/330/notes/io/node8.html ... http://www.cs.iit.edu/~cs561/cs450/disksched/disksched.html I'm really confused. Please provide the reference of your solution.
In C-Look or in C-Scan when we take the circular move (from last to first), is this movement counted or not? After searching I found that: It should included: http://www2.cs.uregina.ca/~hamilton/courses/330/notes/io/node8.html It should not included: http://www.cs.iit.edu/~cs561/cs450/disksched/disksched.html I'm really confused. Please provide the reference of your solution.
asked
Dec 9, 2016
in
Operating System
653
views
operating-system
disk-scheduling
0
votes
1
answer
12
OS Process Scheduling 2
asked
Nov 24, 2016
in
Operating System
226
views
operating-system
process-scheduling
0
votes
1
answer
13
OS Process Scheduling
asked
Nov 24, 2016
in
Operating System
300
views
operating-system
process-scheduling
os
7
votes
2
answers
14
OS Synchronization
Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } 5 What is the minimum and maximum possible value of count after the completion of the program? (a) 1, 40 (b) 2, 40 (c) 3, 40 (d) 4, 40
Consider the following program: Const int n= 10 int Count= 0 Void A( ) { int i; for(i= 1 to n) Count= Count + 1; } Main ( ) { Par begin A( ); A( ); A( ); A( ); Par end } 5 What is the minimum and maximum possible value of count after the completion of the program? (a) 1, 40 (b) 2, 40 (c) 3, 40 (d) 4, 40
asked
Nov 23, 2016
in
Operating System
2.7k
views
os
process-synchronization
operating-system
0
votes
1
answer
15
P NP completeness
Problems related to P-NP completeness are covered in syllabus or not (either in TOC or ALGO)?
Problems related to P-NP completeness are covered in syllabus or not (either in TOC or ALGO)?
asked
Nov 20, 2016
in
Theory of Computation
809
views
0
votes
0
answers
16
Which of the following language is decidable?
Please explain option A.
Please explain option A.
asked
Nov 19, 2016
in
Theory of Computation
127
views
1
vote
0
answers
17
Finite Automata
If in the Exam they ask about minimum states in FA. Does it mean NFA or DFA?
If in the Exam they ask about minimum states in FA. Does it mean NFA or DFA?
asked
Nov 18, 2016
in
Theory of Computation
98
views
...