Check if the given permutation is a valid DFS of graph
Given a graph with N nodes numbered from 1 to N and M edges and an array of numbers from 1 to N. Check if… Read More »
Category Archives: Technical Scripter
Combinatorics on ordered trees
An ordered tree is an oriented tree in which the children of a node are somehow ordered. It is a rooted tree in which an… Read More »
Numbers within a range that can be expressed as power of two numbers
Given two integers L and R. Find the number of perfect powers in the given range [L, R]. A number x is said to be… Read More »
Symbol Table in Compiler
Prerequisite – Phases of a Compiler Symbol Table is an important data structure created and maintained by the compiler in order to keep track of… Read More »
Error detection and Recovery in Compiler
In this phase of compilation, all possible errors made by the user are detected and reported to the user in form of error messages. This… Read More »
Powers of 2 to required sum
Given an integer N, task is to find the numbers which when raised to the power of 2 and added finally, gives the integer N.… Read More »
Count number of distinct sum subsets within given range
Given a set S of N numbers and a range specified by two numbers L (Lower Bound) and R (Upper Bound). Find the number of… Read More »
Digital Logic | Implicants in K-Map
Prerequisite – K – Map (Karnaugh Map) Implicant is a product/minterm term in Sum of Products (SOP) or sum/maxterm term in Product of Sums (POS)… Read More »
Compiler Design | Syntax Directed Definition
Prerequisite – Introduction to Syntax Analysis, Syntax Directed Translation Syntax Directed Definition (SDD) is a kind of abstract specification. It is generalization of context free… Read More »
Assigning multiple characters in an int in C language
Consider the following C program. Output : 100 25700 We can easily guess that the output for ‘d’ is 100 as 100 is ASCII value… Read More »
Getting started with Scikit-image: image processing in Python
scikit-image is an image processing Python package that works with numpy arrays which is a collection of algorithms for image processing. Let’s discusses how to… Read More »
UDP Client Server using connect | C implementation
UDP is a connection less protocol. There is no connection is established between client and server. Creating Standard UDP Client/Server is discussed here Prerequisite :… Read More »
Computer Network | Address Resolution in DNS
Prerequisite – Domain Name Server Mapping a domain name to an IP Address is known as Name-Address Resolution. The Domain Name Server (DNS) Resolver performs… Read More »
Advanced master theorem for divide and conquer recurrences
Master Theorem is used to determine running time of algorithms (divide and conquer algorithms) in terms of asymptotic notations. Consider a problem that be solved… Read More »
Euler Tour | Subtree Sum using Segment Tree
Euler tour tree (ETT) is a method for representing a rooted tree as a number sequence. When traversing the tree using Depth for search(DFS), insert… Read More »