• Concepts of Algorithm, Flow Chart & C Programming

    Concepts of Algorithm, Flow Chart & C Programming by Prof. Wongmulin | Dept. of Computer Science Garden City College-Bangalore

    published: 31 Mar 2012
  • Introduction to Algorithm

    This module explains the concept of Algorithm with the help of real life example. It also describes the concept of Generalized algorithm and its advantages. At Cognifront, we are creating revolution in Engineering Education.. Our Software Products are crafted with latest technology. We embarked on this grand vision to help transform technical education all across this beautiful planet. Become a part of it..

    published: 03 May 2014
  • Algorithm using Flowchart and Pseudo code Level 2 Important Programming Concepts

    Algorithm using Flowchart and Pseudo code Level 2 Important Programming Concepts By: Yusuf Shakeel 0:05 Level 2 0:10 important Programming Concepts 0:16 Semicolon 0:36 Comment 1:05 Data item - Numeric Character String Boolean 1:55 Variable 2:05 Example of variables 2:50 Constant 3:17 Assignment Operator = 3:37 Mathematical Operators + - * / 4:04 Increment Operator ++ 4:26 Decrement Operator -- 4:52 Post Increment 5:31 Pre Increment 6:10 Post Decrement 6:41 Pre Decrement 7:10 Modulus Operator % 7:39 Logical Operator AND OR NOT 8:02 Logical AND Operator && 8:27 Logical OR Operator || 8:44 Logical NOT Operator ! 9:10 Relational Operator 9:34 Modulus Operation Exercise 9:37 Find whether a given number is ODD or EVEN 10:02 Logical Operator Exercise 10:08 Print "Valid" if a is 10 and b is 20 el...

    published: 27 Aug 2013
  • Concepts of Algorithm, Flow Chart & C Programming YouTube

    published: 22 Apr 2014
  • Analyzing Running Time Complexity of Algorithm (Concepts, Tricks & ShortCut) PART 2

    Asymptotic Time complexity, Running Time analysis of Algorithms-Asymptotic Time complexity-Part 2-GATE exam preparation videos for computer science, asymptotic analysis of algorithms, algorithm efficiency analysis, how to compute the running time of an algorithm, complexity of algorithm, finding running time of an algorithm, notes on running time of algorithms, analysing algorithm, growth rate algorithms find maximum element in array Time complexity Analysis of iterative programs Time complexity of a triple-nested loop time complexity of algorithms for loop time complexity examples time complexity of while loop for (int i = 1; i less than equal to n; ++i) for (int j = i; j less than equal to n; ++j) for (int k = j; k less than equal to n; ++k) // statement The s...

    published: 05 Apr 2015
  • Round Robin RR -1 Basic concepts CPU Scheduling Algorithm for Computer Science by Anshul Agarwal

    This Video demonstrates the concept of Round Robin (RR) and also problem solving techniques related to RR.

    published: 02 Jul 2014
  • 9.1: Genetic Algorithm: Introduction - The Nature of Code

    Welcome to part 1 of a new series of videos focused on Evolutionary Computing, and more specifically, Genetic Algorithms. In this tutorial, I introduce the concept of a genetic algorithm, how it can be used to approach "search" problems and how it relates to brute force algorithms. Support this channel on Patreon: https://www.patreon.com/codingrainbow Send me your questions and coding challenges!: https://github.com/CodingRainbow/Rainbow-Topics Contact: https://twitter.com/shiffman Links discussed in this video: The Nature of Code: http://natureofcode.com/ BoxCar2D: http://boxcar2d.com/ Source Code for the Video Lessons: https://github.com/CodingRainbow/Rainbow-Code p5.js: https://p5js.org/ Processing: https://processing.org For More Genetic Algorithm videos: https://www.youtube.com...

    published: 29 Jul 2016
  • Introduction to Algorithms | what is Agorithm

    Introduction, to, Algorithms, Analyzing, DAA, gate, iit, lectures, tutorial, in hindi, Introduction to fundamental techniques for designing and analyzing algorithms, including asymptotic analysis; divide-and-conquer algorithms

    published: 13 Oct 2015
  • Scan Line Polygon Fill Algorithm: The Concepts

    It covers the concepts of Filling a polygon through Scan Lines. For more details about the algorithm visit: http://www.unacademy.in/2012/01/scan-line-polygon-fill-algorithm.html Follow us on Facebook http://www.facebook.com/unacademy

    published: 02 Jan 2011
  • What's an algorithm? - David J. Malan

    View full lesson: http://ed.ted.com/lessons/your-brain-can-solve-algorithms-david-j-malan An algorithm is a mathematical method of solving problems both big and small. Though computers run algorithms constantly, humans can also solve problems with algorithms. David J. Malan explains how algorithms can be used in seemingly simple situations and also complex ones. Lesson by David J. Malan, animation by enjoyanimation.

    published: 20 May 2013
