menu
Login
Register
search
Log In
account_circle
Log In
Email or Username
Password
Remember
Log In
Register
I forgot my password
Register
Username
Email
Password
Register
add
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
Barc Interview Experience 2020- CSE stream
JEST 2021 registrations are open
TIFR GS-2021 Online Application portal
IIT Jodhpur Mtech AI - Interview Expierence (Summer Admission)
Interview experience at IIT Tirupati for MS program winter admission
Subjects
All categories
General Aptitude
(2.1k)
Engineering Mathematics
(8.5k)
Digital Logic
(3k)
Programming and DS
(5.1k)
Algorithms
(4.5k)
Theory of Computation
(6.3k)
Compiler Design
(2.2k)
Operating System
(4.7k)
Databases
(4.3k)
CO and Architecture
(3.5k)
Computer Networks
(4.3k)
Non GATE
(1.2k)
Others
(1.3k)
Admissions
(595)
Exam Queries
(838)
Tier 1 Placement Questions
(16)
Job Queries
(71)
Projects
(19)
Unknown Category
(1.1k)
Recent Blog Comments
I think The JEST website rercently updated the...
hi this pdf have gate prevoius year questions or...
Thanks, dude for sharing your experience !! It...
Congratulations, at least you made it to the...
seems like you really enjoyed the process.......
Network Sites
GO Mechanical
GO Electrical
GO Electronics
GO Civil
CSE Doubts
TANCET 2011 OS
0
votes
131
views
The access method used for obtaining a record from a cassette tape is
1) direct
2) sequential
3) random
4) parallel
tancet
asked
Oct 24, 2018
in
Operating System
Balaji Jegan
131
views
answer
comment
0
Option 2?
0
Yes, it will be sequential. The cassette tape was used long back.Suppose there are 50 songs in that tape but we want to listen song number 19 then we can not go to 19 number directly, we have to forward it sequentially one by one...
Please
log in
or
register
to add a comment.
Please
log in
or
register
to answer this question.
1
Answer
0
votes
The answer is
Sequential access
to get data from the
cassette tape
answered
Oct 24, 2018
Rackson
comment
Please
log in
or
register
to add a comment.
← Prev.
Next →
← Prev. Qn. in Sub.
Next Qn. in Sub. →
Related questions
0
votes
0
answers
1
98
views
TANCET 2011 FILE ORGANIZATION
The most efficient dataset organisation is 1) a sequential file 2) an ISAM file 3) variable depending upon the usage of the dataset 4) a partitioned data set
The most efficient dataset organisation is 1) a sequential file 2) an ISAM file 3) variable depending upon the usage of the dataset 4) a partitioned data set
asked
Oct 24, 2018
in
Operating System
Balaji Jegan
98
views
tancet
0
votes
1
answer
2
280
views
TANCET 2011 OPERATING SYSTEM
Railway reservation system currently operational in India can be classified as a 1) batch processing system 2) real time system 3) online system 4) expert system
Railway reservation system currently operational in India can be classified as a 1) batch processing system 2) real time system 3) online system 4) expert system
asked
Oct 24, 2018
in
Operating System
Balaji Jegan
280
views
tancet
0
votes
0
answers
3
325
views
TANCET 2011 SORTING
An array has 5 elements. Calculate the following: SL. NO: NAME ARRAY IS ALREADY SORTED ARRAY IS REVERSE SORTED ELEMENT COMPARSIONS ELEMENT EXCHANGES ELEMENT COMPARISONS ELEMENT EXCHANGES 1 BUBBLE SORT ? ? ? ? 2 SELECTION SORT ? ? ? ? 3 INSERTION SORT ? ? ? ? 4 QUICK SORT ? ? ? ? 5 MERGE ... ? ? 6 RADIX SORT ? ? ? ? 7 HEAP SORT ? ? ? ? 8 TREE SORT ? ? ? ? 9 COUNTING SORT ? ? ? ?
An array has 5 elements. Calculate the following: SL. NO: NAME ARRAY IS ALREADY SORTED ARRAY IS REVERSE SORTED ELEMENT COMPARSIONS ELEMENT EXCHANGES ELEMENT COMPARISONS ELEMENT EXCHANGES 1 BUBBLE SORT ? ? ? ? 2 SELECTION SORT ? ? ? ? 3 INSERTION SORT ? ? ? ? 4 QUICK SORT ? ? ? ? 5 MERGE SORT ? ? ? ? 6 RADIX SORT ? ? ? ? 7 HEAP SORT ? ? ? ? 8 TREE SORT ? ? ? ? 9 COUNTING SORT ? ? ? ?
asked
Oct 24, 2018
in
Algorithms
Balaji Jegan
325
views
tancet
sorting
algorithms
0
votes
2
answers
4
304
views
TANCET 2011 PROBABILITY
A man alternately tosses a coin and throws a dice, beginning with the coin. Then probability that he will get a head before he gets a 5 or 6 on dice is 1) 1/4 2) 3/4 3) 4/5 4) 4/7
A man alternately tosses a coin and throws a dice, beginning with the coin. Then probability that he will get a head before he gets a 5 or 6 on dice is 1) 1/4 2) 3/4 3) 4/5 4) 4/7
asked
Oct 24, 2018
in
Probability
Balaji Jegan
304
views
tancet
...