Computer Fundamentals

Course name : Computer Fundamentals


Go to the link below to download. Wait 5 sec and click "SKIP AD"

Chapter 1

Chapter 2

Chapter 3

Chapter 5

Chapter 6

Chapter 7

Chapter 8

Chapter 9

Chapter 10

Solution of the Questions for v4.1

Solution of the Questions for v5.1

Some Questions for CF Final Xm

How to setup Desktop

How to setup Laptop

Thanks for being with us.


-AIUB Helpline.

Algorithm

Course name : Algorithm


Go to the link below to download. Wait 5 sec and click "SKIP AD"

Reference Books :

Download link : Introduction to Algorithm - 3rd Edition

Download link : Fundamentals of Computer Algorithms By Ellis Horowitz & Sartaj Sahni

Questions :

Mid_Fall 2011-12 by Sheikh Shaugat Abdullah

Mid_Fall 2012-13 by Sazedul Alam Sir

Mid_Fall 2013-14 by Rafiq Sir

Mid_Fall 2013-14 by Shaugat Sir

Mid_Fall 2013-14 by Titu Sir

Final_Summer 2011-12 by Sazedul Alam, Sheikh Shaugat Abdullah

Final_Fall 2012-13 by Sazedul Alam

Shaugat Sir:

Introduction

Reccurence

Dynamic

Dynamic Programming

Dollars

Making Change

Stacking Boxes

String Computer

The Tower of Babylon

Tower of Cubes

Unidirectional TSP

What Goes Up

Mat Chain Code

Mat Chain Simulation

Dynamic Knapcask

Greedy

Graph Representation

Graph Introduction

Graph Algorithm

Prim's Algorithm

Shortest Path

Bellman Ford Algorithm

Bellman Ford example

NP1

Making Change

Skyline

Abdus Salam Titu Sir:

Introduction

Reccurence

Dynamic

Codes:

Merge Sort

Max_Recursiv

MCM

LCS

BFS

DFS

Priority Queue

Prime

Graph Introduction

code: Neighbors of node

Graph Algorithm

Shortest Path

Debajyoti Karmaker Jitu Sir:

Introduction to Algorithms

Analysis of Algorithms

Analysis of Algorithms 2

nlogn Barrier

Lab 1

Codes:

MaxMin

Min1Min2

Assignment

Graph Introduction

Rafiq Sir:

BACKGROUND

INTRODUCTION

PROBLEM SET 1

ASYMPTOTIC NOTATION

PROBLEM SET 2

DIVIDE-CONQUER

GREEDY METHOD

Dynamic Programming 1

Dynamic Programming 2

Dynamic Programming 3

Graph - Search

Graph - Shortest Path 1

Graph - Shortest Path 2

Graph - Spanning Tree

Sazedul Alam Sir:

Introduction

Reccurence

Dynamic

Dynamic knapcask

Greedy

Codes:

Fibonacci

DFS

Divide and Conquer

Merge Sort

MaxMin

Input

Edges

Tree

TS

Topological Sort

Graph Introduction

Graph Algorithm

Shortest Path

Thanks for being with us.


-AIUB Helpline.
 

Assignment Cover Page

AIUB Assignment Cover Page.

Go to the link below. Wait 5 sec and click "SKIP AD"






Download Link : AIUB Assignment Cover Page



Thanks for being with us.


-AIUB Helpline.