100% satisfaction guarantee Immediately available after payment Both online and in PDF No strings attached 4.2 TrustPilot
logo-home
Class notes

Computation I Lecture Notes

Rating
-
Sold
1
Pages
12
Uploaded on
07-11-2019
Written in
2019/2020

This document contains the lecture notes of the lectures of Computation I, conveniently organized on lecture, subject and field (CA or C programming). The lecture notes are a compact summary of the lectures, which incorporates all the important topics, useful definitions and added hints from the teachers. Don't forget to check out my Computation I bundle, where you will also find the CA summary, which in combination with these lecture notes are a good preparation for your exam!

Show more Read less
Institution
Course









Whoops! We can’t load your doc right now. Try again or contact support.

Connected book

Written for

Institution
Study
Course

Document information

Uploaded on
November 7, 2019
Number of pages
12
Written in
2019/2020
Type
Class notes
Professor(s)
Unknown
Contains
All classes

Subjects

Content preview

Computation I

Contents
Computer architecture..........................................................................................................................1
Lecture 1 (5/9) – Introduction (CH 1).................................................................................................1
Parts of a computer (hardware).....................................................................................................1
Programming/ controlling a computer..........................................................................................2
Lecture 2 (10/9) – Binary numbers/ MIPS & ISA (CH 2 & 3)...............................................................2
Binary numbers..............................................................................................................................2
MIPS and ISA..................................................................................................................................3
Lecture 3 (17/09) – ISA 2 (CH2 & 3)...................................................................................................3
Lecture 4 – ISA 3 (CH 2.13 -2.5)..........................................................................................................5
Lecture 5 – ISA 4................................................................................................................................5
Procedures/ functions...................................................................................................................5
SPIM programming – introduction................................................................................................6
Lecture 6 (8/10) – Memory hierarchy................................................................................................6
Lecture 8 (15/10) – SPIM & Circuits & …............................................................................................7
Circuits: combinational & sequential (hardware)..........................................................................7
Lecture 9 (22/10) – Processor Design: Datapath & Control...............................................................8
C programming......................................................................................................................................9
Lecture 2 (12/09) – ASCI, functions and variable scope, arrays.........................................................9
ASCI................................................................................................................................................9
Functions & scope..........................................................................................................................9
Debugger.......................................................................................................................................9
Arrays.............................................................................................................................................9
Lecture 3 (19/09) – Strings and recursion..........................................................................................9
Lecture 4 (26/09) – Stacks, pointers & structures............................................................................10
Lecture 5 (3/10) – Pointers..............................................................................................................11
Linked lists...................................................................................................................................11
Q&A - Tips............................................................................................................................................12




Computer architecture
Lecture 1 (5/9) – Introduction (CH 1)
Parts of a computer (hardware)
- Motherboard

, o (micro) Processor(s)
 CPU (central processor unit)
 Datapath
 Control
 Special-purpose IOs: interfaces
 Memory interface (DRAM)
 Cache memory
 IO input-output interfaces
o Chipset – makes sure the board works in sync  communication between parts
o Memory slots
o PCI slots – for peripherical devices to connect
o Peripherical interfaces (all kinds of ports to devices etc.)

Programming/ controlling a computer
- Input and output consists of binary system: 0s and 1s
o Used to be the only way to program

Lecture 2 (10/9) – Binary numbers/ MIPS & ISA (CH 2 & 3)
Binary numbers
- MSB: most significant bit
o On the most left position
- LSB: least significant bit
o On the most right position
- How to calculate decimal number from bits:
n

∑ ai∗2i
i=0
Where
o i is position (counting from the right, starting at 0)
o a is binary number
- Sorts/ sizes
o 4 bits = nibble
o 8 bits = byte
o 16 bits = C short int
o 32 bits = ‘word’
- How to find binary number from decimal:
o Keep dividing by two, and write down the remainder per division (so either 0 or 1)
o The first divisions give you the end of the binary number (so you work backwards)
o Keep doing so until you get 0 as the end result of the division
- How to get hexadecimal from binary:
o Take 4 bits of binary number and convert into one hexadecimal
o Continue until number is done
- How to express negative numbers
o Sign magnitude
 MSB expresses sign (1=minus, 0=+)
o One’s complement
 Negative numbers are the other way around
 0’s become 1’s and vice versa
$4.82
Get access to the full document:

100% satisfaction guarantee
Immediately available after payment
Both online and in PDF
No strings attached


Also available in package deal

Get to know the seller

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
hildeeschx Technische Universiteit Eindhoven
Follow You need to be logged in order to follow users or courses
Sold
130
Member since
8 year
Number of followers
108
Documents
67
Last sold
2 months ago

4.2

20 reviews

5
11
4
3
3
4
2
2
1
0

Recently viewed by you

Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Frequently asked questions