07:19

Selection Sort in C | Implement Selection Sort | Selection | Sorting

06:12

Selection Sort | Sorting | Sorts | Introduction with example

09:00

Bubble Sort in C | Implement Bubble Sort in C

09:03

Bubble Sort | Introduction & Example | Sorting

02:38

Sorting in Data Structure | Sorting Techniques |Sorting Algorithms | Sort |Sorts

09:41

Binary Search | Implementation in C

08:29

Binary Search in Data Structures | Binary Search

08:53

Linear Search in C | Sequential Search in C | Implementation

03:11

Linear Search | Sequential Search

03:38

Searching Techniques | Searching Algorithms | Searching Methods in Data Structures

06:24

Merging of Arrays | Array merging implementation in C | Append arrays | Array operation

12:26

Two Dimensional Array | 2 D- Array | Matrix Implementation in C

09:39

Queue using Linked List in C | Dequeue Operation of Queue | Implement Queue in C

12:20

Queue using Linked List in C | Enqueue Operation of Queue | Implement Queue in C

05:59

Queue using Array in C | Dequeue Operation of Queue | Implement Queue in C

09:49

Queue using Array in C | Enqueue Operation of Queue | Implement Queue in C

04:18

Queue: A linear Data Structure | Queue: Introduction & Example

09:19

Stack as Linked List in C | Implement stack in C | Pop & Display operation on Stack as Linked List

11:57

Stack as Linked List in C | Implement stack in C | Push operation on Stack as Linked List

08:56

Pop, Peek & Display operation on Stack as array | Stack implementation in C

08:46

Stack using array in C | Stack Implementation in C | Stack in C using Array

06:55

Stack: A Linear Data Structure | Stack using Array | Stack Introduction, Example & Applications

09:33

Search operation in Doubly Circular Linked List | Operations on Doubly Circular Linked List

05:12

Delete last node from Doubly Circular Linked List | Delete operation on Doubly Circular Linked List

07:25

Delete First Node from Doubly Circular Linked List | Delete Operation on Doubly Circular List

04:13

Traverse | Display | Print Doubly Circular Linked List |Operations on Doubly Circular Linked List

09:26

Insert Last Node in Doubly Circular Linked List | Insert Operation in Doubly Circular Linked List

12:10

Insert First Node in Doubly Circular Linked List | Insert Operation in Doubly Circular Linked List

07:34

Delete Last Node from Circular Linked List | Delete Operation on Circular Linked List

06:50

Deleting First Node from Circular Linked List | Deletion Operation in Circular Linked List

05:13

Traverse a Circular Linked List | Display | Print | Operations on Circular Linked List

13:30

Search an Element in Circular List | Operations on Circular Linked List

08:40

Insert node at end of Circular Linked List | Operations on Circular Linked List

11:10

Insert node at start of Circular Linked List | Operations on Circular Linked List

04:12

int main() for operations on Doubly Linked List

04:50

Traverse Doubly Linked List | Print Doubly Linked List | Operations on Doubly Linked List

05:58

Deleting last node from Doubly Linked List | Deletion operation in Doubly Linked List

04:58

Deleting first node from Doubly Linked List | Deletion operation in Doubly Linked List

06:29

Insert node at end in Doubly Linked List | Operations on Double Linked List

06:57

Insert node at start | insertion into Doubly Linked List | Operations on Doubly Linked List

06:26

Create node in Doubly Linked List in C | Operations in Doubly Linked List in C | Doubly Linked List

12:26

Deletion in Singly Linked List | Delete node from linked list | Linked List Operations

08:48

Search in Linked List | Searching an element in Singly Linked List | Operations on Linked List

05:05

Traverse a Linked List in C | Print a linked list in C | Visit linked list | Linked list in C

09:07

Linked List in C | Create Linked List in C | Implement linked list in C

12:00

Linked List in C | Linear Data Structure |

05:07

Implementation of Arrays in C | Array Implementation using loops

09:12

Array in C | Linear Data Structures: Array | Definition , Declarations, Types, Examples | Array

03:12

Difference between Linear & Non-Linear Data Structures

02:08

Non-Linear Data Structures | Type of Data Structures | Definition & Example

03:03

Linear Data Structures | Type of Data Structures | Definition & Example

05:15

What are Data Structures | Definition & Examples

16:11

Design TM for L={ w#w^R | w =(a+b)* & w^R is reverse string of w }

12:08

Design Turing Machine (TM) for L = {a^n b^m c^n | m, n =1 & onwards }

05:20

Design Turing Machines (TM) to increment any unary No. by three.

09:43

Design Turing Machine (TM) for L={a^n b^2n | n=1 & onwards }

15:18

Design Turing Machine for L={0^n 1^n | n=1 & onwards }

03:35

Formal Definition of Turing Machine (TM)

02:51

Pushdown Automata (PDA) and Turing Machine (TM)

02:33

Finite Automata (FA) and Turing Machine (TM)