1
Q
binary seach tree vs linked list
A
binary search trees are more efficient
as you do not have to search every node
Cs Revision / Notion
flashcards
Decks in class (64)
# Cards
-
Network Knowledge7
-
Servers6
-
Topology9
-
Tcp/ip6
-
Packets3
-
databases normalisation3
-
transaction processing6
-
referential intergrirty1
-
1.3.1 compression8
-
1.3.1 encryption3
-
1.3.1 hashing2
-
1.2.2 p14
-
1.2.2 source and translators9
-
1.3.1 sql7
-
1.2.2 stages of compilation3
-
linkers loaders libraries4
-
TCP/IP layers5
-
1.3.3 servers4
-
parameters value reference2
-
thinking abstractly + basics8
-
thinking ahead5
-
recursion3
-
depth bredth first4
-
trees ( data structures)2
-
proggraming constructs6
-
register s5
-
OOP5
-
CISC and RISC4
-
buses3
-
architecture3
-
difference between ram and rom2
-
Whats Pipelining3
-
GPU + Parralel4
-
1.13 storage types6
-
1.2 operating systems8
-
memory managment4
-
intterupt2
-
scheduling algorithms5
-
1.2.1 knowledge4
-
methodologies5
-
1.2.4 p16
-
Stacks7
-
linear and binary search code1
-
queue code4
-
trees and deleting and findingn nodes1
-
LMC instruction Sef5
-
programming paradigms1
-
acts5
-
herusitics backtracking data mining3
-
databases2
-
2.2.210
-
comparing tables1
-
linked lists1
-
IDE ting1
-
Big O Time Compleixy On Sorting Algs3
-
LINKED LISTS1
-
ACID + refernetial integ6
-
1.2.4 paradigms7
-
1.2.4 lagugages4
-
1.2.4 add modes7
-
1.2.4 OOP0
-
Unicode Asci2
-
L/B Search3
-
Last Min8
