Courses

Abstract:

Introduction to algorithms, efficiency and complexity,

techniques for comparing algorithms

Data structures: linked lists, stacks and queues,

binary search trees, heaps, hash tables, graphs

Each data structure will be discussed from three aspects:

theoretical internal structure, implementations, and uses for problem-solving

The sorting problem: comparison based algorithms,

linear sorting algorithms, and comparison of sorting algorithms

The class will be taught with an emphasis on the implementation of data structures and algorithms in C.

An introductory programming course is a foundational course that introduces students to the world of software.

The course material covers all the fundamental building blocks of programming, including:

The syntactical structure of a program in C

The working environment

Basic concepts such as variables, constants, i?nput-output

Conditional and control statements, loops, arrays, and strings

F?unctions, variable types, and scope of variables

Basic algorithms, structures, pointers, arrays, and pointers

Pointer arithmetic, dynamic allocation, text files, working with bits, and bitwise operators

Practical computer exercises are provided on all the above topics to impart hands-on knowledge in using these tools.