Dark Mode

Questions by target2017

4 votes

2 answers

1

MadeEasy CBT 2017: Databases - Er Diagram
Please explain how they merged.(Modified)

asked in Databases Jan 30, 2017

2.1k views

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.

asked in DS Jan 21, 2017

967 views

9 votes

5 answers

3

Data Structure stack-max
How it is 24? I'm not getting it.

asked in DS Jan 7, 2017

3.1k views

2 votes

0 answers

4

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.

asked in Computer Networks Jan 5, 2017

1.3k views

0 votes

0 answers

5

asked in Algorithms Dec 16, 2016

1.2k views

3 votes

1 answer

6

Gate 2006 Questions
Are Gate 2006 questions really tough? I'm hardly able to solve few questions. How should I approach such questions.

asked in Others Dec 12, 2016

963 views

2 votes

1 answer

7

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. ... http://www.cs.iit.edu/~cs561/cs450/disksched/disksched.html I'm really confused. Please provide the reference of your solution.

asked in Operating System Dec 9, 2016

1.1k views

0 votes

1 answer

8

OS Process Scheduling 2

asked in Operating System Nov 24, 2016

406 views

0 votes

1 answer

9

OS Process Scheduling

asked in Operating System Nov 24, 2016

523 views

7 votes

2 answers

10

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

asked in Operating System Nov 23, 2016

4.3k views

0 votes

1 answer

11

P NP completeness
Problems related to P-NP completeness are covered in syllabus or not (either in TOC or ALGO)?

asked in Theory of Computation Nov 20, 2016

1.6k views

0 votes

0 answers

12

Which of the following language is decidable?
Please explain option A.

asked in Theory of Computation Nov 19, 2016

398 views

1 vote

0 answers

13

Finite Automata
If in the Exam they ask about minimum states in FA. Does it mean NFA or DFA?

asked in Theory of Computation Nov 18, 2016

273 views