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
5401
DBMS Korth Edition 6 Exercise 1 Question 7 (Page No. 34)
List four applications you have used that most likely employed a database system to store persistent data
List four applications you have used that most likely employed a databasesystem to store persistent data
ajaysoni1924
259
views
ajaysoni1924
asked
Mar 23, 2019
Databases
databases
korth-edition6
descriptive
+
–
0
votes
0
answers
5402
DBMS Korth Edition 6 Exercise 1 Question 6 (Page No. 34)
Keyword queries used in Web search are quite different from database queries. List key differences between the two, in terms of the way the queries are specified, and in terms of what is the result of a query.
Keyword queries used in Web search are quite different from databasequeries. List key differences between the two, in terms of the way thequeries are specified, and in te...
ajaysoni1924
211
views
ajaysoni1924
asked
Mar 23, 2019
Databases
databases
korth-edition6
descriptive
+
–
0
votes
0
answers
5403
DBMS Korth Edition 6 Exercise 1 Question 3 (Page No. 34)
List six major steps that you would take in setting up a database for a particular enterprise.
List six major steps that you would take in setting up a database for aparticular enterprise.
ajaysoni1924
216
views
ajaysoni1924
asked
Mar 23, 2019
Databases
databases
korth-edition6
descriptive
+
–
0
votes
0
answers
5404
DBMS Korth Edition 6 Exercise 1 Question 2 (Page No. 33)
List five ways in which the type declaration system of a language such as Java or C++ differs from the data definition language used in a database.
List five ways in which the type declaration system of a language such asJava or C++ differs from the data definition language used in a database.
ajaysoni1924
246
views
ajaysoni1924
asked
Mar 23, 2019
Databases
databases
korth-edition6
descriptive
+
–
0
votes
0
answers
5405
about array size
#include <stdio.h> // Note that arr[] for fun is just a pointer even if square // brackets are used void fun(char arr[]) // SAME AS void fun(int *arr) { unsigned int n = sizeof(arr)/sizeof(arr[0]); printf("\nArray size inside fun() is ... ********** output is confusing : need explaination how is it happening Array size inside main() is 6 Array size inside fun() is 8
#include <stdio.h // Note that arr[] for fun is just a pointer even if square // brackets are used void fun(char arr[]) // SAME AS void fun(int *arr) { unsigned int n = s...
hitendra singh
676
views
hitendra singh
asked
Mar 22, 2019
0
votes
0
answers
5406
How to apply to IIT Bombay TA
It maybe silly but I am facing uncertainty in the procedure to apply to IITb I am not sure if the portal I get from Google search is the right place to do it. Also I am confused as to the following statement, "COAPS is not used to apply, it's used to accept"
It maybe silly but I am facing uncertainty in the procedure to apply to IITbI am not sure if the portal I get from Google search is the right place to do it. Also I am co...
Kartavya Kothari 1
508
views
Kartavya Kothari 1
asked
Mar 22, 2019
0
votes
0
answers
5407
SHELDON AND ROSS
Twelve percent of all US households are in California. A total of 3.3 percent of all US households earn over 250000 per year, while a total of 6.3 percent California households earn over 250000 per year. If a randomly chosen US household earns over 250,000 per year, ... 10^(-3)/(0.033)=0.2291 But the answer given in the instructors manual is .2066 What is wrong with my logic??
Twelve percent of all US households are in California. A total of 3.3 percent of all US households earn over 250000 per year, while a total of 6.3 percent California hous...
Doraemon
984
views
Doraemon
asked
Mar 22, 2019
Probability
probability
sheldon-ross
+
–
0
votes
0
answers
5408
Peter Linz Edition 4 Exercise 2.2 Question 20 (Page No. 56)
Show that for any nfa for all $q ∈Q$ and all $w, v ∈ Σ^*$ : $\delta ^*(q,wv)=\cup _{p\epsilon \delta ^*(q,w)}\delta ^*(p,v)$ [Use Definition: For an nfa, the extended transition function is defined so that $δ^* (q_i,w)$ ... walk in the transition graph from $q_i$ to $q_j$ labeled $w$. This holds for all $q_i, q_j ∈ Q$, and $w ∈ Σ^*$.]
Show that for any nfa for all $q ∈Q$ and all $w, v ∈ Σ^*$ :$\delta ^*(q,wv)=\cup _{p\epsilon \delta ^*(q,w)}\delta ^*(p,v)$[Use Definition: For an nfa, the extended ...
Naveen Kumar 3
234
views
Naveen Kumar 3
asked
Mar 22, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
1
votes
0
answers
5409
Peter Linz Edition 4 Exercise 2.2 Question 18 (Page No. 55)
An nfa with multiple initial states is defined by the quintuple $M =(Q, Σ,δ,q0,F)$, where $Q_0 ⊆ Q$ is a set of possible initial states. The language accepted by such an automaton is defined as $L (M)=$ ... the same language. Also, Suppose that we made the restriction $Q_0 ∩ F= Ø$. Would this affect the conclusion? (Question 19)
An nfa with multiple initial states is defined by the quintuple $M =(Q, Σ,δ,q0,F)$,where $Q_0 ⊆ Q$ is a set of possible initial states. The language accepted by such ...
Naveen Kumar 3
320
views
Naveen Kumar 3
asked
Mar 22, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
0
votes
0
answers
5410
Allen Career Institute: Discrete Mathematics
A certain software was being tested by using error seeding strategy in which $22$ errors were seeded. $14$ of seeded errors were detected apart from $140$ unseeded errors when the code was tested using the complete test suit. Calculate the estimated no. of undetected errors in the code after complete testing _____
A certain software was being tested by using error seeding strategy in which $22$ errors were seeded. $14$ of seeded errors were detected apart from $140$ unseeded errors...
srestha
214
views
srestha
asked
Mar 22, 2019
Combinatory
discrete-mathematics
combinatory
+
–
0
votes
0
answers
5411
Galvin Edition 9 Exercise 11 Question 18 (Page No. 541)
Discuss the advantages and disadvantages of associating with remote file systems (stored on file servers) a set of failure semantics different from that associated with local file systems.
Discuss the advantages and disadvantages of associating with remotefile systems (stored on file servers) a set of failure semantics differentfrom that associated with loc...
ajaysoni1924
519
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
5412
Galvin Edition 9 Exercise 11 Question 17 (Page No. 540)
Some systems provide file sharing by maintaining a single copy of a file. Other systems maintain several copies, one for each of the users sharing the file. Discuss the relative merits of each approach
Some systems provide file sharing by maintaining a single copy of afile. Other systems maintain several copies, one for each of the userssharing the file. Discuss the rel...
ajaysoni1924
546
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
5413
Galvin Edition 9 Exercise 11 Question 16 (Page No. 540)
Discuss the advantages and disadvantages of supporting links to files that cross mount points (that is, the file link refers to a file that is stored in a different volume).
Discuss the advantages and disadvantages of supporting links to filesthat cross mount points (that is, the file link refers to a file that is storedin a different volume)...
ajaysoni1924
365
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
file-system
descriptive
+
–
0
votes
0
answers
5414
Galvin Edition 9 Exercise 11 Question 15 (Page No. 540)
Give an example of an application that could benefit from operatingsystem support for random access to indexed files.
Give an example of an application that could benefit from operatingsystemsupport for random access to indexed files.
ajaysoni1924
344
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
5415
Galvin Edition 9 Exercise 11 Question 13 (Page No. 540)
Some systems automatically open a file when it is referenced for the first time and close the file when the job terminates. Discuss the advantages and disadvantages of this scheme compared with the more traditional one, where the user has to open and close the file explicitly
Some systems automatically open a file when it is referenced for the firsttime and close the file when the job terminates. Discuss the advantagesand disadvantages of this...
ajaysoni1924
234
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
io-system
descriptive
+
–
0
votes
0
answers
5416
Galvin Edition 9 Exercise 11 Question 12 (Page No. 540)
Provide examples of applications that typically access files according to the following methods: • Sequential • Random
Provide examples of applications that typically access files accordingto the following methods:• Sequential• Random
ajaysoni1924
364
views
ajaysoni1924
asked
Mar 22, 2019
Operating System
operating-system
galvin
descriptive
file-system
+
–
0
votes
0
answers
5417
Discrete mathematics
If adjacency matrix of 2 graphs are same, then can we say that those 2 graphs are isomorphic?
If adjacency matrix of 2 graphs are same, then can we say that those 2 graphs are isomorphic?
Ritabrata Dey
278
views
Ritabrata Dey
asked
Mar 22, 2019
GATE Application
self-doubt
discrete-mathematics
+
–
0
votes
0
answers
5418
Galvin Edition 9 Exercise 10 Question 23 (Page No. 501)
Discuss the reasons why the operating system might require accurate information on how blocks are stored on a disk. How could the operating system improve file-system performance with this knowledge ?
Discuss the reasons why the operating system might require accurate information on how blocks are stored on a disk. How could the operating system improve file-system per...
akash.dinkar12
453
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
file-system
disk
+
–
0
votes
0
answers
5419
Galvin Edition 9 Exercise 10 Question 15 (Page No. 499-500)
Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival of a request and the completion of that request's ... and the effective bandwidth. How does performance depend on the relative sizes of seek time and rotational latency ?
Compare the performance of $C-SCAN$ and $SCAN$ scheduling, assuming a uniform distribution of requests. Consider the average response time (the time between the arrival o...
akash.dinkar12
488
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
0
answers
5420
Galvin Edition 9 Exercise 10 Question 10 (Page No. 498)
Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.
Explain why $SSDs$(Solid State Drives) often use an $FCFS$ disk-scheduling algorithm.
akash.dinkar12
373
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
0
votes
0
answers
5421
Peter Linz Edition 4 Exercise 2.2 Question 14 (Page No. 55)
Let $L$ be the language accepted by the nfa in the following figure: Find an nfa that accepts $L$ $∪$ {$a^5$} .
Let $L$ be the language accepted by the nfa in the following figure:Find an nfa that accepts $L$ $∪$ {$a^5$} .
Naveen Kumar 3
432
views
Naveen Kumar 3
asked
Mar 22, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
0
votes
0
answers
5422
Galvin Edition 9 Exercise 10 Question 7 (Page No. 497-498)
It is sometimes said that tape is a sequential-access medium, whereas a magnetic disk is a random-access medium. In fact, the suitability of a storage device for random access depends on the transfer size. The term streaming transfer rate ... and tape. $f$. When is a tape a random-access device, and when is it a sequential-access device ?
It is sometimes said that tape is a sequential-access medium, whereas a magnetic disk is a random-access medium. In fact, the suitability of a storage device for random a...
akash.dinkar12
520
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk
descriptive
+
–
0
votes
0
answers
5423
Galvin Edition 9 Exercise 10 Question 2 (Page No. 497)
Explain why $SSTF$ scheduling tends to favor middle cylinders over the innermost and outermost cylinders.
Explain why $SSTF$ scheduling tends to favor middle cylinders over the innermost and outermost cylinders.
akash.dinkar12
329
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
disk-scheduling
descriptive
+
–
1
votes
0
answers
5424
Galvin Edition 9 Exercise 9 Question 38 (Page No. 456)
Consider a system that allocates pages of different sizes to its processes. What are the advantages of such a paging scheme ? What modifications to the virtual memory system provide this functionality ?
Consider a system that allocates pages of different sizes to its processes. What are the advantages of such a paging scheme ? What modifications to the virtual memory sys...
akash.dinkar12
776
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
memory-management
paging
+
–
0
votes
0
answers
5425
Galvin Edition 9 Exercise 9 Question 37 (Page No. 456)
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn’t scale well with multiple CPUs. What could be done to address this scalability issue?
The slab-allocation algorithm uses a separate cache for each different object type. Assuming there is one cache per object type, explain why this scheme doesn’t scale w...
akash.dinkar12
315
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
virtual-memory
descriptive
+
–
0
votes
0
answers
5426
Ullman(Second Edition) Exercise 4.2.3. Question (a) (page no-207)
Design grammar for the language- set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct? S->A | 01S A->1AS | ε
Design grammar for the language-set of all strings of 0s and 1s such that every 0 is immediately followed by at least one 1 is this correct?S->A | 01SA->1AS | ε
aditi19
604
views
aditi19
asked
Mar 22, 2019
Compiler Design
theory-of-computation
compiler-design
context-free-grammar
+
–
0
votes
0
answers
5427
Galvin Edition 9 Exercise 9 Question 31 (Page No. 455)
Consider a demand-paging system with a paging disk that has an average access and transfer time of $20$ milliseconds. Addresses are translated through a page table in main memory, with an access time of $1$ microsecond per memory access. ... $10$ percent (or $2$ percent of the total) cause page faults. What is the effective memory access time?
Consider a demand-paging system with a paging disk that has an average access and transfer time of $20$ milliseconds. Addresses are translated through a page table in mai...
akash.dinkar12
532
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
virtual-memory
descriptive
+
–
1
votes
0
answers
5428
Galvin Edition 9 Exercise 9 Question 30 (Page No. 455)
A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distributing heavily used pages evenly over all of memory, rather than having them compete for a small number of page frames. ... faults for an optimal page replacement strategy for the reference string in part $b$ with four page frames?
A page-replacement algorithm should minimize the number of page faults. We can achieve this minimization by distributing heavily used pages evenly over all of memory, rat...
akash.dinkar12
904
views
akash.dinkar12
asked
Mar 22, 2019
Operating System
galvin
operating-system
virtual-memory
descriptive
+
–
0
votes
0
answers
5429
Peter Linz Edition 4 Exercise 2.1 Question 23 (Page No. 49)
Let $G_M$ be the transition graph for some dfa $M$. Prove the following: (a) If $L (M)$ is infinite, then $G_M$ must have at least one cycle for which there is a path from the initial vertex to some vertex in the cycle and a path from some vertex in the cycle to some final vertex. (b) If $L (M)$ is finite, then no such cycle exists.
Let $G_M$ be the transition graph for some dfa $M$. Prove the following:(a) If $L (M)$ is infinite, then $G_M$ must have at least one cycle for which there is a path from...
Naveen Kumar 3
624
views
Naveen Kumar 3
asked
Mar 22, 2019
Theory of Computation
peter-linz
peter-linz-edition4
theory-of-computation
finite-automata
+
–
0
votes
0
answers
5430
M.Tech(CS) in University of Hyderabad and IIT(ISM) Dhanbad.
Hi All, My GATE 2019 Score is 467, Marks: 40 and Rank is: 6124. I belong to OBC(Non-Creamy Layer). I have a probability of getting M.Tech(CS-IS) at IIT(ISM) Dhanbad and M.Tech(CS) at University of Hyderabad ... me any good colleges for my GATE Score ? Any other suggestions or college recommendations will also be very helpful. Thank you. :)
Hi All,My GATE 2019 Score is 467, Marks: 40 and Rank is: 6124. I belong to OBC(Non-Creamy Layer).I have a probability of getting M.Tech(CS-IS) at IIT(ISM) Dhanbad and M.T...
ramm.y2k
1.3k
views
ramm.y2k
asked
Mar 22, 2019
IISc/IITs
ism-dhanbad
usergate2019
usermod
gate2018-admissions
+
–
Page:
« prev
1
...
176
177
178
179
180
181
182
183
184
185
186
...
593
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register
