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 spriti1991
11
votes
1
Calculating number of tokens
Given solution: Please explain how the number of tokens are 11.
Given solution:Please explain how the number of tokens are 11.
18.8k
views
answered
Apr 5, 2016
Compiler Design
compiler-tokenization
compiler-design
testbook-test-series
numerical-answers
+
–
2
votes
2
Why is left recursion not a problem for bottom up parsers?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(0)/LR(1) sets : Eg : S->Sa|a Then in LR(0) set : ... is in front of S , so shouldn't the S production be generated again and again and make it go to an inf. loop?
I know the parsing logic of bottom up parsers, that they start from the terminal and reduce it to the start symbol. But what really confuses me is the construction of LR(...
10.5k
views
answered
Apr 5, 2016
Compiler Design
compiler-design
parsing
lr-parser
+
–
2
votes
3
lexical anayzer
can int a=a 10 is a lexical or not if yes then why ??? if no then give reason?
can int a=a 10 is a lexical or notif yes then why ???if no then give reason?
619
views
answered
Apr 3, 2016
Compiler Design
compiler-design
lexical-analysis
+
–
–4
votes
4
GATE CSE 1997 | Question: 3.8
When an interrupt occurs, an operating system ignores the interrupt always changes state of interrupted process after processing the interrupt always resumes execution of interrupted process after processing the interrupt may change state of interrupted process to ‘blocked’ and schedule another process.
When an interrupt occurs, an operating systemignores the interruptalways changes state of interrupted process after processing the interruptalways resumes execution of in...
13.9k
views
answered
Apr 2, 2016
Operating System
gate1997
operating-system
interrupts
normal
+
–
0
votes
5
Asymptotic Notation
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly x.
Describe a Θ(nlgn)-time algorithm that, given a set S of n integers and another integer x, determines whether or not there exists two elements of S whose sum is exactly ...
2.2k
views
answered
May 27, 2015
Algorithms
asymptotic-notation
algorithms
+
–
0
votes
6
DATA STRUCTURES
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort runs in 64nlgn steps. For which values of n does insertion sort beat merge sort?
Suppose we are comparing implementations of insetion sort and merge sort on the same machine. For inputs of size n, insertion sort runs in 8n^2 steps, while merge sort ru...
852
views
answered
May 20, 2015
Algorithms
algorithms
sorting
merge-sort
+
–
4
votes
7
SQL
Consider the Following Collection of relational schema Professor( profname , deptname) Department (deptname, building) Committee(commname, Profname) Which of following query finds all the professors who have not offices in any of those buildings that professor Piper has offices in ... d1, professor p1 Where P1.Profname=’Piper’ and p1.deptname=D1.deptname ) D) None of these
Consider the Following Collection of relational schemaProfessor( profname , deptname)Department (deptname, building)Committee(commname, Profname)Which of following query ...
1.1k
views
answered
May 20, 2015
Databases
sql
+
–
0
votes
8
RMo and CMO
Does any one know the formula for Row major order and column major order of symmetric square band matrix
Does any one know the formula for Row major order and column major order of symmetric square band matrix
2.0k
views
answered
May 19, 2015
0
votes
9
SQL
Consider the following Realtion Borrower(borrower no , name , age) Loan (copy no , borrower no , due date ) Retrieve the borrower name and number of books currently on loan for each of the borrower 1) Select borrower.name, count (*) from loan where loan.borrower ... .name, count (*) from loan, borrowe where loan.borrower name= borrower.borrower name group by loan .borrower.no 4) None of these
Consider the following RealtionBorrower(borrower no , name , age)Loan (copy no , borrower no , due date )Retrieve the borrower name and number of books currently on loan ...
471
views
answered
May 19, 2015
Databases
sql
+
–
0
votes
10
Decoder
Which of following statement is true ? S1. Any boolean function can be realized using decoder s2. One multiplexer can realize 1 function at a time a) S1 is true b) S2 is true 3) Both are true d) none of them
Which of following statement is true ?S1. Any boolean function can be realized using decoders2. One multiplexer can realize 1 function at a timea) S1 is trueb) S2 is true...
1.7k
views
answered
May 4, 2015
0
votes
11
Limits
What is $\lim_{ x \to 0} (1-x)^{\frac{1}{x}}$ ? Also please explain the result?
What is $\lim_{ x \to 0} (1-x)^{\frac{1}{x}}$ ? Also please explain the result?
2.7k
views
answered
Apr 7, 2015
Calculus
calculus
limits
+
–
0
votes
12
IEEE754 For
https://gateoverflow.in/?qa=blob&qa_blobid=677596019370884012
https://gateoverflow.in/?qa=blob&qa_blobid=677596019370884012
849
views
answered
Apr 2, 2015
CO and Architecture
floating-point-representation
+
–
0
votes
13
DMA Data trasnfer Rate
A progarm drive Data Transfer results overhead of 6 instruction per byte.System uses 100MHZ clock and need 4 clock on an average for any instruction . what is maximum data transfer rate (Apprx) ?
A progarm drive Data Transfer results overhead of 6 instruction per byte.System uses 100MHZ clock and need 4 clock on an average for any instruction . what is maximum dat...
1.5k
views
answered
Mar 30, 2015
CO and Architecture
dma
+
–
3
votes
14
GATE CSE 1996 | Question: 25
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, and assume that the handling of the interrupt at DMA completion requires $500$ ... What fraction of the processor time is consumed by the disk, if the disk is actively transferring $100\%$ of the time?
A hard disk is connected to a $50$ MHz processor through a DMA controller. Assume that the initial set-up of a DMA transfer takes $1000$ clock cycles for the processor, ...
10.2k
views
answered
Mar 29, 2015
CO and Architecture
gate1996
co-and-architecture
io-handling
dma
numerical-answers
normal
+
–
24
votes
15
GATE IT 2006 | Question: 8
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width? Transparent DMA and Polling interrupts Cycle-stealing and Vectored interrupts Block transfer and Vectored interrupts Block transfer and Polling interrupts
Which of the following DMA transfer modes and interrupt handling mechanisms will enable the highest I/O band-width?Transparent DMA and Polling interruptsCycle-stealing an...
13.0k
views
answered
Mar 29, 2015
Operating System
gateit-2006
operating-system
io-handling
dma
normal
+
–
35
votes
16
GATE CSE 2008 | Question: 32
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due to non-uniform distribution of requests arm starting and stopping inertia higher capacity of tracks on the periphery of the platter use of unfair arm scheduling policies
For a magnetic disk with concentric circular tracks, the seek latency is not linearly proportional to the seek distance due tonon-uniform distribution of requestsarm star...
13.4k
views
answered
Mar 24, 2015
Operating System
gatecse-2008
operating-system
disk
normal
+
–
–6
votes
17
GATE CSE 2003 | Question: 25, ISRO2009-12
Using a larger block size in a fixed block size file system leads to better disk throughput but poorer disk space utilization better disk throughput and better disk space utilization poorer disk throughput but better disk space utilization poorer disk throughput and poorer disk space utilization
Using a larger block size in a fixed block size file system leads tobetter disk throughput but poorer disk space utilizationbetter disk throughput and better disk space u...
15.0k
views
answered
Mar 24, 2015
Operating System
gatecse-2003
operating-system
disk
normal
isro2009
+
–
–5
votes
18
GATE CSE 1998 | Question: 2-9
Formatting for a floppy disk refers to arranging the data on the disk in contiguous fashion writing the directory erasing the system data writing identification information on all tracks and sectors
Formatting for a floppy disk refers toarranging the data on the disk in contiguous fashionwriting the directoryerasing the system datawriting identification information o...
7.4k
views
answered
Mar 24, 2015
Operating System
gate1998
operating-system
disk
normal
+
–
47
votes
19
GATE CSE 1995 | Question: 14
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector, Compute the unformatted capacity of the disk for the following parameters: Number of surfaces: $8$ Outer diameter of the disk: $12$ cm Inner diameter of ... rpm, determine the effective data transfer rate which is defined as the number of bytes transferred per second between disk and memory.
If the overhead for formatting a disk is $96$ bytes for a $4000$ byte sector,Compute the unformatted capacity of the disk for the following parameters:Number of surfaces:...
12.9k
views
answered
Mar 24, 2015
Operating System
gate1995
operating-system
disk
normal
descriptive
+
–
73
votes
20
GATE IT 2005 | Question: 81-a
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $10$ MB. What is the total amount of data that can be stored on the disk if it is used with a drive that rotates ... . $80 \ \text{MB}$; II. $360 \ \text{MB}$ I. $360 \ \text{MB}$; II. $80 \ \text{MB}$
A disk has $8$ equidistant tracks. The diameters of the innermost and outermost tracks are $1$ cm and $8$ cm respectively. The innermost track has a storage capacity of $...
12.0k
views
answered
Mar 23, 2015
Operating System
gateit-2005
operating-system
disk
normal
+
–
22
votes
21
GATE CSE 1993 | Question: 6.7
A certain moving arm disk storage, with one head, has the following specifications: Number of tracks/recording surface $= 200$ Disk rotation speed $= 2400$ rpm Track storage capacity $= 62,500$ bits The average latency of this device is $\text{P}$ ms and the data transfer rate is $\text{Q}$ bits/sec. Write the values of $\text{P}$ and $\text{Q}$.
A certain moving arm disk storage, with one head, has the following specifications:Number of tracks/recording surface $= 200$Disk rotation speed $= 2400$ rpmTrack storage...
20.3k
views
answered
Mar 23, 2015
Operating System
gate1993
operating-system
disk
normal
descriptive
+
–
83
votes
22
GATE CSE 1998 | Question: 1.27
Type checking is normally done during lexical analysis syntax analysis syntax directed translation code optimization
Type checking is normally done duringlexical analysissyntax analysissyntax directed translationcode optimization
13.9k
views
answered
Mar 18, 2015
Compiler Design
gate1998
compiler-design
parsing
easy
+
–
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register