Data Structures And Algorithms For Stack, Queue & LinkedList

Data Structures And Algorithms For Stack, Queue & LinkedList

Learn Data Structures and algorithms for Stack, Queue and Linked List from scratch using C programming.

 

What you’ll learn

  • Stack, Bracket checker program, Polish Notations infix to postfix conversion, FIFO Queue, Circular Queue, Double Ended Queue, Linked List – Linear, double and Circular – all operations, Stack and Queue using Linked List
  • What is Data Structures And Algorithms For Stack, algorithms for Push and Pop operation. Implementation of Stack data structure using C.

  • Data Structures And Algorithms For Stack Using Stack – checking brackets in an expression

  • Data Structures And Algorithms For Stack Using Stack – Understanding Polish notations, algorithm and implementation of infix to postfix conversion and evaluation of postfix expression
  • What is a FIFO Queue, understanding Queue operations – Insert and delete, implementing FIFO Queue
  • Limitations of FIFO queue, concept of Circular Queue – Implementation of Circular queue.
  • Concept of Double ended queue, logic development and implementation of double ended queue.
  • Concept of Linked List – definition, why we need linked list.
  • Singly Linked List – developing algorithms for various methods and then implementing them using C programming
  • Doubly Linked List – developing algorithm of various methods and then implementing them using C programming
  • Circular Linked List – developing algorithm of various methods and then implementing them using C programming
Requirements
  • Student should be conversant with basic C programming.

Description

You will learn the following: 

  1. Fundamental of Data Structures And Algorithms For Stack concept
  2. Why we need Data Structures And Algorithms For Stack
  3. Stack – Idea, definition, algorithm, implementations.
  4. Using Stack – Parenthesis checking, Polish Notation, Infix to postfix conversion and evaluation.
  5. FIFO Queue – Idea, definition, algorithm, implementation.
  6. Circular Queue using array – Idea, definition, algorithm, implementation.
  7. Double ended queue using array – Idea, definition, algorithm, implementation.
  8. Linked List – Idea, definition, why we need linked list. Comparison with array.
  9. Singly Linked List – Development of algorithm for various operations and then Implementation of each of them
  10. Creating Stack and Queue using Singly Linked list – Implementation.
  11. Doubly Linked List – Idea, definition, algorithm of various operations and implementations.
  12. Circular Linked List – Idea, definition, algorithm and implementations.
Who this course is for:
  • Students who are looking forward to be an efficient programmer, who are having data structures in their syllabus.
  • Students who wants to have in dept knowledge about the Stack, Queue and Linked List.
Created by Shibaji Paul
Last updated 5/2017
English
English [Auto-generated]
 

Size: 1.25GB

DOWNLOAD TUTORIAL

1 Comment
  1. kardo says

    transalte ke indonesia

Leave A Reply

Your email address will not be published.