Concepts of Algorithm, Flow Chart & C Programming

Concepts of Algorithm, Flow Chart & C Programming

  • Order:
  • Duration: 33:33
  • Updated: 31 Mar 2012
  • views: 394668
videos
Concepts of Algorithm, Flow Chart & C Programming by Prof. Wongmulin | Dept. of Computer Science Garden City College-Bangalore
https://wn.com/Concepts_Of_Algorithm,_Flow_Chart_C_Programming
Introduction to Algorithm

Introduction to Algorithm

  • Order:
  • Duration: 5:05
  • Updated: 03 May 2014
  • views: 920
videos
This module explains the concept of Algorithm with the help of real life example. It also describes the concept of Generalized algorithm and its advantages. At Cognifront, we are creating revolution in Engineering Education.. Our Software Products are crafted with latest technology. We embarked on this grand vision to help transform technical education all across this beautiful planet. Become a part of it..
https://wn.com/Introduction_To_Algorithm
Algorithm using Flowchart and Pseudo code Level 2 Important Programming Concepts

Algorithm using Flowchart and Pseudo code Level 2 Important Programming Concepts

  • Order:
  • Duration: 14:46
  • Updated: 27 Aug 2013
  • views: 42479
videos
Algorithm using Flowchart and Pseudo code Level 2 Important Programming Concepts By: Yusuf Shakeel 0:05 Level 2 0:10 important Programming Concepts 0:16 Semicolon 0:36 Comment 1:05 Data item - Numeric Character String Boolean 1:55 Variable 2:05 Example of variables 2:50 Constant 3:17 Assignment Operator = 3:37 Mathematical Operators + - * / 4:04 Increment Operator ++ 4:26 Decrement Operator -- 4:52 Post Increment 5:31 Pre Increment 6:10 Post Decrement 6:41 Pre Decrement 7:10 Modulus Operator % 7:39 Logical Operator AND OR NOT 8:02 Logical AND Operator && 8:27 Logical OR Operator || 8:44 Logical NOT Operator ! 9:10 Relational Operator 9:34 Modulus Operation Exercise 9:37 Find whether a given number is ODD or EVEN 10:02 Logical Operator Exercise 10:08 Print "Valid" if a is 10 and b is 20 else "Invalid" 10:46 Array 11:11 One Dimensional Array 12:10 Two Dimensional Array 12:54 Array exercise 12:57 Print the 3rd element of a 1D array having 10 elements 13:40 Another exercise 13:52 Print the element at 2nd row and 3rd column of a 2D array having 3 rows and 4 columns End of Level 2 Related Videos Algorithm Flowchart and Pseudo code Level 1 Flowchart http://youtu.be/vOEN65nm4YU Level 2 Important Programming Concepts http://youtu.be/kwA3M8YxNk4 Level 3 Pseudo code http://youtu.be/r1BpraNa2Zc
https://wn.com/Algorithm_Using_Flowchart_And_Pseudo_Code_Level_2_Important_Programming_Concepts
Concepts of Algorithm, Flow Chart & C Programming   YouTube

Concepts of Algorithm, Flow Chart & C Programming YouTube

  • Order:
  • Duration: 33:33
  • Updated: 22 Apr 2014
  • views: 446
