Data Structures

  • Computer Engineering |

Description

The course tackles the difference between static data type and dynamic data types. The concept of pointers & dynamic memory allocation is discussed allowing students to experience practical programming using dynamic structures.

Program

Bachelor Degree in Computer Engineering

Objectives

  • Understand the difference between static data type and dynamic data types rnUnderstand the concept of pointers & dynamic memory allocationrnAcquire practical programming experience using dynamic structuresrn

Textbook

Data will be available soon!

Course Content

content serial Description
1Week Number 1 : Introduction to Data Structures.
2Week Number 2 : Arrays.
3Week Number 3 : Pointers and dynamic memory allocation.
4Week Number 4 : Linked Lists.
5Week Number 5 : Doubly and circular Linked Lists.
6Week Number 6 : Stack.
7Week Number 7 : 7th Week Exam +Stack Applications.
8Week Number 8 : Stack applications.
9Week Number 9 : Queues.
10Week Number 10 : Trees Representation.
11Week Number 11 : Binary Search Trees.
12Week Number 12 : 12th Week Exam + Binary Search Trees.
13Week Number 13 : Hash Representation.
14Week Number 14 : Graph Algorithms.
15Week Number 15 : Graph Traversals.
16Week Number 16 : Presentation of projects and Final Exam.

Markets and Career

  • Generation, transmission, distribution and utilization of electrical power for public and private sectors to secure both continuous and emergency demands.
  • Electrical power feeding for civil and military marine and aviation utilities.
  • Electrical works in construction engineering.

Start your application

Start The your journey to your new career.