Teaching plan for the course unit

(Short version)

 

Catalā English Close imatge de maquetació

 

Print

 

General information

 

Course unit name: Introduction to Computing

Course unit code: 361180

Academic year: 2021-2022

Coordinator: Fernando Orejas Valdes

Department: Faculty of Economics and Business

Credits: 6

Single program: S

 

 

Estimated learning time

Total number of hours 150

 

Face-to-face and/or online activities

60

 

-  Lecture with practical component

Face-to-face and online

 

60

Supervised project

40

Independent learning

50

 

 

Learning objectives

 

Referring to knowledge

— Acquire a good understanding of computers and informatics so as to be able to appraise their advantages and limitations.

— Understand the classic architecture of a computer, its operation and its performance parameters.

— Understand the basic notions and basic principles of algorithms.

— Identify basic algorithmic structures and simple data types.

— Know and identify the sequential path and search algorithms.

— Know the principles of procedural programming and top-down algorithm design.

— Recognize actions and functions, as basic functional elements of algorithm design.

— Understand and identify structured types of data, including vectors, tables, strings and tuples.

— Identify the basic algorithms associated with some structured types of data: search algorithms and sorting algorithms.

— Identify the fundamental concepts and a good part of the syntactic and semantic structure of a programming language, such as R.

 

Referring to abilities, skills

— Use a computer efficiently and learn how to move with ease around the Internet.

— Use basic algorithmic structures and simple data types to design simple algorithms.

— Apply, where appropriate, sequential path and search algorithms to design algorithms.

— Apply the principles of top-down algorithm design.

— Use the notions of actions and functions, as basic functional elements of algorithm design.

— Analyse and use, where appropriate, structured types of data, including vectors, tables, strings and tuples.

— Use, where appropriate, the basic algorithms associated with some structured types of data: search algorithms and sorting algorithms.

— Translate algorithm designs into a programming language, such as R.

 

 

Teaching blocks

 

1. Introduction to algorithms

1.1. Basic notions: objects, environment, states, actions, algorithms, assertions, and programs

1.2. Basic algorithm structures

1.3. Simple data types

1.4. Entry and exit instructions

2. Sequential algorithms and top-down analysis

2.1. Sequential search algorithms

2.2. Sequential Path Algorithms

2.3. Top-down analysis: subproblems, procedures and functions, parameters, parameter types

3. Parameter and algorithm builders

3.1. Basic search and path algorithms in vectors

 

 

 

 

Reading and study resources

Consulteu la disponibilitat a CERCABIB

Book

BAIXERIES, Jaume, (coord), et. al. Introducció a la Informàtica. Exercicis. Barcelona: Edicions de la Universitat de Barcelona, 2016

Catāleg UB  Enllaç

BOTELLA, Pere, (coord.). Fonaments de Programació. Col·lecció Manuals Núm. 39. Barcelona: EDIUOC, 2001

Catāleg UB  Enllaç

MATLOFF, Norman S. The Art of R programming: a tour of statistical software design. San Francisco: No Starch Press, 2011

Catāleg UB  Enllaç

Web page

Espai virtual de l’assignatura en el Campus Virtual de la UB.