(DSA) Sppu It Data Struct & Algo + Free Prerequisite Video

Free Download (Dsa)_Sppu_It_Data Struct & Algo + Free Prerequisite Video
Published 3/2023
MP4 | Video: h264, 1280x720 | Audio: AAC, 44.1 KHz
Language: English | Size: 24.04 GB | Duration: 18h 57m
One Stop Learning destination for Data Structure students

Free Download What you'll learn
SPPU IT branch students who wanted to score good marks in exam without wasting time in searching concepts on internet
Third year and FInal year students to preparing for placement (As data structure plays important role in placement)
Students preparing for GATE to understand data structure concept in detail
Anyone who wants to professional programming (Data structure is a heart of programming)
Requirements
All prerequisite videos are available for this course for free
Description
Hi,Data Structure is a heart of programming, That's why all product development company focus on data structure and in almost all technical interview data structure plays very important role.In this course we will start with prerequisite of data structure and then slowly we will move from basic to advance level data structure.This Course is Mapped to SPPU 2019 Pattern Syllabus. Every Data structures is explained thoroughly concerning following points: ConceptsExamples Algorithms Logic CodesAnalysisThis course will be helpful throughout you programming journey, even after you placed in good company.This course covers each topic in greater details, every topic is covered on Whiteboard which will improve your Problem Solving and Analytical Skills. Every Data Structure is discussed, analyzed and implemented with a Practical line-by-line coding.Many developers who are "self taught", feel that one of the main disadvantages they face compared to college educated graduates in computer science is the fact that they don't have knowledge about algorithms, data structures and the notorious Big-O Notation. Get on the same level as someone with computer science degree by learning the fundamental building blocks of computer science which will give you a big boost during interviews. What Will You Get ?To study data structures and their implementations and applications.To learn different searching and sorting techniques.To study some advanced data structures such as stack, Queue, Trees, Graphs, Tables, etc.To learn algorithm development and analysis of algorithms.On completion of the course, you will be able to–Perform basic analysis of algorithms with respect to time and space complexity.Select appropriate searching and/or sorting techniques in the application development.Implement abstract data type (ADT) and data structures for given application.Apply implement learned algorithm design techniques and data structures to solve problems.Design different hashing functions
Overview
Section 1: Free Prerequisite Videos (C++ Basics)
Lecture 1 Variables Concept
Lecture 2 Varable-Facts
Lecture 3 How to get and format output in C++
Lecture 4 How to take input in C++
Lecture 5 Interesting Facts and Common Errors while taking Input in C++
Lecture 6 Operators in C++
Lecture 7 If-Else concept in C++ (Conditional Decision Control Statement)
Lecture 8 Interesting Facts and Important Things to Know about If- else Statement
Lecture 9 If else Practice Problems
Lecture 10 Loops Concepts and its Use in C++
Lecture 11 Loops Practice Problems
Lecture 12 Nested Loops in C++
Lecture 13 Switch Case in C++
Lecture 14 Introduction to Functions
Lecture 15 Function Importance with Code and Real world Example
Lecture 16 Function with Reference variable C++
Lecture 17 How to code Menu Driven Program?
Lecture 18 Class Concept in C++ 22:40
Section 2: Data Structure Classification
Lecture 19 Data Structure
Section 3: Unit 1 - Arrays
Lecture 20 Introduction
Lecture 21 Array as an ADT
Lecture 22 Multi dimentional Arrays
Lecture 23 Address Calculation
Section 4: Unit 1- Data Structure Classification
Lecture 24 Types of Data Strcutures
Section 5: Unit 1 - Analysis of Complexity
Lecture 25 Asymptotic Notations
Lecture 26 Step Count Method
Lecture 27 Programming Constructs
Section 6: Unit 1 - Pointers
Lecture 28 Pointers part 1
Lecture 29 Pointers part 2
Section 7: Unit 1 - Linked List
Lecture 30 SLL - Creation and display
Lecture 31 SLL - Insertion
Lecture 32 SLL - Search and Update
Lecture 33 Doubly linked list - create and display
Lecture 34 Dll insertion and deletion
Lecture 35 Circular Linked List
Section 8: Unit 2 - Searching
Lecture 36 Linear Search
Lecture 37 Sentinel Search
Lecture 38 Binary Search
Section 9: Unit 2 - Sorting
Lecture 39 Bubble sort - Theory and Examples
Lecture 40 Bubble Sort Code and Analysis
Lecture 41 Selection Sort - Theory and Examples
Lecture 42 Insertion Sort - Theory and Examples
Lecture 43 Insertion Sort - Code and Analysis
Lecture 44 Quick Sort - Theory and Examples
Lecture 45 Quick Sort - Code and Analysis
Lecture 46 Merge Sort - Theory and Examples
Lecture 47 Merge Sort - Code and Analysis
Lecture 48 Selection Sort - Code and Analysis
Lecture 49 Shell Sort
Lecture 50 Bucket Sort
Lecture 51 Radix Sort
Lecture 52 Counting Sort
Section 10: Unit 3 - Stack
Lecture 53 Stack implementation using Arrays
Lecture 54 Stack implementation using Linked List
Lecture 55 Stack ADT - Practical way
Lecture 56 Expression conversions using stack
Section 11: Unit 3 - Queue
Lecture 57 Queue Implementation using Array
Lecture 58 Queue Implementation using Linked List
Lecture 59 Circular Queue
Lecture 60 DeQueue - Double Ended Queue
Lecture 61 Priority Queue
Section 12: Unit 4 - Trees
Lecture 62 Tree Traversing Techniques
Lecture 63 Preorder - recursive
Lecture 64 Preorder - Non recursive
Lecture 65 Inorder and Postorder
Lecture 66 Tree creation using infix,prefix,postfix Expressions
Lecture 67 Binary Search Tree
Lecture 68 Expression Tree
Lecture 69 Threaded binary tree Creation and Insertion
Lecture 70 Threaded binary tree Insertion and Deletion
Section 13: Unit 5 - Graphs
Lecture 71 Breadth First Search (BFS)
Lecture 72 Depth First Search (DFS)
Lecture 73 Minimum Spanning Tree (MST) - Prims and Kruskal algorithms
Lecture 74 Floyd Warshall Algorithm
Lecture 75 Dijiktras Algorithm
Lecture 76 Topological Sort
Section 14: Unit 5 - Symbol Tables
Lecture 77 OBST prerequisites
Lecture 78 OBST examples
Lecture 79 AVL tree Creation and Insertion
Lecture 80 AVL tree Deletion
Lecture 81 Heap Data Structure
Section 15: Unit 6 - Hashing
Lecture 82 Key to address translation techniques
Lecture 83 Collision resolution techniques
This Course is Mapped to SPPU 2019 Pattern Syllabus. Every Data structures is explained thoroughly concerning following points:,1. Concept,2. Examples,3. Algorithm,4. Logic,5. Code,6. Analysis

Homepage

https://www.udemy.com/course/dsa-sppu-it-enggtutes/

Links are Interchangeable - Single Extraction

Вернуться назад

Навигация

Рекомендуем

Статистика

(DSA) Sppu It Data Struct & Algo + Free Prerequisite Video

Коментарии

Рекомендуем

Популярное