+ View more
Course overview
List of Data Structures using C
- Array
- Linked List
- Stack
- Queue
- Binary Tree
- Binary Search Tree
- Heap
- Hashing
- Graph
Array
- Linear Data Structures using C
- Elements are stored in contiguous memory locations
- Can access elements randomly using index
- Stores homogeneous elements i.e, similar elements
- Syntax:
- Array declaration
- Datatype varname [size] ;
- Can also do declaration and initialization at once
- Datatype varname [] = {ele1, ele2, ele3, ele4};
Advantages
- Random access
- Easy sorting and iteration
- Replacement of multiple variables
Disadvantages
- Size is fixed
- Difficult to insert and delete
- If capacity is more and occupancy less, most of the array gets wasted
- Needs contiguous memory to get allocated
Applications
- For storing information in a linear fashion
- Suitable for applications that require frequent searching
What will i learn?
- Ability to analyse algorithms and algorithm correctness.
- Ability to describe stack,queue and linked list operation.
- Ability to have knowledge of treeand graphs concepts.
- Ability to summarise searching and sorting techniques
Prerequisition
- basic knowledge of c language
Curriculum for this course
1 Lessons
00:06:14 Hours
Section A
1 Lessons
00:06:14 Hours
-
Data Structures using C
00:06:14
Frequently asked question
Advantages of Data Structure using C
Dynamic in size
No wastage as capacity and size is always equal
Easy insertion and deletion as 1 link manipulation is required
Efficient memory allocation
Disadvantages of Data Structure using C
If the head node is lost, the linked list is lost
No random access possible
Applications of Data Structure using C
Suitable where memory is limited
Suitable for applications that require frequent insertion and deletion
+ View more
Other related courses
About instructor
Student feedback
Write a public review