Contacts
Community
Rechercher
IT | EN | FR | عربي | GR
Uninettuno University Logo

Corso Vittorio Emanuele II, 39 - Roma 0669207671

Contacts
Community

Ingénierie Civile et Environnementale (Academic Year 2019/2020) - Costruzioni, Estimo e Topografia

Programming



Matériel supplémentaire

Filtrer par année académique
Leçon n.1: Basic computer architecture

-
Book on the C programming language  (A.Y. 2009/2010)
Leçon n.2: Data representation - Introduction to computer and programming (part I)

Leçon n.3: Data representation - Introduction to computer and programming (part II)

Leçon n.4: Basic arithmetic

Leçon n.5: Boolean algebra

Leçon n.6: Computer architecture

Leçon n.7: From hardware to software

Leçon n.8: Introduction to programming

Leçon n.9: Elementary problem solving (parte I)

Leçon n.10: Elementary problem solving (parte II)

Leçon n.11: Programming languages & starting example

Leçon n.12: Program structure

Leçon n.13: Input/Output (Part I)

Leçon n.14: Input/Output (Part II)

Leçon n.15: Input/Output (Part III)

Leçon n.16: Conditional statements (part I)

Leçon n.17: Conditional statements (part II)Iterative Statements (part I)

Leçon n.18: Iterative Statements (part II)

Leçon n.19: Iterative Statements (part III)- Arrays (part I)

Leçon n.20: Arrays (part II)

Leçon n.21: Arrays (part III) Sorting algorithms (part I)

Leçon n.22: Sorting algorithms (part II)

Leçon n.23: Functions (Part I)

Leçon n.24: Functions (Part II) Pointers (Part I)

Leçon n.25: Pointers (Part II)

Leçon n.26: Files

-
Free Book on C  (A.Y. 2009/2010)
-
What Every Computer Scientist Should Know About Floating-Point Arithmetic  (A.Y. 2009/2010)
Leçon n.27: Pointers I

Leçon n.28: Pointers II

Leçon n.29: Strings

Leçon n.30: Structures

Leçon n.31: Sorting I

Leçon n.32: Sorting II

Leçon n.33: Sorting III

Leçon n.34: Searching

Leçon n.35: 2d Arrays

Leçon n.36: Stacks I

Leçon n.37: Stacks II

Leçon n.38: Queues I

Leçon n.39: Queues II

Leçon n.40: Queues III

Leçon n.41: Linked Lists I

Leçon n.42: Linked Lists II

Leçon n.43: Linked Lists III

Leçon n.44: Stacks and Queues: Linked lists implementation I

Leçon n.45: Stacks and Queues: Linked lists implementation II

Leçon n.46: Recursion I

Leçon n.47: Recursion II

Leçon n.48: Recursion III

Leçon n.49: Recursion IV

Leçon n.50: Notions of Algorithms Complexity

Leçon n.51: Programming

Leçon n.52: Pointers II

Leçon n.53: Files