Toll Free 1800 572 9282 
mailus@wbcsmadeeasy.in
Data Structure – Computer Science Notes – For W.B.C.S. Examination.
তথ্য কাঠামো – কম্পিউটার সায়েন্স নোটস – WBCS পরীক্ষা।
Data Structure is a way of collecting and organising data in such a way that we can perform operations on these data in an effective way. Data Structures is about rendering data elements in terms of some relationship, for better organization and storage.Continue Reading Data Structure – Computer Science Notes – For W.B.C.S. Examination.
As we have discussed above, anything that can store data can be called as a data structure, hence Integer, Float, Boolean, Char etc, all are data structures. They are known as Primitive Data Structures.
Then we also have some complex Data Structures, which are used to store large and connected data. Some example of Abstract Data Structure are :
- Linked List
- Tree
- Graph
- Stack, Queue etc.
All these data structures allow us to perform different operations on data. We select these data structures based on which type of operation is required. We will look into these data structures in more details in our later lessons.
The data structures can also be classified on the basis of the following characteristics:
| Characterstic | Description |
|---|---|
| Linear | In Linear data structures,the data items are arranged in a linear sequence. Example: Array |
| Non-Linear | In Non-Linear data structures,the data items are not in sequence. Example: Tree, Graph |
| Homogeneous | In homogeneous data structures,all the elements are of same type. Example: Array |
| Non-Homogeneous | In Non-Homogeneous data structure, the elements may or may not be of the same type. Example: Structures |
| Static | Static data structures are those whose sizes and structures associated memory locations are fixed, at compile time. Example: Array |
| Dynamic | Dynamic structures are those which expands or shrinks depending upon the program need and its execution. Also, their associated memory locations changes. Example: Linked List created using pointers |
An algorithm is a finite set of instructions or logic, written in order, to accomplish a certain predefined task. Algorithm is not the complete code or program, it is just the core logic(solution) of a problem, which can be expressed either as an informal high level description as pseudocode or using a flowchart.
Every Algorithm must satisfy the following properties:
- Input– There should be 0 or more inputs supplied externally to the algorithm.
- Output– There should be atleast 1 output obtained.
- Definiteness– Every step of the algorithm should be clear and well defined.
- Finiteness– The algorithm should have finite number of steps.
Please subscribe here to get all future updates on this post/page/category/website
