commit 07c8baf935b16ff66949d731c40869fba213c4f1 Author: Medium Fries Date: Sat Sep 1 16:25:12 2018 -0700 OMEGALUL diff --git a/cst311/lec/lec1.md b/cst311/lec/lec1.md new file mode 100644 index 0000000..9d1d4aa --- /dev/null +++ b/cst311/lec/lec1.md @@ -0,0 +1,24 @@ +# lec1 \ +First we'll define some terminology. + +> Hosts \ +End systems - typically don't bother with routing data through a network + +> Comm Links \ +Typically the actual systems that connect things together. \ + +## Network edges + +Can be subdivided clients & servers and sometimes both at the same time. \ + +## Access network: cable network + +Typically when have to share one line we can change the frequency of the signal as one method to provide a distinguishment between different data which may sometimes come from different sources. + +### Home Network + +Starting with the modem. All it does it take some signla and convert it to the proper IEEE data format(citation needed). +Typically we then pipe that data to a router which then just goes around the house in whatever configuration you may need. +Typically, especially for small businesses, star topology is common where there is some switch in the middle for traffic to be forwarded from the router/modem setup to the individual nodes on the outside of the star. + + diff --git a/cst311/lec/lec2.md b/cst311/lec/lec2.md new file mode 100644 index 0000000..83c9155 --- /dev/null +++ b/cst311/lec/lec2.md @@ -0,0 +1,52 @@ +# lec2 + +> Packets +When we send data(messages) we'll typically split the data into chunks or __packets__ + +## Network \ +> packet switching\ +Hosts break app-layer msgs into packets. These packets are moved along the same path like a train from router to router. Each of these moves from router to router we call __hops__. + +## Store and Forward \ +We first store the entirety of the packet before sending it off. Usually we keep this in some kind of buffer where we can read what kind of packet we are dealing with through some simple parsing. This is done so that we know how large the packet is going to be since the header of that packet will tell us crucial information about it and others like it. + +## Packet Switching: Queueing delay, loss \ +Since the routers store the packets in memory before sending them off, they store them in some queue which can sometimes fill up. For that reason if the buffer fills the router drops the packets and keeps going. + +Packet loss at the network layer is expected which is why we usually have packet loss recovery at each end. + +## Two key network-core functions \ +Packet headers usually tell us where the packet is trying to go and if where the other packets which stitch to them are supposed to go as well. \ +This information is usually kept in the header of the packet file. + +``` +HEADER: +DEST: 10101001 +DATA: 1001000 ... 00011110 +REL: <> +``` +It is important that we keep some relativity in the stream of packets. + +### Circuit Switching + +FDM v TDM [Frequency Division Multiplexing] [Time Divisiono Multiple] +> FDM \ +Multiple frequencies which remain static over time we can use for different connections. + +> TDM \ +We use the same channel but this time we use slices of time allocated to different connections. + +## Packet switching v Circuit Switching \ +_Packet switching let's more users on a network at once over circuit switching_ +The reason boils down to user behavior on a network. + +Packet switching advantages: \ +* great for burst data \ +* easy to setup typically + +Disadvantages: \ +* Packet delay and loss +* congestion does happen +* you need to implement some kind of protocol for data loss recovery + + diff --git a/cst311/readme.md b/cst311/readme.md new file mode 100644 index 0000000..1abda4c --- /dev/null +++ b/cst311/readme.md @@ -0,0 +1,3 @@ +# Henlo + +Repo for all my notes in CS 311 : An introduction to Networking diff --git a/cst337/lec1.md b/cst337/lec1.md new file mode 100644 index 0000000..e1d6af2 --- /dev/null +++ b/cst337/lec1.md @@ -0,0 +1,13 @@ +# lec1 + +> What on earth? \ +The first lecture has bee 50% syllabus 25% videos, 25% simple terminology; expect nothing interesting for this section + +## Performace Options \ +In general we have a few options to increase performace in software; pipelining, parallelism, prediction. + +Parallelism/Pipelining \ +* I'll just assume you know what this entail; one does many things at once; the other is like queues for processessing. + +* Prediction \ +Yes this means interpreting potential outcomes/inputs/outputs etc. __BRANCHING__. We try to predict potentiality and account for it ahead of time. diff --git a/cst337/readme.md b/cst337/readme.md new file mode 100644 index 0000000..e60b27a --- /dev/null +++ b/cst337/readme.md @@ -0,0 +1,2 @@ +# Subject - Assembly with MIPS \ +Assembly and other such things here diff --git a/cst363/.gitignore b/cst363/.gitignore new file mode 100644 index 0000000..b761d5c --- /dev/null +++ b/cst363/.gitignore @@ -0,0 +1 @@ +lab/ diff --git a/cst363/lec/lec1.md b/cst363/lec/lec1.md new file mode 100644 index 0000000..b610c11 --- /dev/null +++ b/cst363/lec/lec1.md @@ -0,0 +1,25 @@ +# lec1 + +## A few reasons to have them \ +And what they *require* \ +Database systems generally need support for: +1. querying - \ + * Finding things \ + * Just as well structured data makes querying easier + +2. access control - \ + * who can access which data segments and what they can do with that data \ + * reading, writing, sending, etc + +3. corruption prevention - \ + * mirroring/raid/parity checking/checksums/etc as some examples + +## Modeling Data \ +Just like other data problems we can choose what model we use to deal with data. + +__Schema__ is the deisgn or structure of a specific database. While the __instance__ is the occurance of that schema with some data inside the fields. _The data inside those fields at this point don't really matter. \ + +__Queries__ are typically known to be declarative; typically we don't care about what goes on behind the scenes in practice since by this point we are assuming we have tools we trust and know to be somewhat efficient. \ + +__Transactions__ are a set of operations. Transactions are not alllowed to fail. If _anything_ fails then everything should be undone and the state should revert to previous state. + diff --git a/cst363/lec/lec2.md b/cst363/lec/lec2.md new file mode 100644 index 0000000..b68dc62 --- /dev/null +++ b/cst363/lec/lec2.md @@ -0,0 +1,54 @@ +# lec2 + +Covering `tables, tuples, data stuff` + +## Problem Statement \ +We need to be able to manipulate data easily \ +> IMS had been using trees for a while a long time ago + +> Rows --> __atributes__ \ +> Columns --> __tuple__ \ +somtimes we refer to the title of the columns to be fields + +> Table --> __relation__ \ +relational instance as well for another term + +> Domain \ +The set of values allowed in a field + +## NULL \ +cant operate on it at all \ +> Count +The only thing that lets you operate on NULL. Even then you only get 0 back. + +## Keys + +> Super Key \ +> Candidate Key \ +> Primary Key \ + +## Problem with rows + +The rows are not distinguishable from each other; we still have a mes of data sitting there unlabeled. Some kind of identifier is necessary to be able to access every tuple in the relational set. + +### SuperKey \ +Set of attr is a superkey for a table as long as that combination of fields remains unique for every tuple in the relational set. \ +In other words if we have multiple fields; f1 f3 f5 might be a good combo to use as a key into the table. + +> What's a valid superkey? \ +For starters anything that contains another valid superkey \ +Any subset of a full tuple that can uniquely identify any row in the table. + +> Can a whole row be a superkey? \ +...full on brainlet.........yes + +### Candidate Key \ +Any super key that wouldn't be a superkey if one of the attr were removed. Say then that we have a super key that takes columns {1,3,5,6,7}, but removing anyone of the rows no longer reliably returns an arbitrary _unique_ row. + +### Primary key \ +Any candidate key the database designer has chosen to serve as the unique + +_one more key type_ \ +### Foreign Key \ +Set of attrs in one table that are the primary key attrs of another table. More info about this key type will come later but just know for now that it exists in the wild. + diff --git a/cst363/readme.md b/cst363/readme.md new file mode 100644 index 0000000..1883400 --- /dev/null +++ b/cst363/readme.md @@ -0,0 +1,8 @@ +# ? +Notes are ordered from lec[1].md to lec[N].md + +To be stitched later at some point. + +## Markkdown flavor? + +Pandoc, if this compiles nicely on other platforms then great but idfc tbqh famalam diff --git a/readme.md b/readme.md new file mode 100644 index 0000000..95d1b13 --- /dev/null +++ b/readme.md @@ -0,0 +1,4 @@ +# What this is \ +A repository for all notes on as many lectures as I could attend. Information is meant to be somewhat correct enough to be reliable information regarding each topic. + +Info here should be useful for general purpose but material is guided for CSUMB's curriculum. diff --git a/sem/Lab_1_Wireshark_Introduction.pdf b/sem/Lab_1_Wireshark_Introduction.pdf new file mode 100644 index 0000000..8fca031 Binary files /dev/null and b/sem/Lab_1_Wireshark_Introduction.pdf differ diff --git a/sem/lab1_.pcapng b/sem/lab1_.pcapng new file mode 100644 index 0000000..2e822bf Binary files /dev/null and b/sem/lab1_.pcapng differ