Featured Programs
Experiential Learning Opportunities
Claim up to $1,000 in flight credits!
Get up to $1,000 in flight credits or grants toward study or internship programs abroad when you apply by January 01, 2025. See our Official Rules for full details.
Systems Programming
Engineering & Social Sciences Program
Madrid, Spain
Dates: mid Jan 2026 - early Jun 2026
Systems Programming
OVERVIEW
CEA CAPA Partner Institution: Universidad Carlos III de Madrid
Location: Madrid, Spain
Primary Subject Area: Computer Engineering
Instruction in: English
Course Code: 13494
Transcript Source: Partner Institution
Course Details: Level 100
Recommended Semester Credits: 3
Contact Hours: 42
Prerequisites: Programming (1st course, 1st semester)
DESCRIPTION
The syllabus of this module is divided into five modules:
1. Object Based programming
1.1. Definitions: Classes and objects
1.2. Composition of classes
1.3. Constructors
1.4. Shadowing
1.5. Modifiers
2. Object Oriented Programming
2.1. Inheritance
2.2. Overwriting and overloading
2.3. Casting
2.4. Abstract classes and interfaces
2.5. Multiple inheritance and polymorphism
3. Recursion
3.1. Definitions
3.2. Types (linear, non linear, mutua)
3.3. Recursion vs. iteration
3.4. Implementation and execution examples
4. Data structures, algorithms and implementation samples
4.1 Linked Lists and Double Linked Lists.
4.2 Stacks
4.3 Queues (simple, double and priority queues)
4.4 Tress (n-ary tress, binary trees, binary search trees)
1. Object Based programming
1.1. Definitions: Classes and objects
1.2. Composition of classes
1.3. Constructors
1.4. Shadowing
1.5. Modifiers
2. Object Oriented Programming
2.1. Inheritance
2.2. Overwriting and overloading
2.3. Casting
2.4. Abstract classes and interfaces
2.5. Multiple inheritance and polymorphism
3. Recursion
3.1. Definitions
3.2. Types (linear, non linear, mutua)
3.3. Recursion vs. iteration
3.4. Implementation and execution examples
4. Data structures, algorithms and implementation samples
4.1 Linked Lists and Double Linked Lists.
4.2 Stacks
4.3 Queues (simple, double and priority queues)
4.4 Tress (n-ary tress, binary trees, binary search trees)