Course Details

Course Sylabus

1.     Requirement of data structure
2.     Basic terminology and elementary data organization
3.     Data structure operations
4.     Algorithms complexity
5.     Time-space tradeoff
6.     About function
7.     Working with string
8.     Working with math
9.     Algorithm notation
10.     Control statement
11.     Variable and data type
12.     Symbol specification and complexity
13.     String processing
14.     Character data type
15.     Word processing
16.     About array
17.     Representation of array
18.     Array application
19.     Searching with array
20.     Linear search
21.     Binary search
22.     Array with matrices
23.     Addition matrices
24.     Multiplication matrices
25.     Diagonal matrices
26.     Sparse matrices
27.     Working with shorting
28.     Bubble sort
29.     Insertion sort
30.     Selection sort
31.     Marge sort
32.     Quick sort
33.     Radix sort
34.     Heap sort ( for tree only)
35.     Pointer array
36.     Representation of records in memory , parallel array
37.     About node and link list
38.     Advantages of link list
39.     Compare with array
40.     Memory management for link list
41.     Working with link list
42.     Create list
43.     Insert element
44.     Delete element
45.     View element
46.     Count element
47.     View memory position
48.     Working with tow-way list
49.     Specification
50.     Working process.
51.     About stack
52.     Stack specification
53.     Array with stack
54.     Linked representation with stack
55.     Stack algorithms
56.     Stack applications
57.     Stack insert and deletion process
58.     Arithmetic expression polish notation
59.     About queues
60.     Queues with array representation
61.     Queues execution process
62.     Front and rare specification
63.     Structure representation
64.     Insert and delete element form a stack
65.     Priority queue
66.     Working with queues application
67.     Basic of trees
68.     Tree specification to create default tree
69.     Binary tree
70.     Representing binary tree in memory
71.     Traversing tree
72.     Header nodes
73.     Binary search
74.     AVL search tree
75.     Insert tree element
76.     Delete tree element
77.     Heap a tree
78.     Forest tree specification
79.     Basic of graphs
80.     Graph theory and terminology
81.     Type of graphs
82.     Direct graphs specification
83.     Indirect graphs specification
84.     Working with spinning tree
85.     Calculate minimum cost
86.     Operations of graphs
87.     Warshall?s algorithms
88.     Finding shortest paths