L-6.1: Hard Disk Architecture in Operating System in Hindi

preview_player
Показать описание

You will get full knowledge of Hard disk architecture in this video. Students find this topic little difficult so here you will get full knowledge of Hard disk architecture.

►Operating System (Complete Playlist):

Other subject-wise playlist Links:
--------------------------------------------------------------------------------------------------------------------------------------
►Design and Analysis of algorithms (DAA):
►Database Management System:
► Theory of Computation
►Artificial Intelligence:
►Computer Networks (Complete Playlist):
►Computer Architecture (Complete Playlist):
►Structured Query Language (SQL):
►Discrete Mathematics:
►Compiler Design:
►Number System:
►Cloud Computing & BIG Data:
►Software Engineering:
►Data Structure:
►Graph Theory:
►Programming in C:
►Digital Logic:

---------------------------------------------------------------------------------------------------------------------------------------
Our social media Links:
--------------------------------------------------------------------------------------------------------------------------------------
►For Any Query, Suggestion or notes contribution:

#DiskArchitecture #HardDiskArchitecture#operatingsystem
Рекомендации по теме
Комментарии
Автор

I am deaf. But I can understand your explanation because of the subtitles. Thank you so much sir....🙂your explanation

lavanyakrishnan
Автор

00:04 Disk scheduling algorithm aims to minimize seek time
00:51 A CD is a circular platter made up of multiple CDs.
01:35 Data is stored in sectors on the platter surface.
02:14 Data storage on hard drives involves tracks, surfaces, and sectors
03:03 Moving the read write head to the desired track
03:48 Seek time is an important aspect of operating systems.
04:41 Seek time is the time taken to move the read-write head to the desired track.
05:31 Disk Scheduling Algorithm and Seek Time
Crafted by Merlin AI.

motivatewithme
Автор

Thank you so much sir. This simple thing was taught to me in my college in a very much complex way. But after seeing your explanation, things are becoming very easy.

saurabhdhote
Автор

00:02 Disk architecture is important in computer organization and is often asked about in related subjects
01:31 Hard disk architecture includes platters and read write heads.
03:01 Platters in hard disks have tracks on them.
04:28 Hard disk architecture involves tracks, sectors, and data storage.
06:00 Hard disk architecture involves platters, surfaces, tracks, and sectors.
07:28 Understanding disk size calculation in sectors
08:54 Understanding disk size notation in terms of bytes and conversion to terabytes
10:16 Understanding the number of bits required to represent disk size
Crafted by Merlin AI.

neetiverma
Автор

It's been 2-3 years since watching your videos and I would say, you have a simplest way to explain such complex topics. Thank you so much sir ❤❤❤

sanghmitrahimani
Автор

I like your style of saying "HELLO DOSTO"

BilalHassan-vyoi
Автор

You have already win my 💖 ...u r So genuine person.. nicely explained 👍 May Almighty shows the rain of mercy upon you..

NigarF
Автор

Masterclasses by the master himself...coming from ur coa series.. That's fab too.Thanks sir🙏🙌🔝

vishnumodh
Автор

Sir I am following your channel after memory hierarchy . I love the way that u use to comprehend any topic

magicianthakur
Автор

Nice explanation. I think total no of bits should be 40*8 = 320bits for 1TB

nileshsrivastava
Автор

⛔ Could not find **Add a comment** button. Here is the entire summary:
```markdown
🎯 Key Takeaways for quick navigation:

00:00 🖥 *Disk architecture is a crucial topic in Operating Systems and computer organization, often asked in exams.*
01:34 🔄 *Platters, surfaces (upper and lower), and read-write heads with actuator arms are fundamental components of disk architecture.*
03:35 📀 *Tracks, both in upper and lower surfaces of platters, are the next element in the disk architecture sequence.*
04:33 🛤 *The movement of the read-write head is limited to forward and backward on tracks, distinguishing internal and external tracks.*
05:34 📊 *Sequence: Platters ➔ Surfaces ➔ Tracks ➔ Sectors ➔ Data. Questions often involve calculating total tracks, sectors, or disk size.*
06:56 💽 *Example calculation: Total tracks = Platters × Surfaces × Tracks, with values often given in powers of 2 for easier computation.*
07:55 📏 *Disk size calculation involves multiplying platters, surfaces, tracks, sectors, and data capacity, usually given in bytes (often in powers of 2).*
09:26 💾 *Disk size conversion: 2^40 bytes = 1 terabyte. Understanding kilo, mega, giga, tera conversions is essential for accurate answers.*
10:30 🤔 *Number of bits*

anmolmadhav
Автор

Sir u r M watching ur videos in 2x speed for ugc net exm revision.... Tq sir .. Cnt tell u hw much u have helpd me throughout my exm prepartion.... Hope i ll clear my exm✌tq once again🙏🙏🙂

poonamgarg
Автор

I just realized I'm watching this for so long now and you sir have helped me a lot but I still hadn't subscribed or liked your videos and I felt so bad. So now I'll go back and like all your videos and I have subscribed now. So sorry !

Hjain
Автор

Really a good explanation with boys calculation ✌️

kirtitegta-
Автор

Thanks for such amazing lectures... 💥Really appreciable, helpful and so sweet of you for extremely easy and simple explanations sir 😊

PoojaSingh-kkip
Автор

i really CANT thank you enough for this good quality helpful playlist... but here regarding the last part, "the number of bits required" I think the ans should be ....
there was 2^40 bytes... so when we will be asked for number of required bits we need to convert bytes to bits. That is

2^40 x 8
= 2^40x 2^3
= 2^43
threfore number of bits required is 43 bits 😇
i think thats the correct way!!!

mumtahinahmed
Автор

Consider a hard disk with 16 recording surfaces (0-15) having 16384 cylinders (0-16383)
and each cylinder contains 64 sectors (0-63). Data storage capacity in each sector is 512
bytes. Data are organized cylinder-wise and the addressing format is . A file of size 42797
KB is stored in the disk and the starting disk location of the file is <1200, 9, 40>.
What is the cylinder number of the last sector of the file, if it is stored in a contiguous
manner? Sir please give explanation of this question

wrestlingkingdomll
Автор

Thanks from a student of NSU, Dhaka. Without your video, I couldn't pass my engineering so smoothly.

MdAl-AminAhmed-fthw
Автор

Nice sir please help to 12 standard students sir our future depend upon u please sir

amanthakur
Автор

I paused at 9:11 by mistake and it reminded me of Amitab Bachchan🤣 Anyways excellent teaching sir! Thanks a lot!!

arkadeepsen