This class was created by Brainscape user Mutsam Ismeil. Visit their profile to learn more about the creator.
By:
Mutsam Ismeil
- decks
- flashcards
- learners
Decks in this class (42)
Week 1 Sets Part 1
Set 1,
Enumeration sets 2,
Property based definition 3
17
cards
Week 1 Sets Part 2
Set 1,
Empty set 2,
Disjoint sets 3
20
cards
Week 2 Relations Part 2
Binary relations 1,
Ordered pair 2,
What does r specify in a binary r...
19
cards
Week 2 Relations Part 1
Ordered pair 1,
Cartesian product 2,
Binary relation 3
20
cards
Week 3 Functions Part 1
What is a function 1,
What is a cartesian product 2,
What is a relation 3
20
cards
Week 3 Functions Part 2
Function 1,
Inverse function 2,
Bijective function 3
20
cards
Week 4 Propositional Logic Part 1
Proposition 1,
Truth value 2,
Truth table 3
18
cards
Week 4 Propositional Logic Part 2
Logical reasoning 1,
Inference rules 2,
Modus tollens 3
20
cards
Week 5 Predicate Logic Part 1
Predicate logic 1,
Limitations of propositional logic 2,
Predicates in predicate logic 3
20
cards
Week 5 Predicate Logic Part 2
Predicate logic vs propositional ...,
Predicates 2,
Formulae 3
20
cards
SCC121-L1-Introduction
Abstract data type adt 1,
Data structure 2,
Queue 3
19
cards
SCC121-L2-MemPonRec
Byte addressable memory 1,
Source in memory 2,
Destination in memory 3
20
cards
SCC121-L4-The Kitchen Sink
Passing by value in c 1,
Passing by reference in c 2,
Pointers in c 3
20
cards
SCC121-L3-Two Dimensional Arrays
Two dimensional array 1,
Accessing elements in 2d array 2,
Outer loop function 3
19
cards
SCC121-L8-Searching
Linear search 1,
Binary search 2,
Time complexity 3
20
cards
SCC121-L6-Stack
What is a stack 1,
What does lifo stand for 2,
What is a stack frame 3
20
cards
SCC121-L7-Lists
Abstract data type adt 1,
List 2,
Doubly linked list 3
19
cards
SCC121_L9-Recursion
Recursion 1,
Base case 2,
Recursive step 3
19
cards
SCC121-Indexed Retrieval
Indexed retrieval 1,
Linear search 2,
Index 3
20
cards
SCC121_WK11LT1_Hashing
Hash function 1,
Hash table 2,
Collision 3
20
cards
scc121_wk15_lt1
Big o notation 1,
Asymptotic behavior 2,
Worst case scenario 3
20
cards
scc121_wk15_lt2
Asymptotic growth 1,
Big o notation 2,
Big omega notation 3
19
cards
SCC121_WK12LT2_OperationCount2
Time complexity 1,
Operation counting 2,
T n 3
20
cards
SCC121_WK13LT1_LinearSearch
Sigma notation 1,
Sum of first n integers 2,
Linear search algorithm 3
19
cards
SCC121_WK13LT1_LinearSearch
Sigma notation 1,
Sum of integers from 1 to n 2,
Best case analysis 3
19
cards
SCC121_WK13LT2_BinarySearch
Linear search 1,
What is the time complexity of bi...,
Worst case time complexity of lin...
20
cards
SCC121_WK14LT1_BigO 1
Big o notation 1,
Formal definition of big o 2,
Purpose of big o 3
20
cards
SCC121_WK15_LT2_Recursive
Recursive algorithm 1,
Base case 2,
When to use recursion 3
20
cards
scc121_wk15_lt2
Asymptotic growth 1,
Big o notation 2,
Big omega notation 3
19
cards
SCC121_WK22_LT1_introPvsNP
P vs np problem 1,
Tractable problems 2,
Polynomial time p 3
20
cards
SCC121_WK22_LT2_NP
Np non deterministic polynomial t...,
P polynomial time 2,
Certifier 3
19
cards
SCC121_WK23_LT1_NPcomplete
Decision problems 1,
P 2,
Np 3
21
cards
Linear algebra Part 1
What is the origin of the word al...,
What are the key applications of ...,
When were the first systems of 2 ...
21
cards
Linear algebra Part 2
System of linear equations 1,
Solution to a system 2,
Coefficient matrix 2
20
cards
Graphs
Graph 1,
Directed graph 2,
Undirected graph 3
20
cards
Week18b.pdf (Part 1)
Edge weight distance 1,
Shortest path 2,
Path in a graph 3
20
cards
Week18b.pdf (Part 2)
What is dijkstra s algorithm 1,
What is a key requirement for dij...,
What happens during the initializ...
20
cards
Week19a.pdf (Part 1)
Greedy algorithms 1,
Algorithmic paradigm 2,
Limitations of greedy algorithms 3
20
cards
Week20a.
Geometric applications of bsts 1,
Cad vlsi applications 2,
Sweep line technique 3
20
cards
Week20b.
2d range search problem 1,
What is the time complexity of a ...,
Quadtrees 2
20
cards
Week21b.pdf (Part 1)
Linear programming 1,
Objective function 2,
Feasible solution 3
20
cards
Week21a.pdf
Flow network 1,
Source and sink 2,
Real world applications of flow n...
20
cards
More about
SCC121
- Class purpose General learning
Learn faster with Brainscape on your web, iPhone, or Android device. Study Mutsam Ismeil's SCC121 flashcards now!
How studying works.
Brainscape's adaptive web mobile flashcards system will drill you on your weaknesses, using a pattern guaranteed to help you learn more in less time.
Add your own flashcards.
Either request "Edit" access from the author, or make a copy of the class to edit as your own. And you can always create a totally new class of your own too!
What's Brainscape anyway?
Brainscape is a digital flashcards platform where you can find, create, share, and study any subject on the planet.
We use an adaptive study algorithm that is proven to help you learn faster and remember longer....
