relational model | Notes

Notes

CS10 ▾
- CS10-labs
CS12 ▾
- CS12-lecture-notes
CS13 ▾
- CS13-lecture-notes
CS130 ▾
CS131 ▾
CS133 ▾
CS134 ▾
CS135 ▾
CS137 ▾
CS138 ▾
CS139 ▾
CS140 ▾
CS152 ▾
CS177 ▾
CS190 ▾
CS191 ▾
CS192 ▾
CS26 ▾
- CS26-lecture-notes
- CS26-reading-notes
CS39 ▾
- CS39-lecture-notes
CS46 ▾
- CS46-lecture-notes
- Luhn's Algorithm
MATH100 ▾
- MATH100-lecture-notes
MATH102 ▾
MATH170 ▾
MATH31 ▾
PHIL103 ▾
PHYS105 ▾
RPTA125 ▾
STATS50 ▾
- STATS50-lecture-notes

relational model

Categories
Tags
- 2-3 search tree 2
- 737 Boeing disaster 1
- abstraction 1
- accumulators 1
- advantage 1
- AES 2
- agile 4
- ambiguity 1
- angular motion 1
- animation 1
- app distribution 1
- application layer 2
- applied ethics 1
- artificial neural networks 2
- assembly 1
- asymmetric encryption 3
- asymptotic analysis 2
- asymptotic notation 1
- authentication 3
- AXR 1
- B-tree 1
- backtracking 1
- ballistic pendulum 1
- banker's algorithm 2
- bayesian classification 2
- behavior 1
- bellman-ford algorithm 1
- BIGNUM 1
- binary search 3
- birthday bound 1
- bitwise 1
- block cipher 1
- block ciphers 1
- blockchain 1
- brainfuck 2
- breadth first search 1
- broadcast/multicast 1
- C 3
- calorimetry 1
- capitalism/socialism 1
- centripetal force 1
- certificates 1
- CFS 2
- CHACHA20 1
- ciphers 1
- circular motion 2
- class diagrams 3
- classification 3
- classificiation 1
- clean code 2
- closure 1
- clustering 1
- code design 2
- codename one 3
- cohesion 1
- color theory 1
- combinational circuits 1
- command design 1
- compilers 1
- confusion 1
- congestion control 2
- context-free grammar 3
- context-free language 1
- contextual inquiry 3
- convection/radiation 2
- cookies 1
- corporate social responsibility 1
- count sort 1
- coupling 1
- crc 1
- CSMA 2
- cyber security 1
- cyclic redundancy check 1
- data centers 1
- data exploration 3
- data flow 1
- data preprocessing 3
- datagrams 1
- DBMS 2
- deadlock 3
- delay 2
- demorgan's theorem 2
- depth first search 1
- design patterns 2
- devops 1
- DHCP 1
- Diffie-Hellman 2
- diffusion 1
- dijkstra's algorithm 2
- directed graph 1
- discrete structures 1
- disjoint set 2
- distinguishing games 1
- divide and conquer 3
- divisbility 1
- divisibility 4
- division of labor 1
- dns 2
- duality 3
- dynamic analysis 1
- dynamic programming 3
- edge weighted digraph 1
- ElGamal 1
- elliptic curve groups 1
- email 2
- encapsulation 1
- encryption modes 2
- endianness 1
- entropy 1
- equilibrium 3
- ER model 3
- event driven 1
- exponentiation 1
- feistel 1
- fields 1
- file systems 2
- finite automata 4
- finite state machine 4
- firewall 1
- flow control 1
- flow network 1
- ford-fulkerson method 1
- fortuna 1
- ftp 1
- full adder 2
- functional dependency 1
- functional programming 1
- functions 2
- galois fields 2
- GCD 1
- git 1
- go-back-n 1
- graph 4
- gravitational forces 1
- greedy algorithms 1
- groups 2
- GUI 3
- hashing 4
- heapsort 3
- heat engines 2
- http 2
- huffman codes 1
- human computer interaction 2
- hunt's algorithm 1
- ICMP 1
- ideal gas law 3
- IDS 1
- IEEE754 2
- IGP 1
- immutability 1
- implementation 1
- indexing 1
- inheritance 1
- instance based learning 1
- instruction set architecture 4
- integration 1
- inter-process communication 1
- interfaces 1
- internet protocol 1
- interrupts 2
- intra-as 1
- IPSec 1
- IPv4 2
- IPv6 1
- java 2
- karnaugh map 1
- kernel 2
- keys 1
- kinematics 1
- kinetic theory of gases 1
- kosaraju's algorithm 1
- kruskal's algorithm 2
- lambdas 1
- LAN 2
- leadership 6
- least common multiple 2
- lexers 3
- linear algebra 1
- linear probing 1
- linear regression 1
- link layer 1
- loss 1
- market failures 1
- mass storage 1
- MATLAB 1
- mealy machine 2
- memoization 2
- memory 6
- memory allocation 1
- mergesort 5
- minimum spanning tree 2
- modularity 1
- moore machine 2
- morality 1
- multiple access protocols 2
- multiple dispatch 1
- multiplexers 1
- multiplicative inverse 1
- multitasking 1
- NAT 1
- nearest neighbor 1
- net neutrality 1
- network core 3
- network edge 2
- network history 1
- network layer 3
- network models 4
- network security 4
- normalization 2
- NP-completeness 2
- numpy 1
- OAEP 1
- observer design 1
- OCB 1
- operating system structure 1
- operating system types 2
- overfitting 2
- p2p 1
- padding 1
- paging 2
- pandas 1
- parse trees 1
- parsers 3
- perceptron 1
- perm384 1
- permutations 1
- piplined protocols 1
- polymorphism 1
- prim's algorithm 2
- primes 1
- priority queues 2
- privacy 1
- probability 1
- process control block 1
- process termination 1
- processes 4
- processing 1
- project management 1
- proof 2
- property rights 2
- protocol layers 1
- proxy 1
- pumping lemma 4
- push-down automata 3
- python 1
- quicksort 6
- racket 6
- radix sort 2
- recurrences 2
- recursion 3
- recursive-descent predictive-parsing 1
- red-black BST 3
- reductions 5
- refactoring 1
- regular expressions 3
- relational algebra 4
- relational model 4
- REST 1
- review 8
- rotation 1
- rotational motion 3
- routing algorithms 1
- RSA 4
- s-r latch 1
- sampling 1
- scheduling 5
- schema 1
- scrum 2
- security 1
- selective repeat 1
- semaphores 3
- sensitivity analysis 4
- sequential circuits 8
- series 2
- shortest path tree 1
- similarity 1
- sockets 1
- software architecture 2
- software design 4
- software development life cycles 1
- software engineering 2
- sound 2
- space complexity 2
- sponge construction 1
- sprint review 1
- SQL 6
- SSE 2
- SSL 1
- static analysis 1
- stats 1
- storage 2
- stream ciphers 1
- support vector machines 1
- switching fabrics 1
- syllabus 11
- symbol table 2
- symmetric encryption 1
- synchronization 2
- tag generators 1
- tail recursion 3
- TCP 3
- thermodynamics 3
- threads 3
- throughput 3
- time complexity 2
- TLS 1
- topological sort 2
- torque 1
- transformations 2
- transport layer 1
- turing machine 3
- two phase procedure 2
- UDP 2
- UML 4
- undirected graph 1
- union find 1
- unordered symbol table 3
- use case 1
- user stories 1
- variable length encoding 1
- verification/validation 3
- virtual circuits 1
- virtual memory 2
- web caching 1
- weighted graph 1

