Software Engineering Object Oriented Programming (OOP) in Rust We have explored Object Oriented Programming (OOP) in Rust and covered topics like Object, Encapsulation, Inheritance, Polymorphism and others along with Rust code examples.
Theory of Computation Church Turing Thesis in Theory of Computation We have explain the meaning and importance of Church Turing Thesis in Theory of Computation along with its applications and limitations.
Theory of Computation Pumping Lemma Questions We have presented some Questions which can be solving using Pumping Lemma in Theory of Computation. You must try these questions to test your understanding of Pumping Lemma before your examination.
Algorithms Longest Increasing Consecutive Subsequence We have to find the Longest Increasing Consecutive Subsequence in N elements. We can solve this problem efficiently using Dynamic Programming in O(N) time.
Software Engineering Introduction to Vue Vue is a progressive JavaScript front-end framework which was developed for creating user interfaces and it could be effectively used to develop Single Page Applications (SPAs).
Software Engineering Context Switching in OS We have discussed about Context Switching, which is one of the most important and fundamental topics in Operating Systems.
Algorithms Find Peak Element in an Array We have explained the problem of finding Peak Element in an Array along with different approaches to solve it efficiently.
Data Structures Design data structure that support insert, delete and get random operations We will understand in depth the designing of a data structure that supports "insert value", "delete value" and "get random" operations where these tasks are performed in constant time O(1).
Algorithms Majority Element in an array We have discussed algorithmic techniques to find the majority element in an array. The brute force algorithm takes O(N^2) time while the most efficient algorithm can do it in O(N) time.
Data Structures "Design a Data Structure" problems We have present some must practice "Design a Data Structure" problems. These are important problems for Coding Interviews at Google and other companies. You need to modify standard data structure to form new data structures to solve this problem efficiently.
Theory of Computation Pumping Lemma in Theory of Computation Pumping Lemma in Theory of Computation is a theorem that is used to determine if a given string is in a regular language L or a Context Free Language (CFL). We have explained the theorem in depth and presented problems that can be solved using the theorem.
Theory of Computation Context free grammar (CFG) for Balanced Parentheses We have presented the Context free grammar (CFG) for properly nested parentheses or Balanced Parentheses / Expressions using all three set of brackets.
Software Engineering Inter-process communication (IPC) & IPC types in OS We have explained Inter-process communication (IPC) in Operating System, why is IPC needed and various ways to achieve IPC like using shared memory, message passing, buffering, pipes and more.
Machine Learning (ML) Dense Layer in Tensorflow We have explained Dense Layer in Tensorflow with code examples and the use of Dense Layer in Neural Networks.
Software Engineering __builtin_popcount and POPCNT We have explored about __builtin_popcount - a built-in function of GCC, which helps us to count the number of 1's(set bits) in an integer in C and C++. POPCNT is the assembly instruction used in __builtin_popcount.
Software Engineering Structure (struct) in C [Complete Guide] A structure is defined as a collection of same/different data types. All data items thus grouped logically related and can be accessed using variables.
Machine Learning (ML) Applications of Machine Learning We have covered common ML tasks/ applications with respect to image and textual data along with the models used and examples of its use in various domains.
Software Engineering Size of struct in C/ C++ We have explained how to calculate the memory size of a struct in C and C++ Programming Language. To find the actual size, you need to understand two concepts of padding and packing. The size is not the sum of individual elements so read on.
Machine Learning (ML) Early Exit in ML models How does the addition of early exits improve the performance of the neural networks and what are the other additional advantages it provides to the model.
Algorithms Applications of XOR operation We will begin with a brief introduction of what the XOR operation is, followed by its syntax in C++ and its applications such as memory-optimized doubly linked lists, swapping, XOR ciphers, Comparing two values, Gray codes and Partiy check.
Machine Learning (ML) The ShuffleNet Series (Part 1) The breakthrough CNN architecture for object classification in mobile devices, ShuffleNet has been explained in-depth in this article. Its newer and better versions ShuffleNet V2, V2+, Large & X-Large has also been elucidated.
Software Engineering Jinja Template for Django Framework We have explored the Jinja Template. Jinja is a modern, designer-friendly templating language for python, modeled after Django templates and is widely used for execution.
Algorithms Adding 2 integers as linked lists We will represent an Integer as Singly Linked List and define an addition algorithm to add two integers as Linked Lists. This is used to add very large integers which is not stored in existing data types.
Python With statement in Python We have covered what is the With statement in Python and how to use it along with the idea of Context Manager in Python.
Graph Algorithms 100+ Graph Algorithms and Techniques [Complete List] We have listed 100+ problems on Graph data structure, Graph Algorithms, related concepts, Competitive Programming techniques and Algorithmic problems.
