Algorithms and Data Structure 1

Algorithms and Data Structure 1 SB

Academic Staff of Course

Teacher of the Lecture: BENSACI Ramla, BENCHABANA Ayoub

Email: bensaci.ramla@univ-ouargla.dz

Email: benchabana.ayoub@univ-ouargla.dz

Target Audience

First-year computer science students at LMD Section B

Coefficient: 5    Credit: 7

Weekly Hourly Volume

7.5 hours (3h Lecture + 1.5h Tutorials + 3h Lab Work) + 3 hours for personal work

Tutorial Mark

Marked Participation (8 pts) + Assessment 1 (6 pts) + Assessment 2 (6 pts)

Lab Work Mark

Participation (12 pts) + Assessment 1 (8 pts)

Final Assessment Method

/20 = Continuous ((Tutorial Mark + Lab Work Mark) / 2) * 0.4 + Exam * 0.6

Course Outline

  • Chapter 1: Introduction
  • Chapter 2: Simple Sequential Algorithm
  • Chapter 3: Conditional Structures
  • Chapter 4: Repetitive Structures (Loops)
  • Chapter 5: Arrays and Strings
  • Chapter 6: Custom Types

Algorithms and Data Structure 1 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  7.5 hours ( 3h 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: Introduction
Chapter 2: Simple Sequential Algorithm
Chapter 3: Conditional structures 
Chapter 4: Repetitive Structures (Loops)
Chapter 5: Arrays and Strings
Chapter 6: Custom types