Knowledge in stacks and queues

Computer Architecture and Organization

Computer Architecture and Organization Instruction Sets: Addressing Modes and Formats Addressing Modes Immediate Direct Indirect Register Register Indirect Displacement (Indexed) Stack

DATA STRUCTURES

This file contains an important concept Data Structures which means a back bone to engineering .They are important because, they are what you do after you've become a computer scientist. Without,data structures and algorithms, you will be only a monkey coder. ... Data structures refers to the way we organize information on our computer.It is axiom that data structures and algorithms are base of computer science. It is actual computer science. Any developer or cs student must have to write code which provides a required output. ... Using combination of data structure and algorithms, we can improve performance of program drastically.

Introduction to Data structures

This article and matter is prepared by experienced faculty of snist for the better and easy understanding of students. This PDF contains introduction to data structures,abstract data type, stacks, queues and their applications etc.

Data structures - Part 1

This article and matter is prepared by experienced faculty of snist for the better and easy understanding of students. This PDF contains information about singly linked list, doubly linked list, circular linked lists, representing stacks and queues using linked list.

Data structures - part 2

This article and matter is prepared by experienced faculty of snist for the better and easy understanding of students. This PDF contains information about trees and graphs along with their terminology and representation etc.

Data Structures Unit 3 Stack

This attachment contains knowledge about basic terminologies used in linear data structure. This contains terms used in stack and definition and description of stack. also it has various operations performed on stack. Insertion in stack using push operation. Deletion in stack using pop operation. Description of terms like maxstack, i.e. the maximum no. of elements any stack can hold. Also has information about array representation of stack using various notations like polish and non-polish notation. Prefix notation, postfix notation and infix notation. Evaluation of postfix expression. Evaluation of infix notation.

Data Structures Unit 4 Queue

This attachment contains knowledge about basic terminologies used in linear data structure. This contains terms used in queue. The basic operations on queue. Insertion in queue and deletion in queue. Front and rear in queue. Linked representation in queue.

Stack

This article is about Stack on Data structures with Its introduction and Implementation Using Arrays and pointers

C program to implement queue using circular array.

This PPT contains C program to implement queue using circular array.

Stack and queues in data structures and algorithms.

This PPT contains concepts of stack and queues in data structures and algorithms.

Notes on stack

This word file contains notes on stack and its various processes and its steps.

Queues

This clip contains notes on queues