FreeTutorials us data structures stack queue linkedlist

/01 Introduction to the course/

001 Introduction to the course..mp4

/02 All about Stack/

002 Introduction of Stack.mp4

003 Some practical example where Stack is used..mp4

004 Basic Algorithm for Stack data structure..mp4

005 Implementation of Stack..mp4

006 Some more explanations about the use of Pointers.mp4

007 Building a menu for the implementation..mp4

008 Make the Stack dynamic..mp4

009 Make the stack more dynamic..mp4

010 Stack In Action - Decimal to binary conversion.mp4

011 Stack In Action - Reversing the content of a text file..mp4

/.../004 Basic Algorithm for Stack data structure/

Stack-algo1.pdf

/.../005 Implementation of Stack/

stack.c

/.../007 Building a menu for the implementation/

stack-lec6.c

/.../008 Make the Stack dynamic/

stack-lec7.c

/.../009 Make the stack more dynamic/

stack-lec8.c

/.../010 Stack In Action - Decimal to binary conversion/

print-bin.c

/.../011 Stack In Action - Reversing the content of a text file/

reverse-file.c

/quizzes/

001 Basic understanding of Stack..html

002 Test your understanding on Stack operations.html

/03 Step-by-step developing a parenthesis checking program using Stack/

012 Understanding the problem..mp4

013 Developing the algorithm for bracket checking..mp4

014 The explanation of the algorithm that we develop for parenthesis checking..mp4

015 Implementation of parenthesis checking program - Part 1.mp4

016 Implementation of parenthesis checking program - Part 2.mp4

/.../013 Developing the algorithm for bracket checking/

bracket-checker-algo.txt

/.../015 Implementation of parenthesis checking program - Part 1/

check-bracket.c

/.../016 Implementation of parenthesis checking program - Part 2/

check-bracket.c

/04 Polish notation and Reverse Polish Notation/

017 Introduction to Polish Notation.mp4

018 Understanding precedence of operators conversion idea - infix to prefixpostfix.mp4

019 How to evaluate Polish or Reverse Polish Notations..mp4

020 Algorithm for evaluating Postfix expression..mp4

021 Implementing evaluation of Postfix expression with C Programming language..mp4

022 Discussion on how to convert Infix to Postfix..mp4

023 Infix to Postfix conversion - More examples with procedure.mp4

024 Elaboration of the procedure that converts infix to postfix..mp4

025 Writing the algorithm for converting Infix expression to equivalent Postfix..mp4

026 Dry running the Algorithm for converting Infix to Postfix..mp4

027 Staring the implementation lets first develop the precedence checker function..mp4

028 Writing the C function for converting Infix to Postfix..mp4

029 Combine the conversion and evaluation function in a single program..mp4

/.../020 Algorithm for evaluating Postfix expression/

postfix-evaluation-algo.txt

/.../021 Implementing evaluation of Postfix expression with C Programming language/

postfix-eval.c

/.../025 Writing the algorithm for converting Infix expression to equivalent Postfix/

intopost-algo.txt

/.../026 Dry running the Algorithm for converting Infix to Postfix/

practice-in-to-post.txt

/.../027 Staring the implementation lets first develop the precedence checker function/

in-to-post-lec26-practice.c

/.../028 Writing the C function for converting Infix to Postfix/

in-to-post-lec27.c

/.../029 Combine the conversion and evaluation function in a single program/

complete-evaluation.c

/quizzes/

003 Polish Notations.html

004 Polish Notations converting infix to prefix or postfix..html

005 Evaluating prefix and postfix expression.html

006 Converting infix to postfix - the precedence checking.html

/05 All about Queue/

030 Introduction to Queue.mp4

031 The FIFO queue implementation idea using Array - Understanding with animation..mp4

032 Algorithm for FIFO Queue..mp4

033 Dry run the FIFO queue algorithm..mp4

034 Implementation of FIFO Queue..mp4

