# Management Engineering (Academic Year 2020/2021) - Production path

## Books and articles

 Lesson n.1: Basic computer architecture n. 1.1 - Book on the C programming language   (A.Y. 2009/2010) Lesson n.2: Data representation - Introduction to computer and programming (part I) Lesson n.3: Data representation - Introduction to computer and programming (part II) Lesson n.4: Basic arithmetic Lesson n.5: Boolean algebra Lesson n.6: Computer architecture Lesson n.7: From hardware to software Lesson n.8: Introduction to programming Lesson n.9: Elementary problem solving (parte I) Lesson n.10: Elementary problem solving (parte II) Lesson n.11: Programming languages & starting example Lesson n.12: Program structure Lesson n.13: Input/Output (Part I) Lesson n.14: Input/Output (Part II) Lesson n.15: Input/Output (Part III) Lesson n.16: Conditional statements (part I) Lesson n.17: Conditional statements (part II)Iterative Statements (part I) Lesson n.18: Iterative Statements (part II) Lesson n.19: Iterative Statements (part III)- Arrays (part I) Lesson n.20: Arrays (part II) Lesson n.21: Arrays (part III) Sorting algorithms (part I) Lesson n.22: Sorting algorithms (part II) Lesson n.23: Functions (Part I) Lesson n.24: Functions (Part II) Pointers (Part I) Lesson n.25: Pointers (Part II) Lesson n.26: Files n. 26.1 - Free Book on C   (A.Y. 2009/2010) n. 26.2 - What Every Computer Scientist Should Know About Floating-Point Arithmetic   (A.Y. 2009/2010) Lesson n.27: Pointers I Lesson n.28: Pointers II Lesson n.29: Strings Lesson n.30: Structures Lesson n.31: Sorting I Lesson n.32: Sorting II Lesson n.33: Sorting III Lesson n.34: Searching Lesson n.35: 2d Arrays Lesson n.36: Stacks I Lesson n.37: Stacks II Lesson n.38: Queues I Lesson n.39: Queues II Lesson n.40: Queues III Lesson n.41: Linked Lists I Lesson n.42: Linked Lists II Lesson n.43: Linked Lists III Lesson n.44: Stacks and Queues: Linked lists implementation I Lesson n.45: Stacks and Queues: Linked lists implementation II Lesson n.46: Recursion I Lesson n.47: Recursion II Lesson n.48: Recursion III Lesson n.49: Recursion IV Lesson n.50: Notions of Algorithms Complexity Lesson n.51: Programming Lesson n.52: Pointers II Lesson n.53: Files

Corso Vittorio Emanuele II, 39
00186 Roma - ITALIA
Tax code number: 97394340588
P.IVA: 13937651001

### Certified mail

info@pec.uninettunouniversity.net

### Student Secretariat

tel: +39 06 692076.70
tel: +39 06 692076.71
e-mail: info@uninettunouniversity.net

### Videoconferencing

Library 1st floor: 90.147.90.157
Meeting Room 5th floor: 90.147.90.158