◇
computer science
Structural Virtual Concept Hub connecting relational records across the archive constellation.
CONNECTED ARCHIVE ENTRIES (475)関連記録
◇Computers, Data, and Information
→◇ICT and Society
→◇Arithmetic Operations in Binary
→◇Data Representation - Characters and Boolean
→◇Data Representation - Integers
→◇Data Representation - Real Numbers
→◇Introduction to Number Systems
→◇Computer Hardware - IO Devices
→◇Computer Hardware Components - CPU and Motherboard
→◇Computer Hardware Components - Memory and Storage
→◇Computer Software - Applications and Programming Software
→◇Computer Software - OS and Utility Programs
→◇Virtualization
→◇Internetworking
→◇Cybersecurity Awareness
→◇Software Development Process
→◇Introduction to Databases
→◇[REV] CCICOMP FE Reviewer with answers
→◇[REV] CCPROG1 Comprehensive Finals Reviewer
→◇Process and Importance of Programming
→◇Problem Analysis, Logic Formulation and Flowcharting
→◇Variable, Operators, Expressions, and the Assignment Statement
→◇Functions and Programs
→◇Predefined Functions
→◇User-defined Functions
→◇[REV] CCDSTRU Comprehensive Finals Reviewer
→◇Continuity
→◇Definition of the Limit and Limit Theorems
→◇Functions and Their Graphs
→◇Introduction to Limits
→◇Limit at Infinity
→◇One-Sided Limits and Infinite Limits
→◇Differentiability and Continuity
→◇Differentiation Rules
→◇Higher Order Derivatives and Derivative of Trigonometric Functions
→◇Implicit Differentiation
→◇The Tangent Line and the Derivative
→◇Absolute Extremum
→◇Additional Slides
→◇Curve Sketching Examples
→◇Derivative as Rate of Change and Related Rates Part 1
→◇Linear Approximations and Differentials
→◇Maximum and Minimum Function Values with Applications
→◇[REV] CSMATH1 Comprehensive Finals Reviewer
→◇Mock-Midterm-Exam-01
→◇Mock-Midterm-Exam-02
→◇[REV] CCDSALG Comprehensive Finals Reviewer
→◇A Posteriori Analysis
→◇A Priori Analysis
→◇Advanced & Related Topics
→◇Algorithm Analysis
→◇Algorithm
→◇Amortized Analysis
→◇Assignment - Read - Write
→◇Asymptotic Notation
→◇Average-Case Analysis
→◇Best-Case Analysis
→◇Big-O Notation
→◇Big-Omega Notation
→◇Big-Theta Notation
→◇Conditionals
→◇Context & Relationships
→◇Core Concepts
→◇Correctness
→◇Declarations
→◇Divide and Conquer
→◇Efficiency
→◇Frequency Count
→◇Function Calls
→◇Growth Rates
→◇Input Size
→◇Lesson 1- Analysis of Algorithms
→◇Little-o Notation
→◇Little-omega Notation
→◇Loops
→◇Lower Bounds
→◇Master Theorem
→◇Nested-Loops
→◇Order of Growth
→◇Probabilistic Analysis
→◇RAM Model
→◇Recurrences
→◇Recursion Tree Method
→◇Running Time
→◇Space Complexity
→◇Substitution Method
→◇Time Complexity
→◇Worst-Case Analysis
→◇Worst-case running time
→◇Reccurences
→◇Searching Algorithms
→◇Stacks
→◇[HO] 01 - Intro
→◇[HO] 02 - Frequency Counting
→◇[HO] 03 - Asymptotic Bounds
→◇[HO] 04 - Recurrences
→◇[HO] 05 - Algorithms - Search
→◇[HO] 06 - Algorithms - Sort
→◇[HO] 07 - Array and Link Lists
→◇[HO] 08 - Stacks
→◇[HO] 09 - Queues
→◇[HO] 10 - Infix, Postfix, Prefix
→◇Supplement-Infix-to-Postfix
→◇[HO] 11 - Hash Tables
→◇[HO] 12 - Trees
→◇[HO] 13 - Binary Search Trees (BST)
→◇[HO] 14 - AVL Trees
→◇[HO] 15 - Heaps
→◇[HO] 16 - Graphs
→◇[HO] 17 - Graphs Traversals
→◇[HO] 18 - MST
→◇[REV] CCPROG2 Comprehensive Finals Reviewer
→◇Accessing Elements
→◇Advantages and Disadvantages
→◇Arrays (1)
→◇Arrays and Functions
→◇Arrays and Pointers
→◇Arrays
→◇Characteristics & Attributes
→◇Common Array Operations & Considerations
→◇Declaration
→◇Dimension
→◇Dimensions of Arrays
→◇Element Type
→◇Initialization
→◇Introduction to Arrays
→◇Memory Allocation
→◇Multidimensional Arrays (3D+)
→◇Name
→◇One-Dimensional Arrays (1D Arrays)
→◇Size
→◇Traversing Arrays
→◇Two-Dimensional Arrays (2D Arrays)
→◇What is an Array
→◇Strings
→◇Structs
→◇File Handling
→◇Recursion
→◇[QZ] LQ3 Mock
→◇[QZ] LQ3 Pointers
→◇Column Matrix
→◇Definition of a Matrix
→◇Diagonal Matrix
→◇Elementary Matrices
→◇Elementary Row Operation
→◇Identity Matrix
→◇Important Remarks
→◇Inverse of a Matrix
→◇Lower Triangular Matrix
→◇Main Diagonal
→◇Matrices and Matrix Operations
→◇Matrix Addition
→◇Matrix Equality
→◇Matrix Multiplication
→◇Matrix Subtraction (Difference)
→◇Nonsingular Matrix
→◇Operations on Matrices
→◇Polynomial in a Matrix
→◇Powers of a Matrix
→◇Properties of Matrix Operations
→◇Row Matrix
→◇Scalar Matrix
→◇Scalar Multiplication
→◇Size & Dimension of a Matrix
→◇Skew-Symmetric Matrix
→◇Special Types of Square Matrices
→◇Square Matrix
→◇Symmetric Matrix
→◇Trace of a Matrix
→◇Transpose of a Matrix
→◇Triangular Matrices
→◇Types of Matrices
→◇Upper Triangular Matrix
→◇Zero Matrix
→◇The Inverse of a Matrix
→◇[REV] CSMATH2 Comprehensive Finals Reviewer
→◇Additive Rule
→◇Additive and Complementary Rules
→◇Basic Formula of Probability
→◇Bayes's Formula
→◇Bayes's Rules
→◇Combinations
→◇Complement
→◇Complementary Rule
→◇Conditional Probability and Multiplicative Rules
→◇Conditional Probability
→◇Contingency Table
→◇Counting Techniques
→◇Counting by Cases
→◇Discrete Probability Distribution
→◇Event
→◇Expected Event
→◇[REV] STT101A Comprehensive Finals Reviewer
→◇Fundamental Principle of Counting
→◇Generalized Multiplication
→◇Hyper-geometric Distribution
→◇Hypothesis Testing
→◇Hypothesis-Testing.excalidraw
→◇Independent Events
→◇Multiplication Rule
→◇Multiplicative Rule
→◇Mutually Exclusive Events
→◇Normal Distribution
→◇Partition of Sample Space
→◇Permutations
→◇Priori Probability
→◇Probability Mass Function
→◇Random Variable
→◇Random Variables
→◇Relative Frequency Form
→◇Sample Space
→◇Statistical Experiment
→◇Total Probability Rule
→◇Types of Event Operations
→◇Union
→◇intersection
→◇Concept-Exam-Finals-Rev
→◇Concept-Finals-Mock
→◇Concepts-Finals-Mock-Answers
→◇DB-Design-Finals-Answers
→◇DB-Design-Finals-Mock
→◇DB-Design-Finals-Rev
→◇The Object-Oriented Paradigm and an Overview of Java
→◇Files I-O (via Streams)
→◇Design Principles
→◇Classes and Objects
→◇Class Relationships
→◇Collections
→◇Inheritance
→◇Graphical User Interfaces and Event Handling
→◇Model-View-Controller
→◇Abstract Classes and Interfaces
→◇Exception Handling
→◇JAVA-OOP-Finals-Mock
→◇JAVA-OOP-Finals-Rev
→◇JAVA-OOP-Mock-Answers
→◇Adversarial Games
→◇Decision Tree
→◇Informed Search
→◇K Means Clustering
→◇MDP
→◇Machine Learning
→◇Naive Bayes
→◇Q Learning
→◇State Based Model
→◇Uninformed Search
→◇[REV] CSINTSY Comprehensive Finals Reviewer
→◇Artificial Intelligence Overview
→◇Heuristics and A-Star Search
→◇State-Based Models
→◇Uniform Cost Search
→◇Adversarial Games
→◇Decision Trees
→◇K-Means Clustering
→◇Machine Learning Models
→◇Naive Bayes
→◇Expert Systems Overview
→◇Markov Decision Processes
→◇Q-Learning
→◇Introduction
→◇Layered Network Design
→◇Applications
→◇Sockets Programming
→◇Transport Layer
→◇Bellman Ford Distance Vector Algorithm
→◇Dijkstra's Algorithm (Advanced)
→◇Dijkstra's Link State Algorithm
→◇IPv6 Tunneling and Encapsulation
→◇Longest Prefix Matching
→◇Network Address Translation
→◇Network Layer
→◇Sub-net Addressing
→◇Addressing and Forwarding
→◇Learning Switches (Advanced)
→◇Learning Switches (Basic)
→◇Link Layer
→◇End to End Throughput and Bottleneck Links
→◇Physical Layer
→◇Security
→◇[REV] CSNETWK Comprehensive Finals Reviewer
→◇[REV] CCAPDEV Comprehensive Finals Reviewer
→◇HTML
→◇CSS Selectors
→◇CSS
→◇[REV] CSARCH1 Comprehensive Finals Reviewer
→◇Introduction to Computer Organization Arch Digital System
→◇2x vs 10y Ambiguity-1
→◇Binary Codes for Decimal Digits
→◇Binary Data Organization
→◇Complements
→◇Number System Base Conversion
→◇Positional Number System
→◇Boolean Algebra
→◇Introduction to Hardware Description Language
→◇Karnaugh Map
→◇Logic Gates
→◇Summary of Verilog Syntax
→◇Combinational Circuit - Analysis
→◇Combinational Circuit - Decoder
→◇Combinational Circuit - Design
→◇Combinational Circuit - Multiplexer
→◇Combinational Circuit - NAND NOR
→◇Combinational Circuit - Tri state gates
→◇Hardware Description Language Structural Modelling
→◇Hardware Description Language for sequential circuit
→◇Introduction to Sequential Circuit
→◇Sequential Circuit - Analysis
→◇Sequential Circuit - Design
→◇Sequential Circuit - State reduction and assignment
→◇[REV] NSCOM01 Finals Reviewer
→◇Voice over IP and Multimedia Basics
→◇Real-Time Protocols
→◇Session Initiation Protocol
→◇P2P Architecture and BitTorrent
→◇Skype and P2P Voice Architecture
→◇Introduction to Cybersecurity
→◇OS Basics and Cryptography
→◇Software and Network Security
→◇Vulnerability Assessment and Penetration Testing
→◇Defensive Security and SOC Operations
→◇Capture the Flag and Applied Security
→◇[QZ] NSSECU1 Defensive Security
→◇[REV] NSSECU1 Comprehensive Finals Reviewer
→◇[REV] CSADPRG Finals Reviewer
→◇Overview of Programming Languages
→◇Evolution of Programming Languages
→◇Names, Variables, Binding, Scope
→◇Data Types
→◇Expressions and Assignment Statements
→◇Statement Level Control Structures
→◇Subprograms
→◇Abstract Data Types
→◇[REV] CSARCH2 Comprehensive Reviewer and Practice Exam
→◇Binary Addition, Subtraction & Carry Lookahead Adders
→◇Binary Division (Restoring & Non-Restoring Division Algorithms)
→◇Cache Memory Principles & Mapping Architectures
→◇Cache Replacement Policies & Write Strategies
→◇Control Unit Design & Microprogramming
→◇Course Overview & Architecture Foundations
→◇Floating-Point Arithmetic Operations
→◇Functional Units & Performance Fundamentals
→◇IEEE 754 Floating-Point Representation (Single & Double Precision)
→◇IO Organization & Interrupt Handling
→◇Instruction Set Architecture (ISA) Principles & Addressing Modes
→◇Integer Representation & Fixed-Point Arithmetic
→◇Memory System Organization & Hierarchy
→◇Pipelining Fundamentals & Pipeline Hazards
→◇[PS] Binary Data Organization
→◇[PS] Binary Floating Point Representation
→◇[PS] Binary Signed Multiplication
→◇[PS] Binary Unsigned Division
→◇[PS] Binary-Coded Decimal
→◇[PS] Cache Memory 1
→◇[PS] Cache Memory 2
→◇[PS] Decimal Floating Point Representation
→◇[PS] Floating Point Operations
→◇[PS] Floating Point Rounding
→◇[PS] Integer Operations and Overflow
→◇[PS] Integer Representation
→◇[PS] Microprogramming and Control Unit
→◇[PS] Number System Base Conversion
→◇[PS] Unicode and Character Representation
→◇Processing Unit Organization & Single-Bus Datapath
→◇[REV] CSARCH2 Comprehensive Reviewer and Practice Exam
→◇Signed Multiplication (Booth's & Extended Booth's Algorithm)
→◇Unsigned Multiplication (Array & Sequential Multipliers)
→◇Virtual Memory & Address Translation (Paging & TLB)
→◇Association Rule Mining
→◇Bayesian Inference
→◇Clustering
→◇Data Cleaning
→◇Data Collection
→◇Data Preprocessing
→◇Data Representation
→◇EDA
→◇Foundations for Inference
→◇Graph Data Modelling
→◇Image Data Modelling
→◇Inference for Categorical Data
→◇Inference for Means
→◇Introduction to Data
→◇Linear Programming
→◇[ANS] 1
→◇[ANS] 2
→◇[ANS] 3
→◇[ANS] Answer Key
→◇[HO] calculator
→◇[QZ] 1
→◇[QZ] 2
→◇[QZ] 3
→◇[REV] CSMODEL Comprehensive Finals Reviewer
→◇Recommender Systems
→◇Text Data Modelling
→◇Time Series Data Modelling
→◇Verilog HDL and Digital Circuit Simulation
→◇Assembly Language and CPU Architecture Lab
→◇[HO] LBYARCH Lab Reference
→◇[REV] LBYARCH Comprehensive Finals Reviewer
→◇[QZ] NSCOM02 Finals 50-Item
→◇[REV] NSCOM02 Comprehensive Finals Reviewer
→◇Distance-Vector Routing and RIP
→◇Link-State Routing and OSPF
→◇BGP and Interdomain Routing
→◇Software-Defined Networking
→◇Network Management, ICMP, and SNMP
→◇Introduction to Offensive Security and Kali Linux
→◇Post-Exploitation Awareness and Privilege Escalation
→◇VAPT Reporting
→◇Information Gathering and Reconnaissance
→◇Network Scanning
→◇Enumeration
→◇Vulnerability Identification and CVSS Scoring
→◇Attack Path Development
→◇Authentication Weakness Testing
→◇Web Application Pentesting
→◇Exploitation Workflow with Metasploit
→◇[REV] NSSECU2 Comprehensive Reviewer and Practice Exam
→◇[REV] CSALGCM Comprehensive Finals Reviewer
→◇Complexity Analysis
→◇Computational Thinking in Problem Solving
→◇01 - Solve Me First
→◇02 - Simple Array Sum
→◇03 - Mini-Max Sum
→◇04 - CamelCase
→◇05 - Library Fine
→◇06 - Minimum Distances
→◇07 - Repeated String
→◇08 - Sherlock and Squares
→◇09 - Anagram
→◇10 - Circular Array Rotation
→◇[PS] Fool Arcana
→◇01 - Breadth First Search Shortest Reach
→◇02 - Cycle Detection
→◇03 - Find The Running Median
→◇04 - Is This a Binary Search Tree
→◇05 - Queue Using Two Stacks
→◇06 - Sherlock and Array
→◇07 - Sparse Arrays
→◇08 - Tree Preorder Traversal
→◇Problems, Problem Types, and Algorithms
→◇01 - DPS Check in the Knights of Favonius
→◇02 - I Hate Spellcasters
→◇03 - Metacognitive Frequencies
→◇04 - Never Fade Away
→◇05 - QUIIIIICKSOOOOORT!!!!!!!!!!!
→◇06 - Swapper, No Swapping!!!
→◇01 - Its Like I Have ESPN Or Something
→◇02 - Laughter Is The Best Medicine
→◇03 - Lets Plant Rice
→◇04 - POWAH UNLIMITED POWAH
→◇05 - Shattering The Towers Of Algorythmos
→◇06 - The Monkeys Paw
→◇[REV] CSOPESY Comprehensive Finals Reviewer
→◇CSOPESY 01 - Introduction
→◇CSOPESY 02 - Operating System Structure
→◇CSOPESY 03 - IO and Display
→◇CSOPESY 04 - Processes
→◇CSOPESY 05 - Threads
→◇CSOPESY 06 - CPU Scheduling
→◇CSOPESY 07 - Synchronization Tools
→◇[QZ] CSOPESY Midterm Mock Exam
→◇[QZ] CSOPESY Practice Quiz 1 - OS Foundations
→◇[QZ] CSOPESY Practice Quiz 2 - CPU Scheduling
→◇CSOPESY 08 - Main Memory
→◇CSOPESY 09 - Virtual Memory
→◇[REV] NSCOM03 Finals Reviewer
→◇Review of Physical and Data Link Layer
→◇Physical Communication Layer
→◇Digital Transmission
→◇Digital to Analog Transmission
→◇Multiplexing
→◇Error Detection
→◇Media Access Control
→◇Data Link Protocols (LAN)
→◇Data Link Protocols (WANs)
→