TDDD34 Programming with Applications in Engineering
Groups and timetable
The class will be split in two groups. Lectures and labs are held with both groups in common while lessons are split with different supervisor. The schedule will be identical for both groups.
An overview of timetable and deadlines are given below. Please refer also to timeedit to find the official course schedule. The schedule contain four kinds of activities.
FÖ in the schedule means lecture. Slides from lectures can be found online but can never give the same understanding as attending the lecture. The lectures will cover programming in general, problem solving and programming in MatLab. See the syllabus for complete prerequisites. See below for further information on lecture contents.
LE in the schedule means lesson. At the lessons you will come up with solutions to problems as a group. The solutions will be discussed and serve to further augment your understanding of programming. You will practice topics related to the previous lecture. Lessons are also an excellent time to ask questions. Do not be afraid to do so, only questions not asked are stupid. You must also be active and try to answer questions or you may miss out on oppertunities to learn.
The first two laborations in the schedule will be introduction with STONE. You must do STONE on your own. You can work on STONE whenever you find a free computer, but assistance will ONLY be available during these times. See the relevant section in the menu for information on what to do. STONE serves the purposes to introduce you to our computer environment and some tools. Most notably the UNIX environment and command line interface, which we will use during the labs. The more you know of the command line and available commands, the more efficient you can work.
LA in the schedule means computer laboration. You must do all computer laborations together with a fellow student of your choice. You will learn more if your friend is less skilled than you, so I urge everyone to pair up with someone less skilled. (Sometimes it is motivated to swap and work with someone on a more equal level, but it is best if you keep the same friend during all labs.) See the relevant section in the menu to find lab instructions.
Attending labs is the only way to demonstrate solutions and get help from assistants. The assistants are there to help you, but there are many of you and few of them. You will always get help at least once per lab but often the assitant will be more available. You cannot expect the assistant to help you immediately when you have a problem, and indeed most problems are easily solved if you put your mind to them and discuss them with your labmate. Since help from the assistant may be sparese you should use lab time well, do NOT use it to solve lab problems, DO use it to test and ask questions regarding your particular solution (that you prepared before the lab).
Beware however that solutions to lab problems may not be copied. And it is unfortunately very easy to spot copied code. You can discuss with friends how the for-loop works in general, but you may not copy a specific for-loop they wrote from their screen, and they may not write the for-loop for you. Give your friends help by asking clever questions, do not give away solutions. You might think it is harmless to let someone copy your code, but it could just as well look like it was you who copied the code.
The scheduled laborations are only a small part of the time you will need to complete the labs. You will have to find more lab time on your own. The lab computers are generally available 24/7 (24h/day, 7day/week), with some exceptions during holidays and exams. If a computer is free you are allowed to use it, provided you do not interfere with scheduled activity (see the schedule next to the lab room door). It is sometimes OK to use a free computer also if some activity is scheduled in the room, but be prepared to leave the computer in favor for any students that attend the scheduled lab. Use your senses and be polite.
Page responsible: Erik Nilsson
Last updated: 2013-08-12