Scribd
Upload
74 views1 page

Computer science notes

The document provides an overview of Computer Science, covering key areas such as programming, data structures, algorithms, databases, and operating systems. It discusses programming basics including languages, syntax, and control structures, as well as various data structures like arrays, linked lists, and trees. Additionally, it highlights important algorithms, database concepts, and operating system functions and types.

Uploaded by

popinog661
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
74 views1 page

Computer science notes

The document provides an overview of Computer Science, covering key areas such as programming, data structures, algorithms, databases, and operating systems. It discusses programming basics including languages, syntax, and control structures, as well as various data structures like arrays, linked lists, and trees. Additionally, it highlights important algorithms, database concepts, and operating system functions and types.

Uploaded by

popinog661
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as TXT, PDF, TXT or read online on Scribd
You are on page 1/ 1

1.

Introduction to Computer Science


Computer Science is the study of algorithms, programming, data structures, and
computational theory to solve problems efficiently using computers.
Key areas include software development, artificial intelligence, databases,
cybersecurity, and networking.
2. Programming Basics
Programming Languages: Python, Java, C++, JavaScript, etc.
Syntax & Semantics: Rules for writing correct code.
Variables & Data Types: Integer, Float, String, Boolean, etc.
Control Structures: If-else, loops (for, while).
Functions: Code reuse, modularity, parameters, return values.
3. Data Structures
Arrays: Fixed-size collection of elements.
Linked List: Nodes connected by pointers (Singly, Doubly, Circular).
Stacks: LIFO (Last In, First Out) structure.
Queues: FIFO (First In, First Out) structure.
Trees: Hierarchical structure (Binary Tree, BST, AVL Tree).
Graphs: Nodes (vertices) connected by edges (BFS, DFS).
Hash Tables: Key-value storage for fast lookups.
4. Algorithms
Sorting Algorithms: Bubble Sort, Merge Sort, Quick Sort.
Searching Algorithms: Linear Search, Binary Search.
Graph Algorithms: Dijkstra’s Algorithm, Floyd-Warshall.
Dynamic Programming: Optimization technique (Fibonacci, Knapsack Problem).
5. Databases
SQL (Structured Query Language): Used for relational databases (MySQL, PostgreSQL).
NoSQL Databases: MongoDB, Redis (for non-tabular data).
Normalization: Reducing data redundancy.
Transactions & ACID Properties: Atomicity, Consistency, Isolation, Durability.
6. Operating Systems
Functions: Process management, memory management, file system, security.
Types: Windows, Linux, MacOS, Unix.
Process Scheduling Algorithms: FCFS, Round Robin, Shortest Job First.
Deadlocks & Synchronization: Mutual exclusion, critical section problem.

You might also like