Saturday 3 October 2015

Data Structure

This course is concerned with the efficient allocation and manipulation of data. In general, the information you find here is applied to computers, but often it applies to real life, as well. As an example, we will learn sorting algorithms in this course, and while people understand these algorithms, when it comes to something like sorting a stack of examination papers, they will resort to exceptionally inefficient algorithms.
The two basic forms of storing information on a computer: contiguous and node based. Arrays and linked lists represent prototypical examples of each, respectively. We will then see other data structures such as trees, hybrids, and higher-dimensional arrays.

For Download Sample Paper Click Here 

For Full reading with Q & A  click here

No comments:

Post a Comment