OpenGenus IQ: Learn Algorithms, DL, System Design (Page 73)

Distributed File System

In this article, we have explored the idea of Distributed File System in depth along with the techniques and features of a Distributed File System. We have covered different examples of Distributed File System like Google File System.

Linux

Introduction to Linux Networking

The Linux operating system runs on two-thirds of all servers on the internet and networking is a very important aspect for computers. In this article we give an introduction to Linux networking with five commonly used networking commands.

Linux

Curl command in Linux

Curl is a tool used for data transfer between client and server and support many protocols and functionalities such as authentication, proxies and much more. In this article we have discussed commonly used curl commands.

Linux

Find command in Linux

The find command will return all files in the current working directory and can specify an action to be performed once a match is found. In this article we have discussed commonly used find commands that improves the efficiency of Linux users.

Linux

Grep command in Linux

The grep command is a very useful Linux command used to search a file for a specified string or pattern. In this article we discuss common grep commands you can use to improve your linux experience.

Algorithms

Detect Cycle in Undirected Graph using Union Find algorithm

In this article, we've explored the approach to detect a cycle in undirected graph using union-find algorithm. This takes O(VE) Time Complexity.

Linux

Top Command in Linux

In this article, we have explored Top Command in Linux and showed the various information we can get from this command. You should definitely know this command effectively.

System Design

System Design of YouTube

In this article, we have explored the System Design of YouTube which is a video hosting and sharing platform with over 1 Billion active users. It is the second most used web application just after Google Search.

C++

Reverse Deque in C++ STL

In this article, we have presented different ways to Reverse Deque in C++ STL. This involve the use of reverse iterator of Deque or the Reverse method in C++ STL.

Linux

Sed command in Linux

Some tasks such as searching and replacing text in a text file can be done much more faster and efficiently, in this article we discuss the sed stream editor and some of its useful commands that get the job done.

Linux

Awk command in Linux

Awk is a powerful scripting language used for advanced text processing, in this article we discuss common commands that are used to process text files.

Compiler Design

Compiling logic programs

In this article, we discuss the general compilation technique for a full recursive backtracking search over clauses combined with a full unification of terms.

Compiler Design

Introduction to Logic programming model

In logic programming, the user only has to specify the problem and the system will find the solution based on the provided information however substantial effort is needed to implement a logic language compiler. In this article we discuss how we go about this.

Compiler Design

Run-time environment: Accessing non-local data on Stack

How do we find data within a procedure that does not belong to that procedure, In this article we discuss how to access data that is not local to a procedure on the stack.

Compiler Design

Trace-Based garbage collection

Trace-based collection is garbage collection whereby garbage is collected periodically unlike basic gc where garbage is collected as it is created. In this article we discuss four algorithms for garbage collections and their properties.

Compiler Design

Heap allocation in Compilers

Stack allocations are often restrictive and we may want resizable arrays which can survive function invocations and therefore programming languages allow use of heaps also called dynamic memory allocation. In this article we discuss heap allocation in compilers.

Compiler Design

Stack allocation in Compilers

Stack allocation is a run-time storage management mechanism where by activation records are pushed and popped onto the stack as they begin and end. In this article we discuss stack allocation, activation trees, records, calling sequences and variable-length data on the stack.

Time Complexity

Amortized Time Complexity

In this article, we have explored the concept of Amortized Time Complexity by taking an example and compared it with a related concept: Average Case Time Complexity.

Machine Learning (ML)

SELU (Scaled Exponential Linear Unit) Activation Function

We will look at the very promising but not very common activation function called SELU (Scaled Exponential Linear Unit) and understand its main advantages over other activation functions like ReLU (Rectified Linear Unit). This article presents lots of essential points about this function.

Machine Learning (ML)

MatMul in TensorFlow

In this article, we have explored MatMul operation in TensorFlow (tf.linalg.matmul()) and have presented a sample TensorFlow Python code performing MatMul (Matrix Multiplication).

Data Communication and Computer Networks

Error Detection in Computer Network

In this article, we are going to explore about error detection in computer networks. We will be seeing some standard error detecting codes which help in detecting errors.

Data Communication and Computer Networks

Network Layer Protocols

In this article, we will discuss about the functions of network layer and the protocols that are linked with it.

System Design

How to design a System? (Cheatsheet)

In this article, we have covered the process of developing a system's components, architecture, and interfaces to satisfy end-user needs which is referred to as system design.

Software Engineering

Implementing Random Feature at OpenGenus IQ

I was tasked by OpenGenus to implement a random feature, literally. It was going to be a page that immediately redirected a user to a random opengenus article. So in this article, we will be going through the process of how I developed the random feature.

Time Complexity

Master theorem for Time Complexity analysis

In this article, we have explored Master theorem for calculating Time Complexity of an Algorithm for which a recurrence relation is formed. We have covered limitations of Master Theorem as well.