Sundeep Saradhi Kanthety Courses

Network Security - Diffie Hellman Key Exchange Algorithm

Learn the Diffie-Hellman key exchange algorithm for secure network communication. Understand the step-by-step process of generating and exchanging public and private keys to establish a shared secret key.

• YouTube
• 34 minutes
• Self-Paced
• Free Video

Network Security - AES (Advanced Encryption Standard) Algorithm

Explore AES encryption algorithm's structure, operations, and key components for secure network communication and data protection.

• YouTube
• 49 minutes
• Self-Paced
• Free Video

Structures - C Programming

Learn about C structures: definition, declaration, initialization, and member access. Master this fundamental concept for efficient data organization in programming.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Two Dimensional Arrays - C Programming

Learn to work with 2D arrays in C, including initialization, subscripts, and printing. Master tabular data representation for applications like student marks and matrix operations.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

One Dimensional Arrays Declaration, Initialization and Accessing - C Programming

Learn to declare, initialize, and access one-dimensional arrays in C programming, covering numerical arrays, subscripts, memory allocation, and display techniques.

• YouTube
• 42 minutes
• Self-Paced
• Free Video

Window to Viewport Transformation in Computer Graphics

Learn window-to-viewport transformation in computer graphics, covering scaling factors, examples, and formulas for effective 2D graphics rendering and display.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

DDA Line Drawing Algorithm in Computer Graphics - Digital Differential Analyzer Algorithm

Learn the DDA line drawing algorithm in computer graphics, including intermediate point calculation, temporal graphics, and unit intervals, with practical examples.

• YouTube
• 24 minutes
• Self-Paced
• Free Video

Learn HTML & CSS in 2023

Comprehensive guide to HTML and CSS fundamentals, covering tags, attributes, forms, multimedia, selectors, properties, and advanced styling techniques for web development beginners.

• YouTube
• 9 hours 21 minutes
• Self-Paced
• Free Video

How to Calculate Time Complexity with Examples - Part 1

Learn to calculate time complexity with practical examples, focusing on analyzing algorithms efficiently for better problem-solving and optimization in computer science.

• YouTube
• 25 minutes
• Self-Paced
• Free Video

Longest Common Subsequence Using Dynamic Programming - Design and Analysis of Algorithms

Explore dynamic programming to solve the Longest Common Subsequence problem efficiently. Learn step-by-step implementation and optimization techniques for this fundamental algorithm.

• YouTube
• 27 minutes
• Self-Paced
• Free Video

Binary Search Using Divide and Conquer - Time Complexity and Examples

Explore binary search algorithm using divide and conquer approach, including implementation examples and time complexity analysis for efficient problem-solving in computer science.

• YouTube
• 23 minutes
• Self-Paced
• Free Video

Merge Sort Using Divide and Conquer - Algorithm, Example, and Time Complexity

Comprehensive exploration of merge sort algorithm, including divide-and-conquer strategy, step-by-step examples, and time complexity analysis for efficient sorting implementation.

• YouTube
• 29 minutes
• Self-Paced
• Free Video

Quick Sort Using Divide and Conquer - Algorithm, Example, and Time Complexity

Comprehensive exploration of Quick Sort algorithm, including divide-and-conquer approach, implementation examples, and time complexity analysis for efficient sorting techniques.

• YouTube
• 41 minutes
• Self-Paced
• Free Video

Job Sequencing with Deadlines Using Greedy Method - Algorithm and Time Complexity

Explore job sequencing with deadlines using the greedy method, including examples, algorithm, and time complexity analysis in Design and Analysis of Algorithms.

• YouTube
• 20 minutes
• Self-Paced
• Free Video

N-Queens Problem Using Backtracking - Design and Analysis of Algorithms

Learn to solve the N-Queens problem using backtracking, focusing on the 4-Queens case. Explore algorithmic techniques for efficient placement of queens on a chessboard without conflicts.

• YouTube
• 27 minutes
• Self-Paced
• Free Video