4rd Semester
Algorithm
Math 4
Book :
Mid :
Final :
Bangladesh Studies
Physics 2
3rd Semester
Data Structure
Note :
Mid :
- Lecture 1.1 – Introducing Data Structure
- Lecture 1.2 – 1D Array
- Lecture 2.1 – 2D Array , String
- Lecture 2.2 – Pointer & Structure
- Lecture 3.1 – Stack
- Lecture 3.2 – Queue
- Lecture 4.1 – Circuler Queue
- Lecture 4.2 – Stack & Queue Application
Final :
- Lecture 8.1 – Linked List
- Lecture 8.2 – Linked List
- Lecture 9.1 – Tree
- Lecture 9.2 – Binary Search Tree
- Lecture 10.1 – Binary Search Tree
- Lecture 10.2 – Heap
- Lecture 11.1 – Heap
- Lecture 11.2 – Graph
- Lecture 12.1 – Spanning Tree
- lecture 12.2 – Graph Traversing and Searching
- Lecture 13 – Graph Traversing and Searching
Data Structure Lab
Note :
Mid :
- Lecture 1.1 – Introducing Data Structure
- Lecture 1.2 – 1D Array
- Lecture 2.1 – 2D Array , String
- Lecture 2.2 – Pointer & Structure
- Lecture 3.1 – Stack
- Lecture 3.2 – Queue
- Lecture 4.1 – Circuler Queue
- Lecture 4.2 – Stack & Queue Application
Final :
- Lecture 8.1 – Linked List
- Lecture 8.2 – Linked List
- Lecture 9.1 – Tree
- Lecture 9.2 – Binary Search Tree
- Lecture 10.1 – Binary Search Tree
- Lecture 10.2 – Heap
- Lecture 11.1 – Heap
- Lecture 11.2 – Graph
- Lecture 12.1 – Spanning Tree
- lecture 12.2 – Graph Traversing and Searching
- Lecture 13 – Graph Traversing and Searching
2nd Semester
Object Oriented Programming
Note :
Mid Lab Task :
Final Lab Task :
Mid :
- Lecture 0 – Course Introduction
- Lecture 1.1 – Introducing Java
- Lecture 1.2 – Java Environment Setup
- Lecture 2.1 – Data Type & Type Casting
- Lecture 2.2 – Class & Object
- Lecture 3.1 – Variable Types
- Lecture 3.2 – Static Block
- Lecture 3.3 – String & Scanner
- Lecture 4.1 – Array
- Lecture 4.2 – Encapsulation
- Lecture 5 – Inheritance
Final :
Math 2
Discrete Math
Book :
Mid :
- Lecture 1.1 – Introduction
- Lecture 1.2 – Propositional Logic
- Lecture 2 – Propositional Logic 2
- Lecture 3 – Propositional Equivalence
- Lecture 4 – Predicates Quantifiers
- Lecture 5 – Functions
- Lecture 6 – Functions Cont.
- Lecture 7 – Sets
- Lecture 8- Set Operators
- Lecture 9 – The Integers & Division
- Lecture 10 – Primes & GCD
- Lecture 11 – Review Class
Final :
- Lecture 12 – Matrices Mathlnduction
- Lecture 13 – Relations & Their Properties
- Lecture 14 – Pigeonhole Principle
- Lecture 15 – Graphs
- Lecture 16 – Graphs Representation – Isomorphism
- Lecture 17 – Connectivity
- Lecture 18 – Euler Hamilton Paths
- Lecture 19 – Planar Graphs – Graph Coloring
- Lecture 20 – Introduction Trees
- Lecture 21 – Intro Trees Cont
- Lecture 22 – Tree Application
- Lecture 23 – Tree Traversal
- Lecture 24 – Infix, Prefix & Postfix
1st Semester
Introduction to programming
Learning website :
Note :
Mid Slide :
- Lecture 2 – Data Types
- Lecture 3 – Conditional Statements
- Lecture 4 – Loops
- Lecture 5 – Array
- Lecture 6 – String
- Lecture 7 – Pointer
- Lecture 8 – Function
Final Slide :
Introduction to programming lab
Learning webiste :
Note :
Lab Task Mid:
Lab Task Final :
Math
Physics
Physics lab