Basic CS [3i Infotech Placement]: Sample Questions 229 - 230 of 243

Glide to success with Doorsteptutor material for competitive exams : get questions, notes, tests, video lectures and more- for all subjects of your exam.

Question 229

Basic CS

Question

MCQ▾

Which of the following sorting algorithms has average sorting behaviour?

Choices

Choice (4)

a.

Merge sort

b.

Quick sort

c.

Heap sort

d.

Bubble sort

Answer

b.

Explanation

  • The quick sort uses divide and conquer to gain the same advantages as the merge sort, while not using additional storage.
  • In the merge sort it is possible that the list may not be divided in half which could cause the performance to be diminished.
  • A quick sort first selects a value called the pivot value- among the many ways one can simply use the first item in the list.
  • Pivot value assists with splitting the list- actual position of pivot in the final sorted list- called the split point- divides the list for subsequent calls to the quick sort.
  • Let us understand with an example.

Example of quick sort:

Example of Quick Sort

Question 230

Basic CS
Edit

Write in Short

Short Answer▾

What is MAC address?

Explanation

  • The unique address for a device identified at the Media Access Control layer in the network architecture.
  • Used by the Media Access Control sub-layer of the Data-Link Layer of telecommunication protocols.
  • Different MAC exist for each physical device type
  • Usually stored in ROM on the network adapter card.
  • A hardware identification number that uniquely identifies each device on a network- manufactured into every network card, ethernet card, or Wi-Fi card.
  • Reliable way to identify senders and receivers of data on the network.
  • They are usually written in one of the below three formats:
  1. MM: MM: MM: SS: SS: SS
  2. MM: MM-MM-SS-SS-SS
  3. MMM. MMM. SSS. SSS

Developed by: