Top answers

All subjects
All levels

Describe the process of a binary search.

A binary search requires a ordered list. The search first finds the data entry in the middle of the list, and checks whether it is larger or smaller than the data it is looking for. It then removed half t...

MT
Answered by Michael T. Computing tutor
2892 Views

Describe a queue data structure.

A queue is a FIFO (First In First Out) data structure.
Analogous to a production line, the first item in the list will be the first to be removed, the second the second and so on.

MT
Answered by Michael T. Computing tutor
2685 Views

Describe a stack data structure.

A stack is a LIFO (Last In First Out) data structure. 
Analogous to a stack of plates, every new data entry is placed (or pushed) onto the top of the stack, and to get the the data below it, you must...

MT
Answered by Michael T. Computing tutor
3269 Views

How to convert any binary number to decimal?

Let us take a binary number 10010111. To make conversion easier let us write down numbers 0 to 7 under this binary number starting from the right side.

These numbers will...

MS
Answered by Mantas S. Computing tutor
5262 Views

How does a HDD (Hard drive disk) work?

A HDD is a mechanical form of storage, using electromagnetism to store and write data.
Mechanical drives are very prone to data lose and breaking when moved around, due to their mechanical nature.

HB
Answered by Harvey B. Computing tutor
3556 Views

We're here to help

contact us iconContact ustelephone icon+44 (0) 203 773 6020
Facebook logoInstagram logoLinkedIn logo

© MyTutorWeb Ltd 2013–2025

Terms & Conditions|Privacy Policy
Cookie Preferences