Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
Profile
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
Answers by Sanandan
0
votes
121
NIELIT 2017 July Scientist B (CS) - Section B: 25
Which access method is used for obtaining a record from cassette tape? Direct Sequential Random Parallel
Which access method is used for obtaining a record from cassette tape?DirectSequentialRandom Parallel
967
views
answered
Sep 3, 2020
Operating System
nielit2017july-scientistb-cs
operating-system
disk
+
–
0
votes
122
NIELIT 2016 DEC Scientist B (CS) - Section B: 50
Where does the swap reside? RAM ROM DISK On-chip cache
Where does the swap reside?RAMROMDISKOn-chip cache
876
views
answered
Sep 3, 2020
CO and Architecture
nielit2016dec-scientistb-cs
co-and-architecture
disk
+
–
0
votes
123
NIELIT 2016 MAR Scientist B - Section C: 8
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases. decreases. remains the same. either remains constant or decreases.
When we move from the outermost track to the innermost track in a magnetic disk, then density(bits per linear inch) increases.decreases.remains the same.either remains co...
1.6k
views
answered
Sep 3, 2020
Operating System
nielit2016mar-scientistb
operating-system
disk
+
–
0
votes
124
UGC NET CSE | January 2017 | Part 3 | Question: 50
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cylinder $23$ and moving in the direction of decreasing number of ... in the disk is $150$. The disk head movement using SCAN -scheduling algorithm is: $172$ $173$ $227$ $228$
Consider a disk queue with I/O requests on the following cylinders in their arriving order: $6,10,12,54,97,73,128,15,44,110,34,45$. The disk head is assumed to be at cyli...
4.8k
views
answered
Sep 1, 2020
Operating System
ugcnetcse-jan2017-paper3
operating-system
disk-scheduling
+
–
0
votes
125
Michael Sipser Edition 3 Exercise 4 Question 26 (Page No. 212)
Let $PAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some palindrome}\}$. Show that $PAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpful here.)
Let $PAL_{DFA} = \{ \langle M \rangle \mid \text{ M is a DFA that accepts some palindrome}\}$. Show that $PAL_{DFA}$ is decidable. (Hint: Theorems about $CFLs$ are helpfu...
320
views
answered
Sep 1, 2020
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
decidability
proof
+
–
0
votes
126
NIELIT 2016 DEC Scientist B (CS) - Section B: 1
Palindromes can't be recognized by any Finite State Automata because: FSA cannot remember arbitrarily large amount of information. FSA cannot deterministically fix the midpoint. Even if the mid-Point is known an FSA cannot find whether the second half of the string matches the first half. All of the above.
Palindromes can't be recognized by any Finite State Automata because:FSA cannot remember arbitrarily large amount of information.FSA cannot deterministically fix the midp...
12.2k
views
answered
Sep 1, 2020
Theory of Computation
nielit2016dec-scientistb-cs
theory-of-computation
finite-automata
+
–
1
votes
127
NIELIT 2017 DEC Scientific Assistant A - Section B: 60
Finite automata requires minimum ____________ number of stacks. $1$ $0$ $2$ None of the options
Finite automata requires minimum ____________ number of stacks.$1$$0$$2$None of the options
3.7k
views
answered
Sep 1, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
0
votes
128
NIELIT 2017 DEC Scientific Assistant A - Section B: 5
Concatenation Operation refers to which of the following set operations : Union Dot Kleene None of the options
Concatenation Operation refers to which of the following set operations : UnionDotKleeneNone of the options
3.7k
views
answered
Sep 1, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
0
votes
129
NIELIT 2017 DEC Scientific Assistant A - Section B: 3
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$ $DFA$ $NFA - 1$ All of the options
The automaton which allows transformation to a new state without consuming any input symbols : $NFA$$DFA$$NFA - 1$All of the options
1.7k
views
answered
Sep 1, 2020
Theory of Computation
nielit2017dec-assistanta
theory-of-computation
finite-automata
+
–
0
votes
130
NIELIT 2017 DEC Scientist B - Section B: 41
Which of the following is equivalent regular expressions? $((01)^*(10)^*)^*$ $(10+01)^*$ $(01)^*+(11)^*$ $(0^*+(11)^*+0^*)^*)$ (i) and (ii) (ii) and (iii) (iii) and (iv) (iv) and (i)
Which of the following is equivalent regular expressions?$((01)^*(10)^*)^*$$(10+01)^*$$(01)^*+(11)^*$$(0^*+(11)^*+0^*)^*)$(i) and (ii)(ii) and (iii)(iii) and (iv)(iv) and...
1.3k
views
answered
Sep 1, 2020
Theory of Computation
nielit2017dec-scientistb
theory-of-computation
regular-expression
+
–
0
votes
131
Andrew S. Tanenbaum (OS) Edition 4 Exercise 3 Question 48 (Page No. 260)
Can you think of any situations where supporting virtual memory would be a bad idea, and what would be gained by not having to support virtual memory? Explain.
Can you think of any situations where supporting virtual memory would be a bad idea, and what would be gained by not having to support virtual memory? Explain.
433
views
answered
Aug 31, 2020
Operating System
tanenbaum
operating-system
memory-management
virtual-memory
paging
descriptive
+
–
0
votes
132
Andrew S. Tanenbaum (OS) Edition 4 Exercise 4 Question 17 (Page No. 334)
For a given class, the student records are stored in a file. The records are randomly accessed and updated. Assume that each student’s record is of fixed size. Which of the three allocation schemes (contiguous, linked and table/indexed) will be most appropriate?
For a given class, the student records are stored in a file. The records are randomly accessed and updated. Assume that each student’s record is of fixed size. Which of...
464
views
answered
Aug 31, 2020
Operating System
tanenbaum
operating-system
file-system
memory-management
descriptive
+
–
1
votes
133
NIELIT 2017 OCT Scientific Assistant A (CS) - Section C: 2
Which of the following is not a form of main memory? Instruction cache Instruction register Instruction opcode Translation look-aside buffer
Which of the following is not a form of main memory?Instruction cacheInstruction registerInstruction opcodeTranslation look-aside buffer
893
views
answered
Aug 29, 2020
CO and Architecture
nielit2017oct-assistanta-cs
co-and-architecture
memory-management
+
–
1
votes
134
Andrew S. Tanenbaum (OS) Edition 4 Exercise 2 Question 27 (Page No. 175)
In a system with threads, is there one stack per thread or one stack per process when user-level threads are used? What about when kernel-level threads are used? Explain.
In a system with threads, is there one stack per thread or one stack per process when user-level threads are used? What about when kernel-level threads are used? Explain....
599
views
answered
Aug 29, 2020
Operating System
tanenbaum
operating-system
process-and-threads
threads
descriptive
+
–
0
votes
135
UGC NET CSE | January 2017 | Part 3 | Question: 53
One of the disadvantages of user level threads compared to Kernel level thread is If a user level thread of a process executes a system call, all threads in that process are blocked. Scheduling is application ... require kernel mode privileges. The library procedures invoked for thread management in user level threads are local procedures.
One of the disadvantages of user level threads compared to Kernel level thread isIf a user level thread of a process executes a system call, all threads in that process a...
5.1k
views
answered
Aug 29, 2020
Operating System
ugcnetcse-jan2017-paper3
operating-system
threads
+
–
1
votes
136
#OS Fork () tell the output?
void forkexample() { // child process because return value zero if (fork() == 0) printf("Hello from Child!\n"); // parent process because return value non-zero. else printf("Hello from Parent!\n"); } int main() { forkexample(); return 0; } Please someone explain how things are working?
void forkexample() { // child process because return value zero if (fork() == 0) printf("Hello from Child!\n"); // parent process because return value non-zero. else prin...
829
views
answered
Aug 28, 2020
Operating System
operating-system
fork-system-call
+
–
1
votes
137
made esay systeam call
610
views
answered
Aug 28, 2020
Operating System
fork-system-call
+
–
0
votes
138
Self doubt -OS-FORK()
1.4k
views
answered
Aug 28, 2020
Operating System
operating-system
fork-system-call
+
–
1
votes
139
testbook test series
which of the statements are correct? A a clustered index offers much better performance than unclustered index for range queries B a clustered index istypically less expensive to manage than unclustered index
which of the statements are correct?A a clustered index offers much better performance than unclustered index for range queriesB a clustered index istypically less expens...
639
views
answered
Aug 24, 2020
Databases
databases
indexing
+
–
0
votes
140
Self Doubt
1.A primary key cannot be NULL (Any of its attributes can’t be NULL) 2.can candidate key be NULL(All attr) (Other than primary keys i,e alternate keys) 3.can some attributes of candidate key be NULL?? which of these are true . false
1.A primary key cannot be NULL (Any of its attributes can’t be NULL)2.can candidate key be NULL(All attr) (Other than primary keys i,e alternate keys)3.can some attribu...
978
views
answered
Aug 23, 2020
Databases
databases
+
–
0
votes
141
made easy cbt1
consider the raletion schema:- R(A,B,C) with functional dependency {A->B} which of the following query returns “0” if no records of R violates A->B functional dependency[assume no NULL’s] for this question I directly marked (d) option as they have used count(*) and count func gives 1 even for null. am i wrong??
consider the raletion schema:-R(A,B,C) with functional dependency {A->B}which of the following query returns “0” if no records of R violates A->B functional dependenc...
334
views
answered
Aug 23, 2020
0
votes
142
Self Doubt
Is the following schedule conflict serializable T1 T2 T3 W(X) commit R(X) W(X) R(X) W(X) commit W(X) commit
Is the following schedule conflict serializableT1T2T3W(X) commit R(X) W(X) R(X) W(X) commit W(X) commit
1.4k
views
answered
Aug 23, 2020
Databases
transaction-and-concurrency
databases
+
–
2
votes
143
MadeEasy Full Length Test 2018: Databases - Transactions
Q50. how many statements is true unrepeatable read also know as read write conflict Strict 2PL may have read write conflict 1st one given as true now my doubt is we know that read write conflict that is https://www.revolvy.com/page/ ... . how we can call unrepeatable read as read write conflict 2nd one given as false but i think it is true
Q50. how many statements is trueunrepeatable read also know as read write conflictStrict 2PL may have read write conflict 1st one given as true now my doubt is we know th...
597
views
answered
Aug 23, 2020
Databases
databases
transaction-and-concurrency
made-easy-test-series
madeeasy-testseries-2018
+
–
0
votes
144
DBMS Korth Edition 4 Exercise 15 Question 5 (Page No. 588)
During its execution, a transaction passes through several states, until it finally commits or aborts. List all possible sequences of states through which a transaction may pass. Explain why each state transition may occur.
During its execution, a transaction passes through several states, until it finally commits or aborts. List all possible sequences of states through which a transaction m...
2.6k
views
answered
Aug 23, 2020
Databases
korth
databases
transaction-and-concurrency
descriptive
+
–
0
votes
145
Made Easy Test Series:Relational Algebra
... this implication holds true?? Selection operation is commutative. But is two project operation can be merge in one project operation? Can project operation removes duplicates too??
$\pi _{A_{1}}\left ( \pi _{A_{2}}\left ( \sigma _{C_{1}}\left ( \sigma _{C_{2}} \left ( R_{1} \right )\right ) \right ) \right )\rightarrow \pi _{A_{1}}\left ( \sigma _{C...
1.2k
views
answered
Aug 19, 2020
Databases
databases
relational-algebra
made-easy-test-series
+
–
0
votes
146
UGC NET CSE | December 2007 | Part 2 | Question: 20
Consider the query : SELECT student_name FROM students WHERE class_name=(SELECT class_name FROM students WHERE math_marks=100); what will be the output ? the list of names of students with $100$ marks in mathematics the names of all ... having $100$ marks in mathematics the names and class of all students whose marks in mathematics is $100$
Consider the query :SELECT student_name FROM students WHERE class_name=(SELECT class_name FROM students WHERE math_marks=100);what will be the output ?the list of names o...
1.1k
views
answered
Aug 19, 2020
Databases
ugcnetcse-dec2007-paper2
+
–
Page:
« prev
1
2
3
4
5
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register