
Learn What are Data Structures.
Comparing
1. Data Structure
2. Database
3. Datawarehouse
4. Big Data
Learn How program uses Main Memory. How program uses sections of Memory
Learn How function uses Stack, how memory is allocated when the function is called.
Learn how Heap is used with the help of Pointers
Difference between Physical and Logical Data Structures
Physical : Array and Linked List
Logical : Stack,Queues, Trees, Graphs, Hashtables
Learn what does it mean by Abstract Datatypes
Learn How to Analyse Time and Space of any Algorithm on Data Structures, based on working of Algorithm
Learn How to Analyse based on Code of Algorithm
Learn how to trace a Recursion
General form of Recursion and its phases
1. Ascending Phase
2. Descending Phase
Learn how Recursion uses Stack
Learn how to find the Time complexity of Recursion using Recurrence Relation
Learn how Static and Global variables are used in Recursion
Learn What does it mean by Tail Recursion, a recursion processing at calling time
Learn what does it mean by Head Recursion, a recursion processing at returning time
Learn Tree Recursion, a Recursion calling itself more than one time
Learn Indirect Recursion. two or more functions calling each other recursively.
Learn Nested Recursion. a Function call is passed as parameter to itself.
Finding Sum of first n natural numbers using Recursion and Iteration
Finding Factorial using Recursion.
Finding Power using Recursion and computing using less number of multiplications
Recursive function for Taylor Series using Static variables
Apply Horner's Rule to reduce number of multiplications in Taylor Series.
Learn about Fibonacci Series.
1. Iterative method for Fibonacci Series.
2. Recursive Method.
3. Using Memoization
Learn how to devise a Recursive function for nCr formula using Pascals Triangle
Devising a Recursive function for Tower of Hanoi
1. What is an Array
2. Declaring and Initialising Array
3. Accessing Elements of an Array
Learn how to create Array in Stack and Heap.
How to change Size of an Array
Learn various methods of creating 2D Array
How Compiler manage Arrays, How compilers use Relative addresses
Learn how Compilers use Relative address for Representing 2D arrays
Learn how Compilers use Relative address for Representing 2D arrays
Learn how Compilers use Relative address for Representing nD arrays
Learn how Compilers use Relative address for Representing 3D arrays
Learn how to represent Array as Abstract Datatype
Learn How to Insert an element in an Array at a given index by shifting elements
find the time complexity
Deleting an Element from given index
Time complexity
Best and Worst case Analysis
Linear Search and its Analysis
Find Best Worst and Average Case Time
How to improve Linear Search for future Searches.
Learn how to Devise Binary Search
Write an Algorithm for Binary Search
Recursive Algorithm
Iterative Algorithm
Learn how to Analyse Binary Search
Best Case Analysis
Worst Case Analysis
Learn how to do Average Case of Binary Search using Tree method
Learn How to perform Get() / Set()/ Max() / Min() Operations on an Array
Learn Methods to Reverse elements of an Array
Learn what does it mean by Shifting elements
Learn how to Check if Array is Already Sorted
Learn How to insert an element in a Sorted position
Learn how to arrange All negatives on one side and Positives another side.
Introduction to Section
Learn How to Represent Diagonal Matrix in a Single Dimension Array by storing only non-zero elements
Learn How to Represent Lower Triangular Matrix in a Single Dimension Array by storing only non-zero elements
Row-by-Row Representation
Learn How to Represent Lower Triangular Matrix in a Single Dimension Array by storing only non-zero elements
Column-by-Column Representation
Learn How to Represent Upper Triangular Matrix in a Single Dimension Array by storing only non-zero elements
Row-by-Row Representation
Learn How to Represent Upper Triangular Matrix in a Single Dimension Array by storing only non-zero elements
Column-by-Column Representation
Learn How to Represent Symmetric Matrix in a Single Dimension Array by storing only non-zero elements
Learn How to Represent Trim-Diagonal and Trim-Band Matrix in a Single Dimension Array by storing only non-zero elements
Learn How to Represent Toeplitz Matrix in a Single Dimension Array by storing only non-zero elements
Learn How to Represent a Sparse Matrix
1. 3-Column Representation
2. Compressed Sparse Row Representation
Learn How to Add 2 Sparse Matrices using Representation
Learn how to Create a Data Structure for storing Sparse Matrix
Learn about Polynomial Representation
Learn how to Evaluate Polynomial using its Representation
Learn how to Add 2 Polynomials using representation
[꼭 읽어주세요] 한글 AI 자막 강의란?
유데미의 한국어 [자동] AI 자막 서비스로 제공되는 강의입니다.
퀴즈에 대해서는 한글 번역이 제공되지 않습니다.
강의에 대한 질문사항은 Abdul 강사님이 확인하실 수 있도록 Q&A 게시판에 영어로 남겨주시기 바랍니다.
데이터 구조에 대해 처음 공부하려고 하거나, 이미 데이터 구조를 공부하고 활용해봤지만 어려운 문제를 해결하고 데이터 구조를 효율적으로 사용하기 위해 데이터 구조에 대해 더 공부가 필요하다고 느끼시나요? 그렇다면 이 강의에 잘 오셨습니다!
이 53 시간 과정은 각 주제를 자세히 다루며, 모든 주제는 문제 해결 및 분석 기술을 향상시킬 수 있는 화이트보드에서 다룹니다. 모든 데이터 구조는 한줄한줄 따라하며 배우는 실용적인 코딩을 통해 설명 및 분석되며 활용법에 대해 배우게 됩니다.
모든 프로그램의 소스 코드를 다운로드 가능합니다.
강사 소개:
저는 이 과정의 강사이며, 오랫동안 대학생들에게 이 과정을 가르치고 있습니다.
학생들의 니즈를 잘 알고 있으며 학생들이 이해하기 쉽도록 주제를 설명하는 방법을 알고 있습니다.
화이트보드를 사용하여 주제를 설명하고 기억에 남도록 하는 방법을 알고 있습니다. 주제를 이해하는 것보다 기억하고 적재적소에 사용하는 것이 더 중요합니다.
이 과정을 마치고 나면:
데이터 구조를 사용하여 코딩의 어려운 문제를 해결할 수 있을만큼 자신감이 생깁니다.
이 강의에서 배우는 내용:
1. 재귀 (Recursion)
2. 배열 표현 (Arrays Representation)
3. 배열 ADT (Array ADT)
4. 연결 리스트 (Linked List)
5. 스택 (Stack)
6. 큐 (Queues)
7. 트리 (Trees)
8. 이진 검색 트리 (Binary Search Tree)
9. AVL 트리 (AVL Trees)
10. 그래프 (Graphs)
11. 해싱 기법 (Hashing Technique)