035 A menu for the Queue program..mp4

036 The loophole in our implementation of FIFO Queue..mp4

037 Understanding the loophole why that happened.mp4

038 Introduction to Circular Queue..mp4

039 Circular queue operations. How to perform enqueue and dequeue operations..mp4

040 Algorithm for Circular Queue operations..mp4

041 Implementation of Circular Queue..mp4

042 Introduction to Double Ended Queue.mp4

043 Algorithm development for Double Ended Queue operations..mp4

044 Dry run of the DEQ algorithm..mp4

045 Implementation of Double Ended Queue..mp4

/.../032 Algorithm for FIFO Queue/

FIFO-Queue-algo.txt

/.../034 Implementation of FIFO Queue/

FIFOQueue-lec33.c

/.../035 A menu for the Queue program/

FIFOQueue-lec34.c

/.../041 Implementation of Circular Queue/

cir-queue-lec12.c

/.../043 Algorithm development for Double Ended Queue operations/

DEQAlgo.txt

/.../045 Implementation of Double Ended Queue/

deq.c

/quizzes/

007 Basic understanding of Queue.html

008 FIFO Queue Algorithm understanding.html

009 Stack and Queue operations.html

010 Flaw in the implementation of FIFO Queue.html

011 Moving rear and front in Circular Queue.html

012 Dry run Circular Queue operations using the algorithm..html

/06 Linked List/

046 Introduction to Linked List..mp4

047 Definition of Linked List conception of Node understanding basic terminologies.mp4

048 Categories of Linked List - Singly Doubly and Circular Linked List..mp4

/quizzes/

013 LinkedList Introduction.html

/07 Singly Linked List/

049 Understanding the struct type we need for implementing singly linked list..mp4

050 The Singly Linked List operations - starting the program..mp4

051 Developing Insert At Tail operation - Add a new node as last node..mp4

052 Implementing Insert at Head - Add a new node as the first node..mp4

053 Traversing the linked list - printing the content of each node..mp4

054 Printing the detail of each node of the linked list..mp4

055 Compiling and executing the program written so far..mp4

056 Practice for Singly Linked List.html

057 Developing find operation - to search for a target in the linked list..mp4

058 Load data from file and build the linked list..mp4

059 Creating Linked List from randomly generated integer numbers..mp4

060 Delete first operation to delete the first node..mp4

061 Delete last operation to delete the last node..mp4

062 Delete a node that contain a target data..mp4

063 Reverse the linked list..mp4

064 Traverse the singly linked list recursively..mp4

065 Implementation of Stack using singly linked list..mp4

066 Implementation of Queue using Linked List.mp4

/.../055 Compiling and executing the program written so far/

linklist-lec55.c

/.../063 Reverse the linked list/

linklist.c

/.../064 Traverse the singly linked list recursively/

linklist-recursive-traversal.c

/.../065 Implementation of Stack using singly linked list/

linkstack.c

/.../066 Implementation of Queue using Linked List/

linkqueue.c

/08 Doubly Linked List/

067 Introduction to Doubly Linked List..mp4

068 Starting the program to implement various operations for Doubly Linked List..mp4

069 Implementation of Add First method to add a new node as the first node..mp4

070 AddLast implementation to add a new node as the last node..mp4

071 Find and Insert After and Insert Before operation..mp4

072 Deleting a node - delete first delete last and delete a target..mp4

073 Double Ended Queue using doubly linked list..mp4

/.../072 Deleting a node - delete first delete last and delete a target/

dbllist.c

/.../073 Double Ended Queue using doubly linked list/

dequeue.c

/09 Circular Linked List/

074 Introduction to Circular Linked List..mp4

075 Insert operation for Circular Linked List..mp4

076 Delete Node operation..mp4

077 Developing find and print operation..mp4

/.../077 Developing find and print operation/

linklist.c

/

[FreeTutorials.us].txt

[FreeTutorials.us].url

Total files 123