Scribd
Upload
14 views2 pages

Computer Science Notes

The document provides notes on programming and data structures, covering key programming paradigms such as procedural and object-oriented programming. It discusses data types, control structures, and various data structures including arrays, linked lists, stacks, queues, trees, and graphs. Essential concepts like LIFO and FIFO for stacks and queues, as well as searching algorithms for trees and graphs, are also highlighted.

Uploaded by

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

Computer Science Notes

The document provides notes on programming and data structures, covering key programming paradigms such as procedural and object-oriented programming. It discusses data types, control structures, and various data structures including arrays, linked lists, stacks, queues, trees, and graphs. Essential concepts like LIFO and FIFO for stacks and queues, as well as searching algorithms for trees and graphs, are also highlighted.

Uploaded by

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

Computer Science Class Notes: Programming & Data Structures

# Computer Science Class Notes: Programming & Data Structures

## Programming

### 1. Programming Paradigms

- **Procedural Programming**: Based on functions (C, Python).

- **Object-Oriented Programming (OOP)**: Uses classes & objects (Java, C++).

### 2. Data Types & Variables

- **Primitive Types**: int, float, char, boolean.

- **Composite Types**: Arrays, lists, dictionaries.

### 3. Control Structures

- **Conditional Statements**: if, else, switch.

- **Loops**: for, while, do-while.

## Data Structures

### 1. Arrays & Linked Lists

- **Arrays**: Fixed-size, random access.

- **Linked Lists**: Dynamic size, sequential access.

### 2. Stacks & Queues

- **Stack**: LIFO (Last In, First Out).

- **Queue**: FIFO (First In, First Out).


### 3. Trees & Graphs

- **Binary Search Tree (BST)**: Fast searching.

- **Graphs**: Nodes & edges (DFS, BFS algorithms).

You might also like