Lalit Vashishtha

Information & Entropy

How to solve problems on Galois Field

Irreducible Polynomials in GF(2) of degree 1, 2 and 3.

Irreducible Polynomials in gf(3)(2x and 2x+1 are reducible polynomials)

Galois Field {GF(2), GF(3), GF(5), GF(7)}

Extension of GF(2) to GF(4)

Convolution Encoder- Input State Transition Diagram, Trellis Diagram.

Problem on Convolution Encoder.

SOURCE CODING THEOREM

KRAFT'S INEQUALITY & VARIABLE CODES

FIXED LENGTH CODES, VARIABLE LENGTH CODE AND HUFFMAN CODING

PROBLEM ON TERNARY HUFFMAN CODE

To find even odd numbers using bitwise AND operator

Right Linear Grammar and Left Linear Grammar Example1

ARITHMETIC CODING

Construction of BST and deletion of nodes

Right Linear Grammar and Left Linear Grammar Example3

Ambiguous Grammars

Queue implementation using linked list (insertion)

PARITY CHECK MATRIX

Closure Properties of Context Free Languages1

Applying left factoring to convert the grammar into Deterministic grammar

SYNTAX DIRECTED TRANSLATION 2

Finding Context Free Grammar for Some Languages1

Finite Automata to Regular Expression conversion 1

LEMPEL-ZIV ALGORITHM

DFA for union, intersection, difference and complimentation of two dfas

Stack implementation using array

Push Down Automata for Context Free Grammar1

Addition Table of GF(8)2

Sum of even indices and odd indices elements

Set, Group and Commutative Group

Display the elements of circular queue

C code for even odd numbers using shift operator

CODE RATE AND LINEAR CODES

Display the elements of the stack

To find even odd number using * and /

FINDING THE ADDRESS OF AN ELEMENT IN COLUMN MAJOR ORDERING IN A MATRIX

Right Linear Grammar and Left Linear Grammar Example2

Dynamic memory allocation using realloc( ) function

Binary Search Tree (BST)

Example on Call by reference

INSERTION IN A LINKED LIST PROGRAM

Popping an element from the stack using linked list

CONTEXT FREE GRAMMAR

3 ADDRESS CODE REPRESENTATION FOR C CODE SEGMENT 3

Tree Basics 1

WORST CASE TIME COMPLEXITY OF AN ALGORITHM 3

Passing the reference of the variables to the function

WORST CASE TIME COMPLEXITY OF AN ALGORITHM 2

Right Linear Grammar and Left Linear Grammar, Finite automata construction using regular grammar

Addition table modulo5 with identity and inverse

RECURSIVE DESCENT PARSER

3 ADDRESS CODE REPRESENTATION FOR C CODE SEGMENT 4(Interchange line no 2 and 3 in 3-address code)