CS134-lecture-20210607

ER model
relational model

CS134-lecture-20210608

relational model
keys

CS134-lecture-20210609

relational model
schema

CS134-lecture-20210610

relational model
relational algebra

Categories
Tags
- 2-3 search tree 2
- 737 Boeing disaster 1
- abstraction 1
- accumulators 1
- advantage 1
- AES 2
- agile 4
- ambiguity 1
- angular motion 1
- animation 1
- app distribution 1
- application layer 2
- applied ethics 1
- artificial neural networks 2
- assembly 1
- asymmetric encryption 3
- asymptotic analysis 2
- asymptotic notation 1
- authentication 3
- AXR 1
- B-tree 1
- backtracking 1
- ballistic pendulum 1
- banker's algorithm 2
- bayesian classification 2
- behavior 1
- bellman-ford algorithm 1
- BIGNUM 1
- binary search 3
- birthday bound 1
- bitwise 1
- block cipher 1
- block ciphers 1
- blockchain 1
- brainfuck 2
- breadth first search 1
- broadcast/multicast 1
- C 3
- calorimetry 1
- capitalism/socialism 1
- centripetal force 1
- certificates 1
- CFS 2
- CHACHA20 1
- ciphers 1
- circular motion 2
- class diagrams 3
- classification 3
- classificiation 1
- clean code 2
- closure 1
- clustering 1
- code design 2
- codename one 3
- cohesion 1
- color theory 1
- combinational circuits 1
- command design 1
- compilers 1
- confusion 1
- congestion control 2
- context-free grammar 3
- context-free language 1
- contextual inquiry 3
- convection/radiation 2
- cookies 1
- corporate social responsibility 1
- count sort 1
- coupling 1
- crc 1
- CSMA 2
- cyber security 1
- cyclic redundancy check 1
- data centers 1
- data exploration 3
- data flow 1
- data preprocessing 3
- datagrams 1
- DBMS 2
- deadlock 3
- delay 2
- demorgan's theorem 2
- depth first search 1
- design patterns 2
- devops 1
- DHCP 1
- Diffie-Hellman 2
- diffusion 1
- dijkstra's algorithm 2
- directed graph 1
- discrete structures 1
- disjoint set 2
- distinguishing games 1
- divide and conquer 3
- divisbility 1
- divisibility 4
- division of labor 1
- dns 2
- duality 3
- dynamic analysis 1
- dynamic programming 3
- edge weighted digraph 1
- ElGamal 1
- elliptic curve groups 1
- email 2
- encapsulation 1
- encryption modes 2
- endianness 1
- entropy 1
- equilibrium 3
- ER model 3
- event driven 1
- exponentiation 1
- feistel 1
- fields 1
- file systems 2
- finite automata 4
- finite state machine 4
- firewall 1
- flow control 1
- flow network 1
- ford-fulkerson method 1
- fortuna 1
- ftp 1
- full adder 2
- functional dependency 1
- functional programming 1
- functions 2
- galois fields 2
- GCD 1
- git 1
- go-back-n 1
- graph 4
- gravitational forces 1
- greedy algorithms 1
- groups 2
- GUI 3
- hashing 4
- heapsort 3
- heat engines 2
- http 2
- huffman codes 1
- human computer interaction 2
- hunt's algorithm 1
- ICMP 1
- ideal gas law 3
- IDS 1
- IEEE754 2
- IGP 1
- immutability 1
- implementation 1
- indexing 1
- inheritance 1
- instance based learning 1
- instruction set architecture 4
- integration 1
- inter-process communication 1
- interfaces 1
- internet protocol 1
- interrupts 2
- intra-as 1
- IPSec 1
- IPv4 2
- IPv6 1
- java 2
- karnaugh map 1
- kernel 2
- keys 1
- kinematics 1
- kinetic theory of gases 1
- kosaraju's algorithm 1
- kruskal's algorithm 2
- lambdas 1
- LAN 2
- leadership 6
- least common multiple 2
- lexers 3
- linear algebra 1
- linear probing 1
- linear regression 1
- link layer 1
- loss 1
- market failures 1
- mass storage 1
- MATLAB 1
- mealy machine 2
- memoization 2
- memory 6
- memory allocation 1
- mergesort 5
- minimum spanning tree 2
- modularity 1
- moore machine 2
- morality 1
- multiple access protocols 2
- multiple dispatch 1
- multiplexers 1
- multiplicative inverse 1
- multitasking 1
- NAT 1
- nearest neighbor 1
- net neutrality 1
- network core 3
- network edge 2
- network history 1
- network layer 3
- network models 4
- network security 4
- normalization 2
- NP-completeness 2
- numpy 1
- OAEP 1
- observer design 1
- OCB 1
- operating system structure 1
- operating system types 2
- overfitting 2
- p2p 1
- padding 1
- paging 2
- pandas 1
- parse trees 1
- parsers 3
- perceptron 1
- perm384 1
- permutations 1
- piplined protocols 1
- polymorphism 1
- prim's algorithm 2
- primes 1
- priority queues 2
- privacy 1
- probability 1
- process control block 1
- process termination 1
- processes 4
- processing 1
- project management 1
- proof 2
- property rights 2
- protocol layers 1
- proxy 1
- pumping lemma 4
- push-down automata 3
- python 1
- quicksort 6
- racket 6
- radix sort 2
- recurrences 2
- recursion 3
- recursive-descent predictive-parsing 1
- red-black BST 3
- reductions 5
- refactoring 1
- regular expressions 3
- relational algebra 4
- relational model 4
- REST 1
- review 8
- rotation 1
- rotational motion 3
- routing algorithms 1
- RSA 4
- s-r latch 1
- sampling 1
- scheduling 5
- schema 1
- scrum 2
- security 1
- selective repeat 1
- semaphores 3
- sensitivity analysis 4
- sequential circuits 8
- series 2
- shortest path tree 1
- similarity 1
- sockets 1
- software architecture 2
- software design 4
- software development life cycles 1
- software engineering 2
- sound 2
- space complexity 2
- sponge construction 1
- sprint review 1
- SQL 6
- SSE 2
- SSL 1
- static analysis 1
- stats 1
- storage 2
- stream ciphers 1
- support vector machines 1
- switching fabrics 1
- syllabus 11
- symbol table 2
- symmetric encryption 1
- synchronization 2
- tag generators 1
- tail recursion 3
- TCP 3
- thermodynamics 3
- threads 3
- throughput 3
- time complexity 2
- TLS 1
- topological sort 2
- torque 1
- transformations 2
- transport layer 1
- turing machine 3
- two phase procedure 2
- UDP 2
- UML 4
- undirected graph 1
- union find 1
- unordered symbol table 3
- use case 1
- user stories 1
- variable length encoding 1
- verification/validation 3
- virtual circuits 1
- virtual memory 2
- web caching 1
- weighted graph 1