1. Home
  2. /
  3. Computer Science
  4. /
  5. Page 4

Tutorial Series: Computer Science

The study of computers and computing technologies, including their design, development, and application, is known as computer science. It covers a wide range of subjects, including artificial intelligence, computer architecture, programming languages, algorithms, data structures, software engineering, and more.

Understanding how computers operate and how to utilize them to carry out activities and solve issues across a range of industries is the focus of computer science. It is a very multidisciplinary area that incorporates ideas from physics, engineering, mathematics, and other fields.

A vast range of businesses, including software development, data analysis, robotics, artificial intelligence, and more, employ computer science. In order to comprehend complicated systems and events, computer models and simulations are utilized in study domains including computational biology, computational chemistry, and computational physics.

In the discipline of computer science, new methods and technologies are continually being developed. So, in order to stay current and continue to be productive in their profession, computer scientists must constantly acquire new information and adapt to changing circumstances. They could work in a range of contexts, such as non-profit organizations, government, industry, and academia.

Edge List

Edge list is the simplest way for graph representation. let’s say we have a graph with 5 nodes like the one below.There are 5 nodes named 0, 1, 2, 3,...

Adjacency Matrix

We can represent a graph with a matrix. In the unweighted graph, We can create a matrix with 0 and 1. Here 0 means there is no edge and 1 means there is an edge....

Adjacency List

An adjacency list represents a graph as an array of linked lists. The index of the array represents a vertex and each element in its linked list represents the other...

Breadth First Search Algorithm (BFS)

Breadth-first search (BFS) is an algorithm for traversing or searching a graph or tree data structure. It starts at a chosen vertex (or node) of a graph and explores...

Depth First Search Algorithm (DFS)

Depth first search in short form DFS is a graph traversal algorithm. The time complexity of DFS is O(V+E) where V is the number of vertex and E is the number of...

Single Source Shortest Path in an Unweighted Graph

In this tutorial, we will discuss how to find the shortest path in an unweighted graph. In an unweighted graph, no edges have weight or all edges have the same weight....

0-1 BFS Algorithm

Introduction to 1-0 BFSIn this Tutorial, we will discuss 0-1 BFS. BFS is a prerequisite for this blog. If you don’t know how BFS works, learn it Breadth...

Check Whether a Graph is Bipartite

If a graph’s node can be divided into two disjoint sets so that every edge connects two nodes of different sets then this graph is a bipartite graph. In another...

Linked List

A linked list is a linear data structure. In the Linked list, we connect some nodes one after another. Every node consists of the value and address of other nodes.A...

Doubly Linked List

In the previous tutorial, we learned about the Singly Linked List. In this tutorial, we will learn about the doubly linked list.If you don’t know about the...

Check Our Ebook for This Online Course

Advanced topics are covered in this ebook with many examples.

Python updating dictionary with new keys
Brief about dictionaryIn Python, a dictionary is a collection of key-value pairs....
Python Print Flush Method
Best way to Flush the Print Function’s OutputThe print() function in Python automatically...
Python Basic - How to use String in python
What is String in python?The string is the most important data type in Python. A set of characters...