videos
https://wn.com/Concepts_Of_Algorithm,_Flow_Chart_C_Programming_Youtube
Analyzing Running Time Complexity of Algorithm (Concepts, Tricks & ShortCut) PART 2

Analyzing Running Time Complexity of Algorithm (Concepts, Tricks & ShortCut) PART 2

  • Order:
  • Duration: 24:03
  • Updated: 05 Apr 2015
  • views: 9118
videos
Asymptotic Time complexity, Running Time analysis of Algorithms-Asymptotic Time complexity-Part 2-GATE exam preparation videos for computer science, asymptotic analysis of algorithms, algorithm efficiency analysis, how to compute the running time of an algorithm, complexity of algorithm, finding running time of an algorithm, notes on running time of algorithms, analysing algorithm, growth rate algorithms find maximum element in array Time complexity Analysis of iterative programs Time complexity of a triple-nested loop time complexity of algorithms for loop time complexity examples time complexity of while loop for (int i = 1; i less than equal to n; ++i) for (int j = i; j less than equal to n; ++j) for (int k = j; k less than equal to n; ++k) // statement The statement here is executed exactly n(n+1)(n+2)6 times. 1) O(1): Time complexity of a function (or set of statements) is considered as O(1) if it doesn’t contain loop, recursion and call to any other non-constant time function. // set of non-recursive and non-loop statements For example swap() function has O(1) time complexity. A loop or recursion that runs a constant number of times is also considered as O(1). For example the following loop is O(1). // Here c is a constant for (int i = 1; i less than equal to c; i++) { // some O(1) expressions } 2) O(n): Time Complexity of a loop is considered as O(n) if the loop variables is incremented / decremented by a constant amount. For example following functions have O(n) time complexity. // Here c is a positive integer constant for (int i = 1; i less than equal to n; i += c) { // some O(1) expressions } for (int i = n; i Greater Than 0; i -= c) { // some O(1) expressions } 3) O(nc): Time complexity of nested loops is equal to the number of times the innermost statement is executed. For example the following sample loops have O(n2) time complexity for (int i = 1; i less than equal to n; i += c) { for (int j = 1; j less than equal to n; j += c) { // some O(1) expressions } } for (int i = n; i Greater Than 0; i += c) { for (int j = i+1; j less than equal to n; j += c) { // some O(1) expressions } For example Selection sort and Insertion Sort have O(n2) time complexity. 4) O(Logn) Time Complexity of a loop is considered as O(Logn) if the loop variables is divided / multiplied by a constant amount. for (int i = 1; i less than equal to n; i *= c) { // some O(1) expressions } for (int i = n; i Greater Than 0; i /= c) { // some O(1) expressions } For example Binary Search(refer iterative implementation) has O(Logn) time complexity. 5) O(LogLogn) Time Complexity of a loop is considered as O(LogLogn) if the loop variables is reduced / increased exponentially by a constant amount. // Here c is a constant greater than 1 for (int i = 2; i less than equal to n; i = pow(i, c)) { // some O(1) expressions } //Here fun is sqrt or cuberoot or any other constant root for (int i = n; i Greater Than 0; i = fun(i)) { // some O(1) expressions } How to combine time complexities of consecutive loops? When there are consecutive loops, we calculate time complexity as sum of time complexities of individual loops. for (int i = 1; i less than equal to m; i += c) { // some O(1) expressions } for (int i = 1; i less than equal to n; i += c) { // some O(1) expressions } Time complexity of above code is O(m) + O(n) which is O(m+n) If m == n, the time complexity becomes O(2n) which is O(n). How to calculate time complexity when there are many if, else statements inside loops? As discussed here, worst case time complexity is the most useful among best, average and worst. Therefore we need to consider worst case. We evaluate the situation when values in if-else conditions cause maximum number of statements to be executed. For example consider the linear search function where we consider the case when element is present at the end or not present at all. When the code is too complex to consider all if-else cases, we can get an upper bound by ignoring if else and other complex control statements. How to calculate time complexity of recursive functions? Time complexity of a recursive function can be written as a mathematical recurrence relation. To calculate time complexity, we must know how to solve recurrences. analysis of algorithms and computational complexity time and space complexity of algorithms time complexity calculation examples notions of space and time complexity algorithm analysis examples complexity of algorithm pdf analyzing algorithm big 0 notation
https://wn.com/Analyzing_Running_Time_Complexity_Of_Algorithm_(Concepts,_Tricks_Shortcut)_Part_2
Round Robin RR -1 Basic concepts CPU Scheduling Algorithm for Computer Science by Anshul Agarwal

