- Milena Tsvetkova, Office hours: Fridays 15:00–17:00, CON.2.11 or Zoom
- Daniel De Kadt, Office hours: TBD, CON.2.13 or Zoom
- Yuanmo He, Office hours: Thursdays 15:00-17:00, CON.1.07G or Zoom
- Sia Shahrizad (GTA)
-
Lectures take place on:
- Mondays 13:00–15:00 in CKK.2.04
-
Seminars take place on:
- Tuesdays 10:00–11:30 in CKK.1.09
- Tuesdays 11:30–13:00 in CKK.1.09
- Tuesdays 15:00–16:30 in CBG.2.02
- Tuesdays 16:30–18:00 in CBG.2.02
No lecture or classes will take place during School Reading Week 6.
This course introduces students to the fundamentals of computer programming as students design, write, and debug computer programs using the programming language Python. The course will also cover the foundations of computer languages, algorithms, functions, variables, object orientation, scoping, and assignment. The course will rely on practical examples from computational social science and social data science.
This course is an introduction to the fundamental concepts of programming for students who lack a formal background in the field, but will include more advanced problem-solving skills in the later stages of the course. Topics include algorithm design and program development; data types; control structures; functions and parameter passing; recursion; searching and sorting; and an introduction to the principles of object-oriented programming.
This is an introductory class and no prior experience with programming is required.
The course will use Python. We will use the Anaconda distribution to install Python and manage packages and Visual Studio Code to write code. We will further use RStudio to write code in R. Lectures and assignments will be posted on GitHub. Students are expected to use GitHub also to submit problem sets and final exam.
The main course texts will be:
- Guttag, John V. Introduction to Computation and Programming Using Python: With Application to Understanding Data. MIT Press, 2016.
- Miller, Bradley N. and David L. Ranum. Problem Solving with Algorithms and Data Structures Using Python.
- Grolemund, Garrett and Hadley Wickham. R for Data Science. O’Reilly, 2016.
Additional resources include:
- Intermediate and advanced Python documentation
- Python Wikibook
- Matthes, Eric. Python Crash Course Cheat Sheet.
Take home exam (50%) and in-term assessment (50%). Students will be expected to produce six weekly problem sets in AT. The first problem set is formative. The remaining five problem sets will be marked, and will provide 50% of the mark.
The formative and first four summative problem sets will be distributed by Monday evening and due at 12:00 noon the following Monday. The last problem set will be completed in class.
The take home exam will be distributed on Monday, December 9, 2024 and due at 12:00 noon on Monday, January 20, 2025.
Doctoral students registered for MY570 will be required to complete a substantive project of their own choice in place of the take home exam. You will be required to develop Python software that addresses a sufficiently complex computational social science task. Examples of possible projects include a software package that collects and analyses online data, an experimental game, or an agent-based model. The project should be approved by the instructors, so please get in touch with us well in advance.
Please note that the deadlines are final. Late submissions for the weekly problem sets will automatically receive score 0, except in the case of an extension requested in advance for valid documented legal or medical reasons. Late submissions for the final take home exam will be penalized according to LSE's standard assessment rules. More information can be found here.
Your code will be evaluated both on whether it completes the task and on the extent to which it is written using the concepts, paradigms, and best practices covered in the course, most notably, legibility, modularity, and optimization.
| Mark | Criteria |
|---|---|
| Pass (50-59) | The code runs and does what it is expected to |
| Merit (60-69) | The code runs, does what it is expected to, and is modular and legible |
| Distinction (70-100) | The code runs, does what it is expected to, and is modular, legible, and optimized |
Weekly assignments and the final take home exam are individual unless we instruct you otherwise. For all summative assessment, you need to write the code entirely by yourself (or together with your partner if you have been assigned one).
You are NOT ALLOWED to:
- Talk about solutions to the assignments with others
- Show your solutions to other students
- View and copy code from other students (current or past)
- View and copy example solutions that may have leaked
- Ask friends, family, or roommates for help with assignments
- Use Generative AI tools such as ChatGPT and Copilot to solve the assignments
- Post questions related to the assignments on Q&A sites such as Stack Overflow
You may:
- Use general online resources such as Stack Overflow or Python documentation for general queries (e.g. "how to unpack a tuple"). However, if you borrow substantive blocks of code or specific solutions from online forums or blogs, you need to cite your source in the comments.
- Use the forum "Clarifying Questions about Assignments" on the course Moodle site to ask and answer questions about the instructions in the assignments.
Violation of the plagiarism policy for the course will be dealt with in accordance with the LSE Regulations on Assessment Offences.
Questions about the content:
- Ask during the lecture sessions or your seminar
- Schedule office hours with Milena, Daniel, or Yuanmo
Questions about the upcoming assignment:
- Post a question on the Moodle forum "Clarifying questions about assignments" (no code allowed!)
Questions about your marked assignment:
- See the example answers to help you understand the comments
- Schedule office hours with Milena, Daniel, or Yuanmo
Personal emergencies (e.g. cannot access assignment, cannot meet a deadline):
- E-mail Milena
In the first week, we will introduce the basic concepts in computer programming: computers, algorithms, programming languages, and programs. We will then discuss the elements of programming languages: primitive constructs, syntax, static semantics, and semantics. We will further introduce the essential primitives for all programming languages: data types, operators, expressions, variables and values.
- Course information
- Readings
- Guttag. Chapters 1-2.1, pp.1–15.
- Wing, Jeannette M. (2006). Computational thinking. Communications of the ACM, 49(3), 33–35.
- Lecture
- Lab
- Installing Python with Anaconda
- Introduction to Jupyter notebooks and Visual Studio Code
- Submitting assignments on GitHub
In the next five weeks of the course, we will use Python to get familiar with the elements of programming languages. We will begin with scalar data types, operators, expressions, and value assignment to variables. We will also cover non-scalar, also known as compound or structured, data types (lists, tuples, sets, and dictionaries) and discuss the difference between mutable and immutable and ordered and unordered types. As lists are very commonly used, we will further overview the most common list operations, including indexing, slicing, appending, splitting, aliasing, and cloning.
- Readings
- Guttag. Chapters 2.3, 5.1-5.3, 5.5-5.6, pp.18–21, 65–73, 77–84.
- Lecture
- Lab
- Working with strings and lists in Python
- Programming with simple statements, including
print(),len(),append(),extend(),pop(),remove(),split(),join(),sort(), andsorted()
Control flow defines the order in which statements are evaluated and executed in a program. In Python, indentation plays a crucial role in determining the control flow. In this week, we will discuss branching and iteration and how to write these in Python using if-else statements, while loops, for loops, range(), break, and continue. We will also introduce the extremely useful concept of list comprehensions. To exemplify the use of conditional statements and iteration, we will go over several simple numerical search and approximation algorithms.
- Readings
- Guttag. Chapters 2.2, 2.4–3, pp.15–18, 22–38.
- Lecture
- Lab
- For loops and list comprehensions in Python
- Control flow best practices and pitfalls
- Nested dictionary and list comprehensions
Good programmers are not measured by the amount of code they write but by the amount of functionality in their code. Good programming relies on abstraction and decomposition. Decomposition creates structure while abstraction helps hide details. Decomposition and abstraction can be achieved with functions and classes and in this week, we will introduce functions. We will discuss function arguments and variable scope and by means of an example, we will introduce the concept of recursion.
- Readings
- Guttag. Chapter 4, pp.39–63.
- Lecture
- Lab
- Writing and calling functions in Python
- Function specifications
- What are functions good for?
Object-oriented programming is a programming paradigm that helps increase modularity, reduce complexity, and foster code reuse. Objects are a data abstraction consisting of (1) an internal representation i.e. object attributes and (2) an interface for interacting with the objects through methods and functions. Objects are instances of classes and classes determine the type of an object. In this week, we will discuss how to define classes in Python and how to create instances of a class. We will also touch upon class inheritance and hierarchies, as well as generators.
- Readings
- Guttag. Chapter 8, pp.109–134.
- Lecture
- Lab
- Programming in teams
- Using GitHub as a collaboration tool
Writing computer programs is easy but making them work properly is hard. We test programs to check if they work as intended and we debug them when we find out that they don’t. In this lecture, we will discuss different ways to test and debug programs. We will cover common error messages and how to catch them with try, except, raise, and assert. We will also introduce GitHub Copilot as a useful tool for writing code.
- Readings
- Guttag. Chapters 6–7, pp.85–108.
- Lecture
- Lab
- Unit testing in Python
- Using .py files to structure programs and conduct testing
- Defensive programming with
try,except, andassert
This week, we will review many concepts studied until now by learning how they are implemented in the R programming language. After a general introduction to R, we will discuss basic data structures. We will then continue with the control flow, a discussion of functions in R, and reading in data and plotting. We will conclude the lecture with an outlook on tools which are currently used in a typical data science workflow with R.
- Readings
- Venables, W. N. et. al. 2017. An Introduction to R. Chapters 1-6, 9-10.
- The Introduction to R handout.
- (optional, but recommended) Zuur, A., Ieno, E. N., & Meesters, E. (2009). A Beginner's Guide to R. Springer Science & Business Media.
- (optional) Patrick Burns. 2011. The R Inferno. http://www.burns-stat.com/pages/Tutor/R_inferno.pdf
- Lecture
- Lab
- Translating Python code into R
Algorithms are recipes that consist of a sequence of simple steps, control flow, and stopping rule. To evaluate the scalability of algorithms and to compare their efficiency, we use the abstraction “order of growth”. Order of growth expresses how the maximum amount of time needed grows as the size of the input grows. We will discuss different complexity classes and ways to analyze the complexity of programs.
- Readings
- Guttag. Chapter 9, pp.135–149.
- Bradley and Ranum. Chapter 2.
- Lecture
- Lab
- Reading programs written in Python and R and evaluating their time complexity
We will use the concepts and approaches introduced in the previous lecture to look at the complexity of several classic algorithms on searching and sorting. The goal is to get a better intuition of how to approach problems of efficiency. We will use examples written in both Python and R.
- Readings
- Guttag. Chapter 10.1–10.2, pp.151–164.
- Bradley and Ranum. Chapter 5.
- Lecture
- Lab
- Functional programming in Python with
lambda,filter,mapandreduce
- Functional programming in Python with
We will continue getting a better understanding of abstract data types and computational complexity by covering stacks, queues, trees, graphs, and algorithms for graphs. The lecture will end with an overview of what we have learned in the course and possible steps you can take to further develop your programming skills.
- Readings
- Bradley and Ranum. Chapter 4.1-4.14.
- Guttag. Chapter 12.2, pp.190–201.
- Lecture
- Lab
- Useful Python modules:
datetimeandpickle - Useful Python libraries:
numpy,pandas,statsmodels,networkx,scikitlearn
- Useful Python modules:
