Management Engineering (Academic Year 2012/2013) - Economics path

Programming

Credits: 9

Content language:English

Course description

The module starts with the basic aspects of computer engineering, i.e., architectures, programming and simple algorithms. Programming is seen as a problem-solving approach, starting from the understanding and upgrading of existing programs. Basic programming notions are introduced, such as abstraction, abstract data types, control structures.

Prerequisites

Basic notions on mathematical functions, relations and set theory.

Objectives

The initial main goal of this corse is to provide the student with the fundamentals on computer architecture and to introduce the C. Programming skills are then seen as a way to solve problems of increasing complexity focusing on the designer’s ability of the students. Notions related to the dynamic memory structures, abstract data types, and recursive programming are introduced.

Program

Data representation. Boolean algebra, logic functions, basic notions on computer architecture
Problem solving and algorithms: problem definition, decomposition, data and control flow, variables, constants, expressions, flow charts, elementary debugging strategies
Fundamental programming statements in C
Syntax and semantics of C
Variables, types and assignments
Iterative and conditional statements
Basic I/O
Functions and parameter passing
Data structures: scalars, arrays and structure
files, strings, structures, dynamic memory allocation
Simple problem solving: quadratic sorting algorithms, linear and binary search, merge of arrays, dynamic manipulation of one-dimensional arrays, dynamic manipulation of two-dimensional arrays, queues and stacks on static and dynamic array structures.
Recursion basics: recursion tree, termination condition. Simple recursive problem solving: factorial computation, Fibonacci’s numbers, binary search, merge sort, the 8-queens problem.
Basic dynamic data structures: lists, queues, stacks
Basic notions of algorithms’ complexity

Book

Kim N. King: C a Modern approach, 2nd edition
Deitel & Deitel: – C How to program, 5th edition.

Exercises

The most part of the lessons are accompanied with some exercises to have the student apply what has learned from the videolesson.

Professor/Tutor responsible for teaching

Professor not available

Video professors

Prof. Paolo Enrico Camurati - Politecnico di Torino (Torino - Italy)

Prof. Farouk Al Omari - Yarmouk University (Irbid City - Jordan)

Prof. Aliaa Youssif -

List of lessons

• Lesson n. 1: Basic computer architecture		Paolo Enrico Camurati
• Lesson n. 2: Data representation - Introduction to computer and programming (part I)		Paolo Enrico Camurati
• Lesson n. 3: Data representation - Introduction to computer and programming (part II)		Paolo Enrico Camurati
• Lesson n. 4: Basic arithmetic		Paolo Enrico Camurati
• Lesson n. 5: Boolean algebra		Paolo Enrico Camurati
• Lesson n. 6: Computer architecture		Paolo Enrico Camurati
• Lesson n. 7: From hardware to software		Paolo Enrico Camurati
• Lesson n. 8: Introduction to programming		Paolo Enrico Camurati
• Lesson n. 9: Elementary problem solving (parte I)		Paolo Enrico Camurati
• Lesson n. 10: Elementary problem solving (parte II)		Paolo Enrico Camurati
• Lesson n. 11: Programming languages & starting example		Paolo Enrico Camurati
• Lesson n. 12: Program structure		Paolo Enrico Camurati
• Lesson n. 13: Input/Output (Part I)		Paolo Enrico Camurati
• Lesson n. 14: Input/Output (Part II)		Paolo Enrico Camurati
• Lesson n. 15: Input/Output (Part III)		Paolo Enrico Camurati
• Lesson n. 16: Conditional statements (part I)		Paolo Enrico Camurati
• Lesson n. 17: Conditional statements (part II)Iterative Statements (part I)		Paolo Enrico Camurati
• Lesson n. 18: Iterative Statements (part II)		Paolo Enrico Camurati
• Lesson n. 19: Iterative Statements (part III)- Arrays (part I)		Paolo Enrico Camurati
• Lesson n. 20: Arrays (part II)		Paolo Enrico Camurati
• Lesson n. 21: Arrays (part III) Sorting algorithms (part I)		Paolo Enrico Camurati
• Lesson n. 22: Sorting algorithms (part II)		Paolo Enrico Camurati
• Lesson n. 23: Functions (Part I)		Paolo Enrico Camurati
• Lesson n. 24: Functions (Part II) Pointers (Part I)		Paolo Enrico Camurati
• Lesson n. 25: Pointers (Part II)		Paolo Enrico Camurati
• Lesson n. 26: Files		Farouk Al Omari
• Lesson n. 27: Pointers I		Farouk Al Omari
• Lesson n. 28: Pointers II		Farouk Al Omari
• Lesson n. 29: Strings		Farouk Al Omari
• Lesson n. 30: Structures		Farouk Al Omari
• Lesson n. 31: Sorting I		Farouk Al Omari
• Lesson n. 32: Sorting II		Farouk Al Omari
• Lesson n. 33: Sorting III		Farouk Al Omari
• Lesson n. 34: Searching		Farouk Al Omari
• Lesson n. 35: 2d Arrays		Farouk Al Omari
• Lesson n. 36: Stacks I		Farouk Al Omari
• Lesson n. 37: Stacks II		Farouk Al Omari
• Lesson n. 38: Queues I		Farouk Al Omari
• Lesson n. 39: Queues II		Farouk Al Omari
• Lesson n. 40: Queues III		Farouk Al Omari
• Lesson n. 41: Linked Lists I		Farouk Al Omari
• Lesson n. 42: Linked Lists II		Farouk Al Omari
• Lesson n. 43: Linked Lists III		Farouk Al Omari
• Lesson n. 44: Stacks and Queues: Linked lists implementation I		Farouk Al Omari
• Lesson n. 45: Stacks and Queues: Linked lists implementation II		Farouk Al Omari
• Lesson n. 46: Recursion I		Farouk Al Omari
• Lesson n. 47: Recursion II		Farouk Al Omari
• Lesson n. 48: Recursion III		Farouk Al Omari
• Lesson n. 49: Recursion IV		Farouk Al Omari
• Lesson n. 50: Notions of Algorithms Complexity		Farouk Al Omari
• Lesson n. 51: Programming		Aliaa Youssif
• Lesson n. 52: Pointers II		Aliaa Youssif
• Lesson n. 53: Files		Aliaa Youssif

Please login

Please login

Menu secondario

Management Engineering (Academic Year 2012/2013) - Economics path

Programming