Conversion from Infix expression to Prefix Expression(POLISH Notation) using STACK || Data Structure

Linked List & it's types || Linear DS || Singly, Doubly & Circular LL || Data Structure (GTU)

Instruction Formats || 3, 2, 1, 0 - address Instruction || Computer Organization & Architecture(GTU)

Binary Search Tree(BST) - Non-Linear|| Inorder, Preorder, Postorder Traverser|| Data Structure (GTU)

4 bit Binary Adder Subtractor || Computer Organization & Architecture (GTU)

4 bit Binary Incrementer || Computer Organization & Architecture (GTU)

4 bit binary adder circuit || Computer Organization & Architecture (GTU)

Common Bus system using three state buffer|| tri state buffer ||Computer Organization & Architecture

Common BUS System using Multiplexer || Data transfer using MUX||Computer Organization & Architecture

Memory Reference Instructions || Basic Computer || Computer Organization & Architecture || COA (GTU)

Direct Address & Indirect Address || Addressing Modes || Computer Organization & Architecture (GTU)

Basic Computer Instruction Format || Computer Organization & Architecture || Instruction Formats GTU

Instruction Cycle : Computer Organization & Architecture (COA) || Basic Computer Organization (GTU)

Data Structure: conversion from Infix expression to Postfix (Reverse Polish Notation) using Stack

Data Structure : Linear Queue (Simple Queue) || Linear Data Structure

Conversion from Infix expression to Prefix Expression(POLISH Notation) using STACK || Data Structure

Application of Stack- Reverse a string, Expression Conversion, Expression Evaluation

DATA STRUCTURE - QUEUE implementation using ARRAY (C Program)

DATA STRUCTURE - STACK implementation using ARRAY (C Program)

Data Structure - Circular Queue

DATA STRUCTURE - STACK

Data Structure - Introduction

PPS : Dynamic Memory Allocation (Part -2 )

PPS : Dynamic Memory Allocation (part -1)

Direct Memory Access(DMA) - Computer Organization and Architecture