Universitat Internacional de Catalunya
Hours to be agreed with the student body contact via email
This course will provide you with the skills and knowledge to start creating and developing applications with this versatile and powerful programming language.
Python was conceived in the late 1980s as a language to be interpreted for teaching purposes. Over time, Python has established itself for its simplicity and readability, making it a great choice for both beginners and programming experts. With Python, you can develop web applications, automate tasks, analyze data, and even build artificial intelligence.
The creator of the language was the Dutch computer scientist Guido van Rossum, known for many years under the title of BDFL (Benevolent Dictator for Life). This was because Guido was assigned the task of setting the guidelines for the evolution of Python, which task he retired in 2018. The name Python comes from his love of the BBC show Monty Python's Flying Circus, from the famous British comedy group Monty python.
Since the subject is an introductory one, it will be assumed that you do not have any prior knowledge on the subject. It is the responsibility of the subject itself to provide students with a means to acquire the knowledge described in the subject content section.
Despite this, it is advisable to have user-level knowledge of some type of platform (windows, mac or linux)
This subject has a general and introductory nature to programming. The study of the methodological aspects of programming and the learning of a high-level language will be deepened. Therefore, the general objectives that are proposed for the subject are the following:
Upon completion of this course, students will be able to:
• Recognize the basic principles of operating systems, software engineering and architecture, algorithms and programming, as well as the most commonly used development methodologies.
• Program basic algorithms that solve common types of engineering problems.
• Identify the basic concepts of algorithmic complexity.
• Identify the basic concepts of relational and non-relational (NoSQL) databases.
• Use graphical expression and computer-aided drawing applications.
• Demonstrate manual skill in sketching and drawing freehand.
• Report completed work in correctly formatted and universally interpretable drawings.
Lesson 1: Troubleshooting: introduction to algorithmics and programming.
Introduction to problem solving. Algorithm concept. Phases in the development of algorithms. Programming as an engineering discipline. Software life cycle. Basic elements of an algorithm. Tools for the representation of algorithms. Programming languages. Classification. Language translators: compilers and interpreters.
Lesson 2: Basic concepts and control structures
Definition of variables and constants. Fundamental data type. Sequential structure. Selection or conditional structures. Iterative or repetitive structures.
Lesson 3: Subprograms
The concept of the subprogram as an abstraction of operations. Locality, specifically, scope and visibility. Definition of functions and procedures. Calls to functions and procedures. Drop-down modular design.
Lesson 4: Files
Basic definitions. Input / output of data in files. Type of file access.
Lesson 5: Advanced data types
Lists, tuples and sets. Dictionaries.
In the development of the subject will follow a practical methodology. This means that students will have to solve a wide set of problems.
The following evaluable activities are carried out:
|
Activity |
Date |
Recovery |
Block Percentage |
Minimum grade |
|
Individual Partial Theoretical Exam (Tp) |
Consult Planning |
NO |
15% |
No |
|
Individual Final Theoretical Exam (TF) |
10/1/2024 |
18/07/2024 |
35% |
Tf> = 5 |
|
Individual Problem Solving (P) |
Every week |
No |
25% |
No |
|
Group Laboratory Practice (PLG) |
Consult Planning |
Consult Planning |
25% |
PLG> = 5 |
The grade of each end of the subject is the weighted sum of the evaluation activities with their corresponding percentage. The result of the weighted sum must be> = 5 for considering the subject approved.
Scheduling of evaluation activities
The dates of evaluation and delivery of works will be published in the virtual campus and may be subject to programming changes for reasons of adaptation to possible incidents. The document manager will always be informed about these changes since it is understood that this is the usual platform for the exchange of information between teachers and students.
Recovery procedure
The student can present to the recovery provided that he has presented to a set of activities that represents at least two thirds of the total grade of the subject.
The partial exam (Tp) will be recovered by passing the final exam (Tf)
In the event that the final exam (Tf) obtains a grade
The Individual Problem Solving (P) activity cannot be retrieved.
Procedure for reviewing qualifications
Students will have the right to review the theoretical exams (Tp and Tf). The place, date and time of revision will be published on the day the notes are published. If the student does not appear in this review, this activity will not be reviewed later. Only in justified cases may a review be made a posteriori of the fixed date and always up to a maximum of 7 calendar days.
Of the notes of the laboratory practice (PLG and PLI) no review will be carried out so that the evaluation is carried out before the students.
Ratings
Non-Evaluable (NA): Any student who submits a practice or a scheduled evaluation will have a grade. It will only be considered non-assessable in the case of not delivering any assessable activity.
Final Note: S le of the weighted sum according to the criteria set out in the section on evaluation activities. If in any activity the minimum grade is not reached, the grade will come out of the following formula:
Minimum (apply weighted sum and 4.5)
Honours
Awarding an honours qualification is the decision of the teaching staff responsible for the subject. Following the UIC regulations in this matter In the event that more than one student obtains the same grade, it will be prioritized according to the following rules (in order):
Irregularities on the part of the student, copying and plagiarism
Without prejudice to other disciplinary measures they deem appropriate, irregularities committed by the student that may lead to a variation of the grade of an evaluation act will be graded with a zero. Therefore, copying, plagiarism, cheating, letting copy, etc. in any of the evaluation activities will involve suspending with a zero. Evaluation activities qualified in this way and by this procedure will not be recoverable. If it is necessary to pass any of these evaluation activities to pass the subject, this subject will be suspended directly, without the opportunity to recover it in the same course. In this case, the numerical grade of the file will be the lowest value between 3.0 and the weighted average of the marks.
Important considerations
Mere possession, even if the device is turned off, will be considered an attempt to cheat.
J. Guttag. Introduction to Computation and Programming Using Python: With Application to Understanding Data Second Edition. MIT Press. ISBN-10: 9780262529624
S. Chazallet Python 3. Los fundamentos del lenguaje. Eni, ISBN-10: 2409006140
E. Matthes. Python Crash Course: A Hands-On, Project-Based Introduction to Programming. No Starch Press ISBN-10: 1593276036
M. Myers. A Smarter Way to Learn Python: Learn it faster. Remember it longer. Createspace Independent Pub ISBN-10: 1974431479
A. Prieto, A. Lloris, J.C. Torres. Introducción a la Informática. Mc Graw-Hill ISBN-10: 8448146247
A. Prieto, B. Prieto. Conceptos de Informática. Mc Graw-Hill, Schaum ISBN-10: 8448198573
L. Joyanes Aguilar. Fundamentos de Programación: Algoritmos, Estructuras de Datos y Objetos. Mc. Graw-Hill. ISBN-10:8448161114