## Converting Context Free Grammar to Chomsky Normal Form

Prerequisite – Simplifying Context Free Grammars A context free grammar (CGF) is in Chomsky Normal Form (CNF) if all production rules satisfy one of the… Read More »

Prerequisite – Simplifying Context Free Grammars A context free grammar (CGF) is in Chomsky Normal Form (CNF) if all production rules satisfy one of the… Read More »

String is an important topic from GATE exam point of view. We will discuss key points on strings as well different types of questions based… Read More »

In this article, we will discuss some important concepts related to arrays and problems based on that. Before understanding this, you should have basic idea… Read More »

AVL tree is binary search tree with additional property that difference between height of left sub-tree and right sub-tree of any node can’t be more… Read More »

In this article, we will discuss different types of problems based on B and B+ trees. Before understanding this article, you should understand basics of… Read More »

Most important day for any GATE aspirant is the D-day, the day of GATE exam. The day, for which you all have been working so… Read More »

In this article, we will discuss the types of questions based on hashing. Before understanding this, you should have idea about hashing, hash function, open… Read More »

Huffman Encoding is an important topic from GATE point of view and different types of questions are asked from this topic. Before understanding this article,… Read More »

Que – 1. For 8 keys and 6 slots in a hashing table with uniform hashing and chaining, what is the expected number of items… Read More »

Que – 1. The function shiftNode() which takes as input two linked lists- destination and source. It deletes front node from source and places it… Read More »

Minimum spanning Tree (MST) is an important topic for GATE. Therefore, we will discuss how to solve different types of questions based on MST. Before… Read More »

In this article, we will discuss important properties of different sorting techniques including their complexity, stability and memory constraints. Before understanding this article, you should… Read More »

In this article, we will see how we can solve different types of recurrence relations using different approaches. Before understanding this article, you should have… Read More »

Prerequisite – Number System and base conversions, BCD(8421) In Binary Coded Decimal (BCD) encoding scheme each of the decimal numbers(0-9) is represented by its equivalent… Read More »

In this article, we will discuss complexity of different operations in binary trees including BST and AVL trees. Before understanding this article, you should have… Read More »