Scribd
Upload
9 views15 pages

ING ADS1 Course Presentation

The document outlines the course 'Algorithms and Static Data Structures' (ADS1) taught by Dr. Anfel Selmadji at the University of Abdelhamid Mehri – Constantine 2 for the academic year 2024-2025. It details the course objectives, which include understanding algorithmic concepts, developing problem-solving skills, and using static data structures effectively. The course content covers basic algorithmic elements, modularity, and specific static data structures, with an emphasis on programming skills and systematic problem-solving approaches.

Uploaded by

Mennech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views15 pages

ING ADS1 Course Presentation

The document outlines the course 'Algorithms and Static Data Structures' (ADS1) taught by Dr. Anfel Selmadji at the University of Abdelhamid Mehri – Constantine 2 for the academic year 2024-2025. It details the course objectives, which include understanding algorithmic concepts, developing problem-solving skills, and using static data structures effectively. The course content covers basic algorithmic elements, modularity, and specific static data structures, with an emphasis on programming skills and systematic problem-solving approaches.

Uploaded by

Mennech
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 15

Algorithms and Static Data Structures (ADS1)

Dr. Anfel Selmadji

University of Abdelhamid Mehri – Constantine 2

2024-2025
What are algorithms and data
structures ?

Dr. Anfel Selmadji Basic elements 1 / 13


Algorithms and data structures

Computer science : automatic processing of information.

Data structure : effcient method to store and organize information.

Automatic processing performed by a computer according to a set


of steps provided by a human being.These steps represent an algo-
rithm.

Note
Two courses over two semesters :
ADS1 : Algorithms and Static Data Structures
ADS2 : Algorithms and Dynamic Data Structures

Dr. Anfel Selmadji Basic elements 2 / 13


Course objectives

Dr. Anfel Selmadji Basic elements 3 / 13


Course objectives (1/3)

The main skill targeted by the course ASD1 is being able to


design and build software using static data structures.

Dr. Anfel Selmadji Basic elements 4 / 13


Course objectives (1/3)

The main skill targeted by the course ASD1 is being able to


design and build software using static data structures.

Dr. Anfel Selmadji Basic elements 4 / 13


Course objectives (2/3)

More precisely, at the end of this course, you will be able to :

In terms of knowledge
Understand the basic elements of algorithmic.
Comprehend the fundamental concepts of algorithmic formalism, in-
cluding the structure of an algorithm, basic actions, and control struc-
tures.
Comprehend the concept of modularity.
Gain knowledge about static data structures.

Dr. Anfel Selmadji Basic elements 5 / 13


Course objectives (3/3)

In terms of know-how
Develop the ability to analyze a problem and write down the algorithm
for solving it.
Practice modular thinking in algorithm design by breaking down a
problem into smaller and manageable parts.
Use static data structures to solve specific problems effectively (choo-
sing the right one for the addressed problem).
Learn programming skills, including the basics of coding and algo-
rithm implementation.

In terms of soft skills


Adopt a systematic and structured approach to problem-solving.
Become a proficient programmer.

Dr. Anfel Selmadji Basic elements 6 / 13


Dr. Anfel Selmadji Basic elements 7 / 13
Course content

Dr. Anfel Selmadji Basic elements 8 / 13


Detailed content (1/2)

1 Basic elements (2 sessions)


Algorithm, processor, action
Programs and programming languages (from problem to result)

2 Introduction to algorithmic formalism (4 sessions)


The need for algorithmic formalism
Presentation of the adopted algorithmic formalism
Structure of an algorithm
Environment – elementary objects
Body of the algorithm : basic actions and control structures

3 Basic elements of the C programming language

Dr. Anfel Selmadji Basic elements 9 / 13


Detailed content (2/2)
1 Modularity (8 sessions)
Fundamental concepts and benefits of modularity
Types of modules
Communication mechanisms
Parameter passing
Functions
Procedures
Internal modules and external modules
Local objects and global objects
Modular approach and formalism
Library concept (applied to the C programming language)

2 Static Data Structures (3 sessions)


One-dimensional arrays
Sorts
Two-dimensional arrays
Strings
Sets
Records
Dr. Anfel Selmadji Basic elements 10 / 13
Evaluation method

Dr. Anfel Selmadji Basic elements 11 / 13


Evaluation method

Dr. Anfel Selmadji Basic elements 12 / 13


Keep in mind

Dr. Anfel Selmadji Basic elements 13 / 13

You might also like