Round Robin RR -1 Basic concepts CPU Scheduling Algorithm for Computer Science by Anshul Agarwal

  • Order:
  • Duration: 8:48
  • Updated: 02 Jul 2014
  • views: 23107
videos
This Video demonstrates the concept of Round Robin (RR) and also problem solving techniques related to RR.
https://wn.com/Round_Robin_Rr_1_Basic_Concepts_Cpu_Scheduling_Algorithm_For_Computer_Science_By_Anshul_Agarwal
9.1: Genetic Algorithm: Introduction - The Nature of Code

9.1: Genetic Algorithm: Introduction - The Nature of Code

  • Order:
  • Duration: 12:17
  • Updated: 29 Jul 2016
  • views: 12118
videos
Welcome to part 1 of a new series of videos focused on Evolutionary Computing, and more specifically, Genetic Algorithms. In this tutorial, I introduce the concept of a genetic algorithm, how it can be used to approach "search" problems and how it relates to brute force algorithms. Support this channel on Patreon: https://www.patreon.com/codingrainbow Send me your questions and coding challenges!: https://github.com/CodingRainbow/Rainbow-Topics Contact: https://twitter.com/shiffman Links discussed in this video: The Nature of Code: http://natureofcode.com/ BoxCar2D: http://boxcar2d.com/ Source Code for the Video Lessons: https://github.com/CodingRainbow/Rainbow-Code p5.js: https://p5js.org/ Processing: https://processing.org For More Genetic Algorithm videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6bJM3VgzjNV5YxVxUwzALHV For More Nature of Code videos: https://www.youtube.com/playlist?list=PLRqwX-V7Uu6aFlwukCmDf0-1-uSR7mklK Help us caption & translate this video! http://amara.org/v/Sld6/
https://wn.com/9.1_Genetic_Algorithm_Introduction_The_Nature_Of_Code
Introduction to Algorithms | what is Agorithm

Introduction to Algorithms | what is Agorithm

  • Order:
  • Duration: 16:37
  • Updated: 13 Oct 2015
  • views: 30280
videos
Introduction, to, Algorithms, Analyzing, DAA, gate, iit, lectures, tutorial, in hindi, Introduction to fundamental techniques for designing and analyzing algorithms, including asymptotic analysis; divide-and-conquer algorithms
https://wn.com/Introduction_To_Algorithms_|_What_Is_Agorithm
Scan Line Polygon Fill Algorithm: The Concepts

Scan Line Polygon Fill Algorithm: The Concepts

  • Order:
  • Duration: 13:25
  • Updated: 02 Jan 2011
  • views: 90316
videos
It covers the concepts of Filling a polygon through Scan Lines. For more details about the algorithm visit: http://www.unacademy.in/2012/01/scan-line-polygon-fill-algorithm.html Follow us on Facebook http://www.facebook.com/unacademy
https://wn.com/Scan_Line_Polygon_Fill_Algorithm_The_Concepts
What's an algorithm? - David J. Malan

What's an algorithm? - David J. Malan

  • Order:
  • Duration: 4:58
  • Updated: 20 May 2013
  • views: 416938
videos
View full lesson: http://ed.ted.com/lessons/your-brain-can-solve-algorithms-david-j-malan An algorithm is a mathematical method of solving problems both big and small. Though computers run algorithms constantly, humans can also solve problems with algorithms. David J. Malan explains how algorithms can be used in seemingly simple situations and also complex ones. Lesson by David J. Malan, animation by enjoyanimation.
https://wn.com/What's_An_Algorithm_David_J._Malan
×