Algorithm and Data structure (Lecture # 4)

A step by step solution to a problem is called algorithm A typical programming task can be divided into two phases.
1)Problem Solution Phase
Produce an ordered sequence of steps that deserve solution of problem.
This sequence of steps is called an algorithm. 2)Implementation Phase
Implement the program in some programming language.
- First produce a general algorithm (one can use pseudo code) 3)Pseudo code
Pseudo code is an artificial and informal language that helps programmer develop an algorithm
Pseudo code is very similar to everyday English
- And algorithm is a step by step solution of a specific mathematical or computer related problem.

Approaches to write algorithm

There two different approaches to written algorithm
1.Formal style algorithm
Heading of algorithm Step by step algorithm - - - Exit
2.Informal style algorithm
It is written in a human language e.g, English suits a pure pseudo code e.g, Step # 1 Defined in English
Step # 2 Defined in English - - - Step # n Finish/Exit

Algorithm and Data structure (Lecture # 3)

6)Searching: Searching means finding of an element or location of an element in a data list or data bubble. -Searching is usually performed using unique key values e.g; A student registration number of his/her makes him/her unique one. -If element to be searched found in the desired list then we say “search successful” otherwise we say search is “Unsuccessful” -Most popular search methods are: oSequential search/Linear search oBinary search (searching and sorting algorithms) 7)Sorting:
Re-arranging the elements of a data list or data bubble -The Re-arranging of Re-Ordering can be in ascending order or descending order -Most of the sorting techniques are designed by mathematical because actually sorting is a mathematical task. -Then these techniques are converted to proper computing algorithm by computer scientists. -Some popular sorting methods are direct/straight/selection sort. -Insertion sort -Quick sort -Bubble sort -Marge sort
etc. (sorting and searching algorithms) 8)Merging:

Advance Computer Networks (Lecture 02)

2. Advanced Medium Access ControlProtocols2.1 Traditional CSMA/CD 2.2 The 802.11 MAC Protocol for Wireless LANs
What is a LAN?Let collisions take place, detect them, repeat the transmission.
Whenthestationfindsthe medium idleittransmitsimmediately. When it finds the medium busy it waits for the end of the other transmission and then starts its own transmission immediately (transmission probability = 1).
Whenthestationfindsthe medium idleittransmitsimmediately. Whenthestationfindsthe medium busyitstopssensing, waits a randomexponentialback off time andthenstarts a newtransmissionattempt.
to communicate directly with each other, without connection to a wired network.The stations do not have a “forwar-ding” functionality. The IBSS only permits one-hop communication 
(1-hop ad-hoc mode). (1-hop ad-hoc mode). (1-hop ad-hoc mode).