### Link list operation in C

In computer science, a linked list is a data structure consisting of a group of nodes which together represent a sequence.
Example:

## Input and output in file :

For taking input and produce output from a file, at first we need to create 2 text file which mean the file extension must be .txt . The file have to create in the location in which we will save our java
source code.

## Topological sort:

In computer science, a topological sort or topological ordering of a directed graph is a linear ordering of its vertices such that for every directed edge uv from vertex u to vertex v, u comes before v in the ordering.
For example, in following  Directed graph , the first black vertex or in which vertex DFS find finish time should place in the last of the output. Here , DFS start traverse from Shirt, but first finished time is jacket .  So it goes to the last position of stack or link list.

 Topological sort

## Bubble sort algorithm implementation in java:

Bubble sort, sometimes referred to as sinking sort, is a simple sorting algorithm that works by repeatedly stepping through the list to be sorted, comparing each pair of adjacent items and swapping them if they are in the wrong order. The pass through the list is repeated until no swaps are needed,
which indicates that the list is sorted.

## Binary search:

Binary search is searching algorithm which can search first-er then Sequential search. It's executes in O(log N) time.
A binary search can
only be performed if the list is in sorted order.

## Binary search:

Binary search is searching algorithm which can search first-er then Sequential search. It's executes in O(log N) time.
A binary search can
only be performed if the list is in sorted order.

Here is Java code of  Binary search :

### Breadth First Search ( BFS ) in java

Breadth First Search ( BFS ) is a searching algorithm which search the destination from root or source and explore all the neighbor nodes first, before moving to the next level neighbors. The animation will make this more clear.

The following code is to implement Breadth First Search ( BFS ) in java

## Depth-First Search

Depth First Search ( DFS ) is a searching algorithm which start searching the destination from the root to the last depth of the each branch first, then go to the next branch to search the destination.
The animation will make the concept more clear.

To learn DFS, you can download a complete power point  slide on DFS.

## CSS Bangla book

For learning CSS in Bangla language , collect this book from here.

## Background

Problems in Computer Science are often classified as belonging to a certain class of problems (e.g., NP, Unsolvable, Recursive). In this problem you will be analyzing a property of an algorithm whose classification is not known for all possible inputs.

## Poster presentation:

Presenting something by a poster is called Poster presentation. Poster may vary due to the presentation topic. But most of the poster looks like this:

The poster contain some points

## Bangla HTML Book:

For Bangla HTML learning, one of the best book is here. You can collect this book in Pdf format from here.