Algorithms and Data Structure 2

Algorithms and Data Structure 2 SA

Academic Staff Of Course

Teacher of the lecture: BENCHABANA Ayoub, BENSACI Ramla 

benchabana.ayoub@univ-ouargla.dz 

bensaci.ramla@univ-ouargla.dz 

Target audience

First-year computer science students at LMD 

Coefficient   5            Credit    7

weekly  Hourly Volume  6 hours ( 1.5h Lecture+ 1,5 Tutorials+ 3h work lab)+3 hours for personal work

Tutorial Mark= Marked Participation(8pts) +  Assessment1(6pts) +  Assessment2(6pts)

Lab work Mark= Participation(12 pts)+   Assessment1(8pts)

Final Assessment Method/20 = Continuous ((Tutorial Mark + Work lab mark)/2 ) *0.4+  Exam*0.6

Course Outline

Chapter 1: Functions and Subprograms
Chapter 2: Files
Chapter 3: Linked Lists - Course Materials 
 

prerequisites 

To successfully follow this course, students are expected to have:

  • A solid understanding of the fundamentals of the C programming language (data types, control structures, arrays, functions).

  • Basic knowledge of algorithmic thinking and problem-solving techniques.

  • Familiarity with concepts from ADS1, including simple data structures and iterative algorithms.

These prerequisites ensure that learners are prepared to approach advanced topics such as recursion, file handling, and dynamic memory management.