October 2022

What is the difference between full duplex and half duplex and simplex in computer networking

LIFO - last in first out and FIFO - First in First out

LIFO and FIFO are two methods of storing data in a data structure. They also define the order in which data enters/exits the data ...

Understanding Stack Data Structure and Implementing it using Arrays and Linked Lists in C

Introduction to Queue Data Structure in C: Implementation, Operations and Algorithm

A simple graph has 9 edges, 3 vertices of degree 4 and all others of degree 2. How many vertices does the graph have?

Difference between the Minimum spanning tree (MST) and the Shortest path tree

Understanding Spanning Trees and Minimum Cost Spanning Trees: Prim's and Kruskal's Algorithm Explained and Their Differences

A spanning tree is like a snapshot of a connected graph, capturing the essence of its undirected and interconnected nature. Minimum Cost S...

Three Level ANSI SPARC Architecture

Back in 1975, ANSI SPARC recognized the need for a comprehensive three-level approach, consisting of three distinct levels of abstraction: o...

How does Dijkstra's Algorithm work in finding the shortest path in a graph

Dijkstra’s Algorithm

Operating Systems: An Overview of Functions and Types