Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Filter
No answer
No selected answer
No upvoted answer
Previous GATE
Featured
Recent questions without answers
0
votes
0
answers
3631
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 31 (Page No. 83)
Explain how separation of policy and mechanism aids in building microkernel-based operating systems.
Explain how separation of policy and mechanism aids in building microkernel-based operating systems.
admin
279
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
1
votes
0
answers
3632
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 30 (Page No. 83)
A portable operating system is one that can be ported from one system architecture to another without any modification. Explain why it is infeasible to build an operating system that is completely portable. Describe two high-level layers that you will have in designing an operating system that is highly portable.
A portable operating system is one that can be ported from one system architecture to another without any modification. Explain why it is infeasible to build an operating...
admin
386
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3633
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 29 (Page No. 83)
Figure $1-23$ shows that a number of UNIX system calls have no Win32 API equivalents. For each of the calls listed as having no Win32 equivalent, what are the consequences for a programmer of converting a UNIX program to run under Windows?
Figure $1-23$ shows that a number of UNIX system calls have no Win32 API equivalents. For each of the calls listed as having no Win32 equivalent, what are the consequence...
admin
640
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
unix
system-call
descriptive
+
–
0
votes
0
answers
3634
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 28 (Page No. 83)
To a programmer, a system call looks like any other call to a library procedure. Is it important that a programmer know which library procedures result in system calls? Under what circumstances and why?
To a programmer, a system call looks like any other call to a library procedure. Is it important that a programmer know which library procedures result in system calls? U...
admin
225
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
system-call
descriptive
+
–
0
votes
0
answers
3635
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 27 (Page No. 83)
Modern operating systems decouple a process address space from the machine’s physical memory. List two advantages of this design.
Modern operating systems decouple a process address space from the machine’s physical memory. List two advantages of this design.
admin
535
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
memory-management
descriptive
+
–
0
votes
0
answers
3636
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 26 (Page No. 83)
In the example given in Fig. $1-17$, the library procedure is called read and the system call itself is called read. Is it essential that both of these have the same name? If not, which one is more important?
In the example given in Fig. $1-17$, the library procedure is called read and the system call itself is called read. Is it essential that both of these have the same name...
admin
281
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
1
votes
0
answers
3637
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 23 (Page No. 82 - 83)
A file whose file descriptor is fd contains the following sequence of bytes$: 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5.$ The following system calls are made: lseek(fd, $3$, SEEK SET); read(fd, &buffer, $4$); where the lseek call makes a seek to byte $3$ of the file. What does buffer contain after the read has completed?
A file whose file descriptor is fd contains the following sequence of bytes$: 3, 1, 4, 1, 5, 9, 2, 6, 5, 3, 5.$ The following system calls are made:lseek(fd, $3$, SEEK SE...
admin
674
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
system-call
descriptive
+
–
0
votes
0
answers
3638
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 22 (Page No. 82)
Can the count = write(fd, buffer, nbytes); call return any value in count other than nbytes? If so, why?
Can thecount = write(fd, buffer, nbytes);call return any value in count other than nbytes? If so, why?
admin
377
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3639
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 21 (Page No. 82)
What type of multiplexing (time, space, or both) can be used for sharing the following resources: CPU, memory, disk, network card, printer, keyboard, and display?
What type of multiplexing (time, space, or both) can be used for sharing the following resources: CPU, memory, disk, network card, printer, keyboard, and display?
admin
395
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
multiplexing
descriptive
+
–
0
votes
0
answers
3640
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 20 (Page No. 82)
For each of the following system calls, give a condition that causes it to fail: fork, exec, and unlink.
For each of the following system calls, give a condition that causes it to fail: fork, exec, and unlink.
admin
247
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
system-call
descriptive
+
–
0
votes
0
answers
3641
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 19 (Page No. 82)
Is there any reason why you might want to mount a file system on a nonempty directory? If so, what is it?
Is there any reason why you might want to mount a file system on a nonempty directory? If so, what is it?
admin
169
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
file-system
descriptive
+
–
0
votes
0
answers
3642
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 18 (Page No. 82)
Why is the process table needed in a timesharing system? Is it also needed in personal computer systems running UNIX or Windows with a single user?
Why is the process table needed in a timesharing system? Is it also needed in personal computer systems running UNIX or Windows with a single user?
admin
166
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
timesharing-system
descriptive
+
–
0
votes
0
answers
3643
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 16 (Page No. 82)
When a user program makes a system call to read or write a disk file, it provides an indication of which file it wants, a pointer to the data buffer, and the count. Control is then transferred to the operating ... What about the case of writing to the disk? Need the caller be blocked awaiting completion of the disk transfer?
When a user program makes a system call to read or write a disk file, it provides an indication of which file it wants, a pointer to the data buffer, and the count. Contr...
admin
306
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
system-call
interrupts
descriptive
+
–
0
votes
0
answers
3644
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 12 (Page No. 82)
Which of the following instructions should be allowed only in kernel mode? Disable all interrupts. Read the time-of-day clock. Set the time-of-day clock. Change the memory map
Which of the following instructions should be allowed only in kernel mode?Disable all interrupts.Read the time-of-day clock.Set the time-of-day clock.Change the memory ma...
admin
295
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
kernel-mode
easy
+
–
0
votes
0
answers
3645
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 11 (Page No. 81)
A $255$-GB disk has $65,536$ cylinders with $255$ sectors per track and $512$ bytes per sector. How many platters and heads does this disk have? Assuming an average cylinder seek time of $11$ ms, average rotational delay ... reading rate of $100$ MB/sec, calculate the average time it will take to read $400$ KB from one sector.
A $255$-GB disk has $65,536$ cylinders with $255$ sectors per track and $512$ bytes per sector. How many platters and heads does this disk have? Assuming an average cylin...
admin
294
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3646
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 10 (Page No. 81)
What is the difference between kernel and user mode? Explain how having two distinct modes aids in designing an operating system.
What is the difference between kernel and user mode? Explain how having two distinct modes aids in designing an operating system.
admin
198
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
kernel-user-mode
descriptive
+
–
0
votes
0
answers
3647
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 9 (Page No. 81)
There are several design goals in building an operating system, for example, resource utilization, timeliness, robustness, and so on. Give an example of two design goals that may contradict one another.
There are several design goals in building an operating system, for example, resource utilization, timeliness, robustness, and so on. Give an example of two design goals ...
admin
403
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3648
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 8 (Page No. 81)
One reason GUIs were initially slow to be adopted was the cost of the hardware needed to support them. How much video RAM is needed to support a $25-\text{line}\times\: 80-\text{row}$ character monochrome text screen? How much for a ... $ prices $(\$5/KB)?$ How much is it now?
One reason GUIs were initially slow to be adopted was the cost of the hardware needed to support them. How much video RAM is needed to support a $25-\text{line}\times\: 8...
admin
169
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3649
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 7 (Page No. 81)
The family-of-computers idea was introduced in the $1960s$ with the IBM System$/360$ mainframes. Is this idea now dead as a doornail or does it live on?
The family-of-computers idea was introduced in the $1960s$ with the IBM System$/360$ mainframes. Is this idea now dead as a doornail or does it live on?
admin
190
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
descriptive
+
–
0
votes
0
answers
3650
Andrew S. Tanenbaum (OS) Edition 4 Exercise 1 Question 6 (Page No. 81)
Instructions related to accessing I/O devices are typically privileged instructions, that is, they can be executed in kernel mode but not in user mode. Give a reason why these instructions are privileged.
Instructions related to accessing I/O devices are typically privileged instructions, that is, they can be executed in kernel mode but not in user mode. Give a reason why ...
admin
201
views
admin
asked
Oct 23, 2019
Operating System
tanenbaum
operating-system
instruction-format
descriptive
+
–
3
votes
0
answers
3651
Michael Sipser Edition 3 Exercise 5 Question 36 (Page No. 242)
Say that a $CFG$ is minimal if none of its rules can be removed without changing the language generated. Let $MIN_{CFG} = \{\langle G \rangle \mid \text{G is a minimal CFG}\}$. Show that $MIN_{CFG}$ is $T-$recognizable. Show that $MIN_{CFG}$ is undecidable.
Say that a $CFG$ is minimal if none of its rules can be removed without changing the language generated. Let $MIN_{CFG} = \{\langle G \rangle \mid \text{G is a minimal CF...
admin
634
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
context-free-grammar
recursive-and-recursively-enumerable-languages
decidability
proof
+
–
1
votes
0
answers
3652
Michael Sipser Edition 3 Exercise 5 Question 35 (Page No. 242)
Say that a variable $A$ in $CFG \:G$ is necessary if it appears in every derivation of some string $w \in G$. Let $NECESSARY_{CFG} = \{\langle G, A\rangle \mid \text{A is a necessary variable in G}\}$. Show that $NECESSARY_{CFG}$ is Turing-recognizable. Show that $NECESSARY_{CFG} $is undecidable.
Say that a variable $A$ in $CFG \:G$ is necessary if it appears in every derivation of some string $w \in G$. Let $NECESSARY_{CFG} = \{\langle G, A\rangle \mid \text{A is...
admin
337
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
recursive-and-recursively-enumerable-languages
decidability
proof
+
–
0
votes
0
answers
3653
Michael Sipser Edition 3 Exercise 5 Question 32 (Page No. 241)
Prove that the following two languages are undecidable. $OVERLAP_{CFG} = \{\langle G, H\rangle \mid \text{G and H are CFGs where}\: L(G) \cap L(H) \neq \emptyset\}$. $PREFIX-FREE_{CFG} = \{\langle G \rangle \mid \text{G is a CFG where L(G) is prefix-free}\}$.
Prove that the following two languages are undecidable.$OVERLAP_{CFG} = \{\langle G, H\rangle \mid \text{G and H are CFGs where}\: L(G) \cap L(H) \neq \emptyset\}$.$PREF...
admin
455
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
context-free-grammar
turing-machine
decidability
proof
+
–
0
votes
0
answers
3654
Michael Sipser Edition 3 Exercise 5 Question 31 (Page No. 241)
Let $f(x)=\left\{\begin{matrix}3x+1 & \text{for odd}\: x& \\ \dfrac{x}{2} & \text{for even}\: x & \end{matrix}\right.$ for any natural number $x$. If you start with an integer $x$ and iterate $f$, you ... decidable by a $TM\: H$. Use $H$ to describe a $TM$ that is guaranteed to state the answer to the $3x + 1$ problem.
Let$f(x)=\left\{\begin{matrix}3x+1 & \text{for odd}\: x& \\ \dfrac{x}{2} & \text{for even}\: x & \end{matrix}\right.$for any natural number $x$. If you start with an inte...
admin
363
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
decidability
proof
+
–
1
votes
0
answers
3655
Michael Sipser Edition 3 Exercise 5 Question 30 (Page No. 241)
Use Rice’s theorem, to prove the undecidability of each of the following languages. $INFINITE_{TM} = \{\langle M \rangle \mid \text{M is a TM and L(M) is an infinite language}\}$. $\{\langle M \rangle \mid \text{M is a TM and }\:1011 \in L(M)\}$. $ ALL_{TM} = \{\langle M \rangle \mid \text{ M is a TM and}\: L(M) = Σ^{\ast} \}$.
Use Rice’s theorem, to prove the undecidability of each of the following languages.$INFINITE_{TM} = \{\langle M \rangle \mid \text{M is a TM and L(M) is an infinite lan...
admin
398
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
decidability
rice-theorem
proof
+
–
0
votes
0
answers
3656
Michael Sipser Edition 3 Exercise 5 Question 29 (Page No. 241)
Rice's theorem. Let $P$ be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine's language has property $P$ is undecidable. In more formal ... that $P$ is an undecidable language. Show that both conditions are necessary for proving that $P$ is undecidable.
Rice’s theorem. Let $P$ be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine’s languag...
admin
459
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
decidability
rice-theorem
proof
+
–
0
votes
0
answers
3657
Michael Sipser Edition 3 Exercise 5 Question 28 (Page No. 241)
Rice's theorem. Let $P$ be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine's language has property $P$ is undecidable. In more formal terms, let $P$ be a language ... $M_{1}$ and $M_{2}$ are any $TMs$. Prove that $P$ is an undecidable language.
Rice’s theorem. Let $P$ be any nontrivial property of the language of a Turing machine. Prove that the problem of determining whether a given Turing machine’s languag...
admin
411
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
decidability
rice-theorem
proof
+
–
1
votes
0
answers
3658
Michael Sipser Edition 3 Exercise 5 Question 27 (Page No. 241)
A two-dimensional finite automaton $(2DIM-DFA)$ is defined as follows. The input is an $m \times n$ rectangle, for any $m, n \geq 2$ ... of determining whether two of these machines are equivalent. Formulate this problem as a language and show that it is undecidable.
A two-dimensional finite automaton $(2DIM-DFA)$ is defined as follows. The input is an $m \times n$ rectangle, for any $m, n \geq 2$. The squares along the boundary of th...
admin
469
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
turing-machine
decidability
proof
+
–
0
votes
0
answers
3659
Michael Sipser Edition 3 Exercise 5 Question 26 (Page No. 240)
Define a two-headed finite automaton $(2DFA)$ to be a deterministic finite automaton that has two read-only, bidirectional heads that start at the left-hand end of the input tape and can be independently controlled to move in either direction. The tape ... $E_{2DFA}$ is not decidable.
Define a two-headed finite automaton $(2DFA)$ to be a deterministic finite automaton that has two read-only, bidirectional heads that start at the left-hand end of the in...
admin
399
views
admin
asked
Oct 20, 2019
Theory of Computation
michael-sipser
theory-of-computation
finite-automata
turing-machine
decidability
proof
+
–
0
votes
0
answers
3660
Michael Sipser Edition 3 Exercise 5 Question 25 (Page No. 240)
Give an example of an undecidable language $B$, where $B \leq_{m} \overline{B}$.
Give an example of an undecidable language $B$, where $B \leq_{m} \overline{B}$.
admin
301
views
admin
asked
Oct 19, 2019
Theory of Computation
michael-sipser
theory-of-computation
turing-machine
decidability
reduction
proof
+
–
Page:
« prev
1
...
117
118
119
120
121
122
123
124
125
126
127
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
