Ending In:
$928
95% off
What's Included
Advanced C Programming: Pointers
$95 Value
C Programming For Beginners
$149 Value
C Programming: Complete Tutorial For Beginners
$35 Value
Learn Data Structures Using C Programming Language
$135 Value
C Programming Language Refresher
$49 Value
From 0 to 1: C Programming
$49 Value
C Programming for Beginners: Go from Zero to Hero!
$99 Value
Algorithms in C: Concepts, Examples, Code + Time Complexity
$149 Value
C Puzzles for Interview Prep
$39 Value
C, C++, Python and Ruby Programming
$129 Value
Product Details
1 of 10
Access
Lifetime
Content
3.5 hours
Lessons
59
Advanced C Programming: Pointers
Master Pointers, Addresses, & Memory Allocation in C
By Huw Collingbourne | in Online Courses
To be an expert C programmer you need to master the use of pointers. This course explains pointers in real depth, explaining pointer variables, pointer arithmetic, indirection, memory allocation, and much more. By the time you finish the course, you'll know pointers inside out, and how to ensure your programs don't crash!
- Access 59 lectures & 3.5 hours of content 24/7
- Learn about computer memory & how pointers access it
- Understand how memory is allocated & why copying data using pointers can cause program errors
- Discover why some pointers are 'generic' & what happens when you 'cast' them to specific types
- Create singly & doubly linked lists, stacks, & queues
- Avoid memory leaks & other common problems
Huw Collingbourne is a programmer with over 30 years' experience, and a published technology writer. He is the technology director at SapphireSteel Software, which created the Ruby in Steel Ruby programming environment. He has written about numerous coding languages, and is most notably the author of the Little Book of Ruby.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: advanced
Compatibility
- Internet required
Course Outline
- Pointer Basics
- What is this course about? (2:44)
- How to use this course (3:14)
- Course Notes and FAQ
- Source Code Archive
- Quiz Questions
- Quiz Answers
- What Is A Pointer (3:38)
- Pointer variables (3:12)
- Indirection (1:51)
- Addresses and Indirection
- How to display pointer values
- What is the relationship between a pointer and an array (3:46)
- Arrays addresses and pointers (5:52)
- Multiple Indirection (1:41)
- Multiple indirection with integers (8:02)
- Multiple indirection with strings (4:59)
- Indirection and commandline args (3:21)
- Generic pointers (4:44)
- Allocating memory (5:40)
- malloc and sizeof (4:46)
- Functions that cause errors or warnings (2:50)
- calloc (4:24)
- free (3:07)
- realloc (4:05)
- Pointer arithmetic (5:03)
- Calculating an array index (3:36)
- Pointers to structs (6:49)
- Data type alignment (8:47)
- Type Alignment On Boundaries (2:06)
- Type alignment and pointer arithmetic (2:17)
- Lists and data structures
- Arrays And Lists (1:26)
- What is a linked list (3:41)
- Singly linked lists (4:55)
- To Free Or Not To Free (0:45)
- Doubly Linked Lists (2:11)
- Programming A Doubly Linked List (3:20)
- Initializing a doubly linked list (1:10)
- Implementing a doubly linked list (10:11)
- What Is A Queue (2:35)
- Queues (4:25)
- What Is A Stack (2:10)
- Stacks (2:28)
- Pushing and popping (5:07)
- Calculating the length of a list (3:16)
- Copying a list (4:02)
- Removing an element from within a list (6:17)
- Adding an element into a list (4:49)
- Function Pointers (1:04)
- Function pointer declarations (3:39)
- An array of function pointers (3:32)
- Common Pointer Problems
- Why do pointers cause problems? (1:39)
- Deep And Shallow Copies (3:54)
- A deeper look at deep and shallow copies (7:33)
- Incorrect memory allocation (1:56)
- Casting Pointers (2:09)
- Incorrect casts (3:31)
- Freeing already freed memory (3:07)
- Memory leaks (3:10)
- Using freed memory (2:13)
- Pointers out of scope (4:14)
- Dereferencing a null pointer (1:40)
- And Finally (4:30)
Access
Lifetime
Content
8 hours
Lessons
73
C Programming For Beginners
Launch Your Programming Mission with This Introduction to C
By Huw Collingbourne | in Online Courses
C is a general-purpose, imperative computer programming language that is ideal for developing firmware or portable applications. It is highly portable, making it a common choice for operating systems and microprocessors in hardware such as fridges and alarm clocks. C is a solid first language to learn since most programming languages are themselves today implemented in C. All of this is to say, this course is an excellent jumping off point for your programming odyssey.
- Access 73 lectures & 8 hours of content 24/7
- Master C programming concepts from the ground up
- Use the source examples to learn step-by-step
- Understand that special features of C: pointers, header files, null-terminated strings, buffers, IO
- Read the supplied eBook, The Little Book of C, to explore the topics in even more depth
Huw Collingbourne is the technology director at SapphireSteel Software, developers of the “Sapphire” Ruby IDE for Visual Studio and the “Amethyst” IDE for the Adobe Flash Platform. He is author of The Book Of Ruby from No Starch Press. He runs Bitwise Courses and teaches courses on a range of programming topics.
Huw has been a programmer for more than 30 years. He is a well-known technology writer in the UK. For over ten years he wrote the Delphi and Java programming column for PC Plus Magazine. He has also written numerous opinion and programming columns (including tutorials on C#, Smalltalk, ActionScript and Ruby) for a number of computer magazines, such as Computer Shopper, Flash & Flex Developer’s Magazine, PC Pro, and PC Plus. He is the author of the free ebook The Little Book of Ruby and is the editor of the online computing magazine Bitwise.
In the 1980s he was a pop music journalist and interviewed most of the New Romantic stars, such as Duran Duran, Spandau Ballet, Adam Ant, Boy George, and Depeche Mode. He is now writing a series of New Romantic murder mysteries.
At various times Huw has been a magazine publisher, editor, and TV broadcaster. He has an MA in English from the University of Cambridge and holds a 2nd dan black belt in aikido, a martial art which he teaches in North Devon, UK. The aikido comes in useful when trying (usually unsuccessfully) to keep his Pyrenean Mountain Dogs under some semblance of control.
Huw has been a programmer for more than 30 years. He is a well-known technology writer in the UK. For over ten years he wrote the Delphi and Java programming column for PC Plus Magazine. He has also written numerous opinion and programming columns (including tutorials on C#, Smalltalk, ActionScript and Ruby) for a number of computer magazines, such as Computer Shopper, Flash & Flex Developer’s Magazine, PC Pro, and PC Plus. He is the author of the free ebook The Little Book of Ruby and is the editor of the online computing magazine Bitwise.
In the 1980s he was a pop music journalist and interviewed most of the New Romantic stars, such as Duran Duran, Spandau Ballet, Adam Ant, Boy George, and Depeche Mode. He is now writing a series of New Romantic murder mysteries.
At various times Huw has been a magazine publisher, editor, and TV broadcaster. He has an MA in English from the University of Cambridge and holds a 2nd dan black belt in aikido, a martial art which he teaches in North Devon, UK. The aikido comes in useful when trying (usually unsuccessfully) to keep his Pyrenean Mountain Dogs under some semblance of control.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: beginner
Compatibility
- Internet required
Course Outline
- Getting Ready
- Welcome to the course
- C Editors and IDEs
- FAQ - Read This First!
- Install CodeLite (Windows or Mac)
- Install a C compiler on a Mac
- Introduction to CodeLite
- Programming C with NetBeans
- Importing Projects Into NetBeans
- Compiling C programs at the system prompt
- Using Visual Studio
- The Little Book Of C -- (download)
- C Source Code Archive
- C Quiz Questions
- C Quiz Answers
- C programming basics
- A first program - Hello world
- Arguments and return values
- Passing commandline arguments to your program
- How to open a command prompt on Windows or OS X
- printf
- Comments
- Variables, constants and types
- Variables and types
- Integers and floating point numbers
- Constants
- More about constants
- Naming conventions
- Operators, tests and user input
- Operators – equality and assignment
- Operators – tests and comparisons
- Compound assignment operators
- Increment and decrement operators
- if and else tests
- Problems with gets() and fgets()
- Input, buffers and flushing
- My own line-reading function
- Logical Operators
- Functions, arguments and switch
- Functions
- Arguments
- Switch statements
- Switch statements in more detail
- Arrays, loops and break
- Arrays
- Initializing arrays
- ‘while’ loops
- ‘do..while’ loops
- break
- break and continue
- Multidimensional arrays
- Strings, chars and pointers
- Strings, pointers and addresses
- Null-terminated strings
- Char arrays and pointers
- Arrays, pointers and assignment
- Strings and functions, stack and heap
- String functions
- char functions
- chars and strings
- Structs, enums, header files and scope
- structs
- typedef
- Enums
- Header files
- A custom header file
- Scope
- Scope and external files
- Static functions and variables
- Compiling from the commandline
- File-handling
- Opening and closing files
- File modes
- Reading and writing a text file
- Counting lines in a text file
- Search in a text file
- Binary files and memory allocation
- Binary files
- Allocating and freeing memory
- Types and type casts
- Creating a CD database
- Saving and loading records in a binary file
- Adding records to a binary file
- Modifying records in a binary file
- And finally…
Access
Lifetime
Content
13.5 hours
Lessons
124
C Programming: Complete Tutorial For Beginners
Learn Basic to Advanced Concepts in C Programming
By Sibaji Paul | in Online Courses
This video course is adapted from the instructor's 15 years of teaching undergraduate engineering students in the classroom. Designed to cover an entire introduction to the C language, this course will help you build a sold foundation in C and boost your confidence to face technical interviews.
- Access 124 lectures & 13.5 hours of content 24/7
- Write C programs independently
- Face technical interviews w/ confidence
- Learn how to do assignments in C programs
Siibaji Paul has been teaching computer science and programming since 2001. He did his M Tech in Computer Science and remained visiting faculty to the CSE department of Narula Institute of Technology. He has his own training institute where he provides training on various programming languages and technologies to the B Tech students on C, C++, Java, Android programming, Data structure and Algorithm, DBMS, SQL and PL/SQL.
In his classroom Sibaji usually teaches 100-150 students per semester on different subjects. When he is not taking class he enjoys learning some new technologies. In his leisure time one could find him enjoying time with his kids or gossiping with his wife over a container of tea. He is a "tea-totaller" and hates smoking.
In his classroom Sibaji usually teaches 100-150 students per semester on different subjects. When he is not taking class he enjoys learning some new technologies. In his leisure time one could find him enjoying time with his kids or gossiping with his wife over a container of tea. He is a "tea-totaller" and hates smoking.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: beginner
Compatibility
- Internet required
Course Outline
- Starting With C Programming
- Install Codeblocks IDE (6:48)
- Codeblocks IDE for Windows and write your First C code! (5:56)
- C Fundamentals
- Dealing With Character (9:08)
- Idea of Casting (4:12)
- The secret of Printf (2:39)
- Assignment Operator (1:56)
- Relational Operator for comarison (4:49)
- Logical Operators (6:56)
- Logical OR (4:17)
- Logical NOT (4:33)
- Short Curcuit Feature of AND and OR oeration (4:33)
- How to inpuut values into C Programme
- Branching, taking course of action on the basis of result of condition
- If Else Statement (11:01)
- If elseif else Statement (4:53)
- Programming Example (5:36)
- Do it Yourself (5:36)
- C Programming - 38 (8:22)
- Ternary Operator (5:06)
- Some moreinformation about if else statement (3:43)
- Nested if Else Check leap year (9:34)
- Do it again and again until satisfied, technique for iteration.
- While loop rogramming examle (7:02)
- While Loop Programming Example -2 (3:30)
- All about For Loop (12:34)
- Array - the Collection
- Intro to 1D Array (8:54)
- Way to store and manipulate string in C programming
- Introduction to string, using character array for storing string (7:06)
- How to input string from keyboard (5:40)
- Finding the length of string (5:40)
- Searching and counting target in string (6:32)
- Library function for string operations, string.h (6:30)
- Modularise your program using function.
- Introduction to function (10:34)
- Prototype or signature of function, declaring a function. (6:43)
- Create your own library, distribute functions to others. (13:48)
- Function example 1, a function to check prime number (9:31)
- More example on function (13:32)
- Another example, a function to test Armstrong Number (8:01)
- Recursion, how to write recursive functions.
- Introduction to recursion. (7:59)
- Introduction continues... (6:53)
- Recursion vs Iteration, the big debate, Concept of TAIL recursion. (7:19)
- The debate continues... when exactly iteration is preferable. (9:22)
- Still in debate... when recursion is preferable. (9:29)
- Tower of Hanoi, the classical example of recursion. (6:21)
- Implementation of Tower of Hanoi (7:10)
- Another example, Fibonacci term. (3:17)
- Storage class, important conception
- Introduction to storage class, the auto storage class (11:27)
- Storage class: static (3:25)
- Storage class: extern (10:28)
- Storage class: register (4:23)
- Pointers, tweak with memory locations.
- Conception of stack and heap memory (4:48)
- Introduction to pointers (9:17)
- ntroduction to pointers, continues... (5:23)
- Introduction to pointers, continues...#2 (7:00)
- Address arithmetic (7:45)
- More on pointers (4:34)
- How and when to use pointers in C program (6:22)
- More example on passing one dimensional array to function (5:05)
- use of const keyword with pointer (8:24)
- Add some more glue (8:56)
- Dynamic memory allocation - malloc function (12:46)
- Dynamic memory allocation - calloc function (12:44)
- Dynamic memory allocation - realloc function (2:25)
- Immutable property of string literals (5:00)
- Array of pointers (2:35)
- User defined type in C - structure, union and enum
- Introduction to User Defined Type, struct keyword (12:06)
- typedef keyword, creating alias to type (7:51)
- pointer to struct object (5:12)
- Writing behaviour (functions) for struct types - part1 (2:43)
- Writing behaviour (functions) for struct types - part2 (7:57)
- Using struct type within another struct type (5:40)
- declaring enumerated constants, enum keyword (2:12)
- declaring enumerated constants, enum keyword (8:15)
- Variable argument passing to function
- How to pass variable arguments to function. (9:20)
- Command line argument passing.
- Command line arguments, parameters to main method (7:42)
- Command line arguments - more example (10:09)
- Passing cmd line args in Netbeans (6:34)
- How to pass command line arguments in Codeblocks (2:07)
- Get information about environment, the environmental parameter in main (1:33)
- File Handling
- Introduction to file handling, writing characters into a text file using fputc() (2:10)
- Introduction to file handling, writing characters into a text file using fputc() (12:47)
- Reading a line from text file into a character array using fgets function (6:28)
- Reading formatted data from text file using fscanf fucntion (4:47)
- Writing formatted data into text file using fprintf function (4:41)
- Formatted data reading and writing - another example (4:05)
- Writing in binary mode - fwrite function (6:41)
- Reading in binary mode - fread function (6:20)
- Moving the file pointer at any desired location using fseek (4:16)
- Calculating the number of records in a binary file using ftell (10:24)
- Bitwise operators - Learn how to manipulate bits.
- Introduction to bitwise operators (5:52)
- Bitwise left shift operator (5:00)
- Bitwise right shift operator (2:44)
- Bitwise AND operator - how to check a bit. (3:32)
- Count set bits - Using bitwise AND and left shift. (8:14)
- Print the signed integer as it is (4:21)
- Bitwise OR operation - How to set an unset bit? (5:39)
- Bitwise XOR operation. (3:50)
- Bitwise complement - invert every bits. (2:50)
Access
Lifetime
Content
6 hours
Lessons
66
Learn Data Structures Using C Programming Language
Gain an In-Depth Understanding of Arrays, Stacks, Queues, Linked Lists, Trees, Graphs, & More
By Gayatri TR | in Online Courses
Programming isn't just about learning a language and starting to write programs like stories. One has to learn certain concepts that are fundamental to computer science in general. This course teaches fundamentals of data structures in a step-by-step manner. You'll cover topics such as arrays, stacks and queues, linked lists, trees, and graphs in detail, alongside a variety of do-it-yourself coding exercises, building up your coding repertoire.
- Access 66 lectures & 6 hours of content 24/7
- Cover internal sorting, external sorting, symbol tables, & files
- Complete meticulously planned coding exercises to strengthen your skills
Gayatri TR is a coder and researcher, has several years of experience in coding in C for a wide range of projects encompassing device drivers, embedded systems, natural language and speech applications, algorithms & data structures, and much more.
Apart from these, she has deep interest in several other diverse fields like electronic circuits, compiler design, computational linguistics, machine learning, Samskrutam, music, philosophy, and the list goes on..
Gayatri comes with a very strong academic and industrial background with international exposure. She hopes to bring a positive change in the lives of each and every one of her students by sharing her knowledge and wisdom gained through her years of experience.
Apart from these, she has deep interest in several other diverse fields like electronic circuits, compiler design, computational linguistics, machine learning, Samskrutam, music, philosophy, and the list goes on..
Gayatri comes with a very strong academic and industrial background with international exposure. She hopes to bring a positive change in the lives of each and every one of her students by sharing her knowledge and wisdom gained through her years of experience.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels
Compatibility
- Internet required
Course Outline
- Sec-1: Course Details
- Lec-1.1: Prerequisites, Topics covered, and Reference book (2:28)
- Lec-1.2: About quizzes and exercises (2:52)
- Sec-2: Introduction to Data Structures
- Lec-2.1: Why study Data Structures and What is a Data Structure (2:12)
- Lec-2.2: The Big-O notation for representation of performance measure of algorithms (11:19)
- Sec-3: Arrays : An Introduction
- Lec-3.1: The definition of an array (3:30)
- Lec-3.2: Array limits (2:08)
- Lec-3.3: Element addressing in an array (9:52)
- Sec-4: An application of arrays: Fast Transpose of a Sparse Matrix
- Lec-4.1: Introduction to Sparse Matrix Transpose (2:16)
- Lec-4.2: Sparse matrix representation in a program (3:13)
- Lec-4.3: First attempt at sparse matrix transpose: A crude solution (4:19)
- Lec-4.4: Second attempt at sparse matrix transpose: A simple solution (7:49)
- Lec-4.5: Third and final attempt: Fast Transpose of a Sparse Matrix (8:48)
- Sec-5: Stacks and Queues: Introduction
- Lec-5.1: An Introduction to Stacks and Queues (2:24)
- Sec-6: Stack functionalities
- Lec-6.1: Stack functionalities and "push" function (4:03)
- Lec-6.2: "pop" function in Stacks (3:29)
- Sec-7: An application of stacks: A Mazing Problem
- Lec-7.1: Stacks in Procedure Calls and Recursion (6:21)
- Lec-7.2: Introduction to A Mazing Problem (6:26)
- Lec-7.3: Recursive solution to A Mazing problem: A partial solution (7:15)
- Lec-7.4: Recursive solution to A Mazing problem: A full solution (6:22)
- Lec-7.5: Non-recursive solution to A Mazing Problem (7:27)
- Sec-8: Queue functionalities
- Lec-8.1: Queue definitions and Linear Queue (6:40)
- Lec-8.2: Circular Queue (6:45)
- Sec-9: Linked Lists
- Lec-9.1: Why do we need linked lists? (5:20)
- Lec-9.2: What is a linked list? (4:31)
- Lec-9.3: Creation of a linked list (3:38)
- Lec-9.4: Insertion of a new node in between two nodes in a singly linked list (6:00)
- Lec-9.5: Insertion of a new node at the corners in a singly linked list (3:10)
- Lec-9.6: Deletion of a node in a singly linked list (4:45)
- Lec-9.7: Inplace reversal of a singly linked list (4:40)
- Lec-9.8: Insertion and deletion of a node in a doubly linked list (8:28)
- Sec-10: Trees : An Introduction
- Lec-10.1: Terms associated with Tree data structure (6:12)
- Sec-11: An application of Trees : "Set" representation
- Lec-11.1: Representation of trees using array (5:35)
- Lec-11.2: Union of two disjoint sets : First version: A simple union (6:03)
- Lec-11.3: Find the root element of a tree: First version: A simple find (6:05)
- Lec-11.4: Union of two disjoint sets : Second version: Weighted union (9:59)
- Lec-11.5: Find the root element of a tree: Second version: Reduction in tree height (6:02)
- Sec-12: Binary Trees
- Lec-12.1: Definition of a binary tree and Types of binary trees (4:34)
- Lec-12.2: Some interesting properties of binary trees (3:18)
- Lec-12.3: Representation of binary trees using arrays (4:59)
- Lec-12.4: Representation of binary trees using linked lists (4:53)
- Lec-12.5: Binary Tree Traversal (3:39)
- Lec-12.6: Inorder, preorder, and postorder traversals : An Introduction (10:03)
- Lec-12.7: Inorder, preorder, and postorder traversals : An Implementation (4:01)
- Sec-13: Graphs : An Introduction
- Lec-13.1: Basic Graph Terminologies (3:34)
- Lec-13.2: Complete graph and Subgraph (6:14)
- Lec-13.3: Connected component of a graph (7:18)
- Lec-13.4: Degree of a vertex (1:58)
- Sec-14: Graph Representation
- Lec-14.1: Graph representation using Adjacency Matrix (4:10)
- Lec-14.2: Graph representation using Adjacency List (6:59)
- Lec-14.3: Representation of a directed graph (3:05)
- Lec-14.4: How to find out the degree of a vertex in a graph (2:49)
- Lec-14.5: Inverse adjacency list for a directed graph (2:03)
- Sec-15: Graph search: Depth First Search (DFS) and Breadth First Search (BFS)
- Lec-15.1: Depth First Search (DFS) (5:05)
- Lec-15.2: Breadth First Search (BFS) (6:05)
- Lec-15.3: Time estimates of DFS and BFS (7:35)
- Sec-16: Graph application : Finding Connected Components of a graph
- Lec-16.1: How to find out the connected components of a graph using DFS/BFS (7:57)
- Sec-17: Graph application : Minimum Spanning Tree algorithm
- Lec-17.1: Finding spanning trees using BFS or DFS (6:02)
- Lec-17.2: What is a minimum spanning tree? (5:12)
- Lec-17.3: The minimum spanning tree algorithm : Theory (5:26)
- Sec-18: Implementation of the Minimum Spanning Tree Algorithm
- Lec-18.1: Extracting a list of unique edges from adjacency list (8:06)
- Lec-18.2: Finding the edge with least cost from the list of unique edges (5:56)
- Lec-18.3: Use of set union and find-root operations for detecting cycles in the tree (10:19)
- Lec-18.4: Constructing the minimum spanning tree: Putting it all together (10:24)
- Sec-19: Graph application: Dijkstra's Shortest Path Algorithm
- Lec-19.1: An introduction to the shortest path algorithm (4:30)
- Lec-19.2: Data structures used in the shortest path algorithm (7:16)
- Lec-19.3: Implementation of the shortest path algorithm as a program (11:35)
Access
Lifetime
Content
5 hours
Lessons
47
C Programming Language Refresher
Reinforce Your Knowledge of C & Apply It to Real World Problems
By Gayatri TR | in Online Courses
This course will help you strengthen your fundamental understanding of C language. Using a real-world approach, it introduces several components of C programming that you may encounter in everyday programming challenges. This is the course to solidify your understanding of C, and give you that extra push you need to ace any important interview or test.
- Access 47 lectures & 5 hours of content 24/7
- Understand using C in real-world terms
- Start developing a full-fledged C program
- Cover many C programming concepts in a rigorous, but simple program
- Reinforce concepts w/ included content questions
Gayatri TR is a coder and researcher, has several years of experience in coding in C for a wide range of projects encompassing device drivers, embedded systems, natural language and speech applications, algorithms & data structures, and much more.
Apart from these, she has deep interest in several other diverse fields like electronic circuits, compiler design, computational linguistics, machine learning, Samskrutam, music, philosophy, and the list goes on..
Gayatri comes with a very strong academic and industrial background with international exposure. She hopes to bring a positive change in the lives of each and every one of her students by sharing her knowledge and wisdom gained through her years of experience.
Apart from these, she has deep interest in several other diverse fields like electronic circuits, compiler design, computational linguistics, machine learning, Samskrutam, music, philosophy, and the list goes on..
Gayatri comes with a very strong academic and industrial background with international exposure. She hopes to bring a positive change in the lives of each and every one of her students by sharing her knowledge and wisdom gained through her years of experience.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels
Compatibility
- Internet required
Course Outline
- Introduction: What is our goal in this project?
- About C Language (6:35)
- Concepts covered in the first project (2:53)
- Description of the first project (5:06)
- How to answer quizzes (1:43)
- How to learn thoroughly: Repeat the code yourself (0:34)
- Task-1 of the project: Generation of 10 random numbers and storing them in files
- Let's code: Generate one random number (14:46)
- Intro to Variable Declarations (3:35)
- Intro to Pointers (5:39)
- Function Declarations (9:54)
- Scoping (7:30)
- More on scoping (10:05)
- Arithmetic operators (2:35)
- Output statement: printf (1:07)
- Commenting the code (2:08)
- Let's code: Generate 10 random numbers (8:29)
- Let's Code: Character array and string copy (10:29)
- Let's Code: More on strings (10:16)
- Let's Code: File creation (10:07)
- Let's Code: Writing into a file (6:55)
- Task-2 of the project: Creation of linked list
- Structures and Lists (5:08)
- Comparison of lists and arrays (2:46)
- Memory allocation: malloc (3:16)
- Let's Code: Defining a structure and reading from a file (10:33)
- Let's Code: Creation of the first list element (10:35)
- Let's Code: Creation of the 2nd list element (8:05)
- Let's Code: Creation of the n-th list element (10:00)
- Why we do not use debugger now (2:19)
- Task-3 of the project: Text file reading, String processing, Memory allocation
- Description of the problem (6:22)
- Array of strings & reading a line from a text file (5:31)
- Let's Code: add a string array and read from a file (8:23)
- isspace and isalpha (3:41)
- Let's Code: get first word from line (7:19)
- Let's Code: Fill in the string field in the structure element (6:48)
- Let's Code: Task-3 completion, compile and run (9:20)
- Task-4 of the project: Sorting linked list in ascending order based on numbers
- Description of the task: Sorting the list in ascending order (5:47)
- Let's Code: Sorting in ascending order (8:16)
- Let's Code: Inserting a node in the list (7:52)
- Let's Code: Task-4 completion, compile and run (4:14)
- Task-5 of the project: Sorting linked list in descending order based on strings
- Description of the task: Sorting the list in descending order (1:58)
- Let's code: Sorting in descending order (11:48)
- Let's code: Completion of task-5, compile and run (4:34)
- Command-line arguments
- Let's code: A quick demo of using command-line argument (7:28)
- What are command-line arguments? (6:43)
- Let's code: Using command-line arguments in code (10:23)
- Compiling the code using gcc compiler
- Demo of using gcc to compile the code on cygwin (8:50)
- Where do you want to go from here?
- Future additions and possibilites (2:33)
- Conclusion (1:05)
Access
Lifetime
Content
12 hours
Lessons
60
From 0 to 1: C Programming
Dive into This Foundational Language to Build a Solid Programming Skill Set
By Loonycorn | in Online Courses
Consider C the programming equivalent of a French mother sauce. Just as chefs can create countless derivatives from a humble Bechamel, so too can developers easily master scores of languages upon learning C. This course will walk you through technical concepts such as loops, strings, and more, allowing you to conquer C and build a wide variety of apps and programs in no time at all.
- Master C programming w/ 12 hours of content
- Master language constructs: if/else & case statements, while & for loops, etc.
- Familiarize yourself w/ functions, arrays & strings
- Understand basic principles important to general programming
- Craft a strong foundation for other languages: Objective-C, PHP & more
Loonycorn is comprised of two individuals—Janani Ravi and Vitthal Srinivasan—who have honed their respective tech expertise at Google and Flipkart. The duo graduated from Stanford University and believes it has distilled the instruction of complicated tech concepts into funny, practical, engaging courses, and is excited to be sharing its content with eager students.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels
Compatibility
- Internet required
Course Outline
- Getting your feet wet
- C Programming: Still Relevant
- The Basic Structure of a C Program
- C Data Types
- Language constructs
- If/Else Statements - I
- If/Else Statements - II
- If/Else Statements - III
- If/Else Statements - IV
- If/Else Statements - V
- Case Statements
- Case Statements - II
- Case Statements - III
- While Loops
- Break and Continue
- For Loops
- Pre- and Post-Increment Operators
- Functions
- Functions - Delegate your way to the top
- C Functions: Defining, Declaring and Calling them
- Parameter Passing: Pass-by-value and pass-by-reference
- Some loose ends
- Storage classes in C
- Preprocessor Directives
- More Pre-processor directives
- Console IO
- Console IO - printf
- Console IO - printf
- Console IO - scanf
- Console IO - miscellany
- File IO
- Buffers and Streams
- File Operations are n't rocket science
- More on file operations
- Binary and Text Files
- Bit Manipulation
- Bit Manipulation - I
- Bit Manipulation - II
- Useful Bit Manipulation Techniques
- Get And Set The Nth Bit
- Print And Count Bits
- Reverse The Bits In An Integer
- Structs and Unions
- C Structs - User-Defined Types Introduced
- C Structs: Everything you can do with them
- C Unions
- Dynamic Memory Allocation
- Dynamic memory allocation
- Free that memory!
- Stack and Heap Memory
- More ways to allocate memory
- Arrays
- Arrays in C
- Passing arrays as functions arguments
- Strings as character arrays
- Pointers
- Introduction to pointers
- Pointer problems and arrays
- Function Pointers
- Pointer arithmetic
- Practice makes perfect - pointer problems
- Strings are just pointers at heart
- Working with strings
- Pointers as arguments to functions
- Practice makes perfect - string problems
- Linked lists can be fun!
- Pointers to pointers: bend your mind
- Pointers to pointers: reassignment and modification
- Get started with linked lists
- Warming up - linked lists get tricky quickly
- Cruising along - linked lists are fun!
- Autopilot - Linked lists are easy now!
- The doubly linked list
Access
Lifetime
Content
3 hours
Lessons
13
C Programming for Beginners: Go from Zero to Hero!
Build an Ironclad Programming Foundation by Learning C
By EDUmobile Academy | in Online Courses
The C programming language is one of the earlier programming languages, and many other languages have their syntax based on C. Therefore, learning C can be an excellent introduction to programming as it makes learning many subsequent languages, like Java, PHP, or Swift, much easier. This introductory course will get you up to speed on C and enable you to dive into other languages more easily.
- Access 13 lectures & 3 hours of content 24/7
- Learn the foundations of C, from data types & operators to command line arguments & more
- Understand functions & structures in C
- Discover the stack vs. the heap & dynamic allocation
- Write a program using C
Eduonix creates and distributes high-quality technology training content. Their team of industry professionals has been training manpower for more than a decade. They aim to teach technology the way it is used in the industry and professional world. They have a professional team of trainers for technologies ranging from Mobility, Web and Enterprise, and Database and Server Administration.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: beginner
Compatibility
- Internet required
Course Outline
- Introduction to C
- Introduction
- Finding and Installing the GCC Compiler
- Basic Syntax and Hello World Program
- C Language Primitive Types
- Man Documentation and the Size of Function
- Arithmetic Operators, Part 1
- Arithmetic Operators, Part 2
- Arrays, Pointer and Conditional Expressions
- Conditional Expressions and Comparison
- Boolean Operators Demo
- If, if..else, if..else if..else
- Arrays, Part 1
- Arrays, Part 2
- Introducing Pointers
- First Pointer Demo
- Functions and Loops
- While, do, and for loops
- Intro to Functions
- Pass by Value and Pass by Reference
- Demo: Pass by Value and Pass by Reference
- Link to GNU C Functions
- Using the GCC Function List
- Using scanf for Input
- Pointers and Structures
- Pointer Arithmetic
- Finding Max and Min with Pointer Arithmetic
- Structures, the Stack, and the Heap
- Demo of Structures
- More on Stack, Queue and Doubly List
- Linked Lists
- Stack Demo: Basic Operations
- A Simple Stack Based Command Interpreter
- Queue Demo: Basic Operations
- A Simple Queue Based Task List
- Doubly Linked List Demo
Access
Lifetime
Content
3 hours
Lessons
32
Algorithms in C: Concepts, Examples, Code + Time Complexity
Computer Science Runs on Algorithms & It's Time to Get Up to Speed
By EngineeringMentor | in Online Courses
Algorithms are a central tenet to programming, and are essential to ensure that software and programs perform the right operations under the right conditions. Companies depend on their systems algorithms to function correctly, which means they'll pay top dollar for people who understand how to work with them. This course will help you to understand how to implement logic in code form to enable you to write algorithms efficiently in C.
- Access 32 lectures & 3 hours of content 24/7
- Learn the concepts behind the most popular algorithms used in computer science
- Understand how algorithms work w/ the help of diagrams, examples & pseudocode
- Practice algorithm implementation w/ the help of included programs in C language
- Understand how to use algorithms to implement logic in any programming
Engineering Mentor is an online educational start-up, providing educational resources to IT and non-IT students. At Engineering Mentor, we create high quality resources in clear and easy to understand methods.
We have a team of qualified engineers who create resources to guide students through the toughest aspects of technical and non-technical education.
We have a team of qualified engineers who create resources to guide students through the toughest aspects of technical and non-technical education.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels, but a basic knowledge of C would be helpful
Compatibility
- Internet required
Course Outline
- Introduction
- Course Introduction and Author Bio
- Course Curriculum & Upcoming lectures
- Brute Force Approach
- Selection Sort Algorithm
- Bubble Sort Algorithm
- Sequential Search Algorithm
- Brute Force String Matching Algorithm
- Brute Force Quiz
- Divide and Conquer Approach
- Merge Sort Algorithm
- Quick Sort Algorithm
- Divide and Conquer Quiz
- Decrease and Conquer Approach
- Binary Search Algorithm
- Insertion Sort Algorithm
- Depth First Search Algorithm
- Breadth First Search Algorithm
- Decrease and Conquer Quiz
- Transform and Conquer Approach
- Heaps
- Heap Construction [bottom-up approach]
- Heap Sort Algorithm
- Dynamic Programming
- Warshall's Algorithm
- Floyd's Algorithm
- Dynamic Programming Quiz
- Greedy Technique
- Prim's Algorithm
- Kruskal's Algorithm
- Greedy Technique Quiz
- Bonus Section : Time Complexity
- Introduction to Analysis of Algorithms
- Asymptotic Notations
- Time Complexity - Selection Sort Algorithm
- Time Complexity - Bubble Sort Algorithm
- Time Complexity - Sequential Search Algorithm
- Time Complexity - String Matching Algorithm
- Time Complexity - Insertion Sort Algorithm
- Time Complexity - Warshall's Algorithm
- Time Complexity - Floyd's Algorithm
- Master Theorem
- Time Complexity Quiz
- Number Theoretic Algorithms
- Euclid's Algorithm [GCD of two numbers]
- C Program on Euclid's Algorithm
- RSA Algorithm (6:23)
- Number Theory Quiz
Access
Lifetime
Content
4 hours
Lessons
22
C Puzzles for Interview Prep
Ace Any C Programming Interview After You've Prepared with This Course
By In28MinutesOfficial | in Online Courses
Knowing the fundamentals of C programming is the first step to getting any C-heavy job. You may feel like you've got the language down, but it's the most basic things that are the easiest to slip your mind when you sit down for an interview. This course irons out and tests your knowledge of all the core C programming fundamentals that you'll need to know in order to ace an interview, so you don't have to worry!
- Access 22 lectures & 4 hours of content 24/7
- Test & improve your knowledge on the intricacies of the C programming language
- Reinforce your knowledge of variables & variable types & expressions
- Build a better foundation w/ arrays, functions, pointers, structures & more
- Iron out if conditions, switch statements, for loops, preprocessor directives & more
Ranga Karanam is an Architect with 15 Years of Java Programming and Design Experience. He had the good fortune of Architecting Java Applications for Major Banking Clients across the world - India, United States and the Netherlands. Other than Programming, he has a strong passion for Hiking. His goal is to spend a year hiking in the Himalayas.
Ranga started in28Minutes with the aim to create Hands-on Courses with Real World Projects. Step-By-Step series of Courses is one of their creations. They have 1.5 Million Views and 12K Subscribers on their YouTube Channel, and look forward to replicating the same success on StackSkills.
Ranga started in28Minutes with the aim to create Hands-on Courses with Real World Projects. Step-By-Step series of Courses is one of their creations. They have 1.5 Million Views and 12K Subscribers on their YouTube Channel, and look forward to replicating the same success on StackSkills.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: beginner
Compatibility
- Internet required
Course Outline
- Introduction to C Puzzles
- Introduction
- Basics
- Introduction
- Variable Types
- Arrays
- Arrays - Basics
- Character Arrays
- Expressions
- Expressions - Basics
- Precedence and Associativity
- Expressions - Advanced
- Functions
- Functions
- More about Functions
- Conditionals and Loops
- If Statement - Basics
- Switch Statement
- For Loop
- Pointers
- Pointers
- More Puzzles about Pointers
- Pointers to Pointers
- Pointers and Arrays
- Structures and More
- Structures
- Miscellaneous Topics
- Printf
- Preprocessor Directives
- Conclusion
Access
Lifetime
Content
26 hours
Lessons
307
C, C++, Python and Ruby Programming
Learn 4 of the Most Popular & Powerful Programming Languages on Earth
By DoEdu IT Educations | in Online Courses
C, C++, Ruby, and Python are four of the most popular and powerful programming languages used today. You can find them in everything from web and mobile apps, games, operating systems, all of your favorite websites, and many hardware devices. This comprehensive course teaches you fundamentals in all 4, giving you a valuable programming background that you can confidently boast on your resume.
- Access 307 lectures & 26 hours of content 24/7
- Understand standard programs in C, C++, Python & Ruby programming
- Explore the world of software languages
- Write your own programs in C, C++, Python & Ruby
DoEdu IT Educations is the tutorial which provides in depth knowledge of various theory and practical aspects in software languages. We create our tutorials in perspective of real time applications.
DoEdu IT goal is to reach people world wide who are looking for carrier in IT/Software industry, which provides high quality training to the Aspiring persons, we do our work with pride and passion we are actually very much inspired Udemy.
DoEdu IT Educations primary goal is to provide professional couching with very low price tag, so helping the people who wants quality training with low cost, We are group of people working in top MNC in india who wants to create online tutorials on various software languages which contains the real time scenarios.
DoEdu IT goal is to reach people world wide who are looking for carrier in IT/Software industry, which provides high quality training to the Aspiring persons, we do our work with pride and passion we are actually very much inspired Udemy.
DoEdu IT Educations primary goal is to provide professional couching with very low price tag, so helping the people who wants quality training with low cost, We are group of people working in top MNC in india who wants to create online tutorials on various software languages which contains the real time scenarios.
Details & Requirements
- Length of time users can access this course: lifetime
- Access options: web streaming, mobile streaming
- Certification of completion not included
- Redemption deadline: redeem your code within 30 days of purchase
- Experience level required: all levels
Compatibility
- Internet required
Course Outline
- Introduction
- 4 in 1 intro
- C Programming Language
- 1 introduction (5:07)
- 2 codeblocks (7:21)
- 3 first program (10:12)
- 4 comment (2:13)
- 5 Keywords and Identifiers (1:37)
- 6 C Tokens (3:54)
- 7 Data types (2:09)
- 8 adding two numbers (14:37)
- 9 add two floats (1:40)
- 10 Display name (3:41)
- 11 swap two numbers (13:27)
- 12 more examples (12:32)
- 13 conditions and loops if-else statements (7:38)
- 14 for and whil loops (10:27)
- 15 largest number (4:12)
- 16 vowel or consonant (2:34)
- 17 multiplication table (3:57)
- 18 printing star traingle (8:50)
- 19 functions introduction (5:08)
- 20 function add() (5:11)
- 21 function exmple add() sub() (3:05)
- 22 function example add() sub()2 (5:57)
- 23 arrays (5:27)
- 24 arrays example (5:04)
- 25 arrays adding marks (6:01)
- 26 multi-dimensional arrays (4:32)
- 27 multi-dimensional arrays example1 (8:04)
- 28 three dimensional arrays example (3:16)
- 29 adding two arrays (4:50)
- 30 changing the output result look (4:59)
- 31 string introduction (3:40)
- 32 gets() puts strings (5:38)
- 33 calling function using string type (1:53)
- 34 string functions introduction (2:26)
- 35 string function example (4:19)
- 36 Pointers introduction (8:06)
- 37 pointers example (4:39)
- 38 pointer example 2 (2:46)
- 39 pointers and arrays (7:44)
- 40 pointers and arrays example (3:42)
- 41 pointers and functions (3:01)
- 42 Dynamic memory allocation (4:08)
- 43 Example of Dynamic memory allocation (5:42)
- 44 structures in c (4:44)
- 45 structures using pointers (2:33)
- 46 structures and functions (3:05)
- 47 unions (2:37)
- 48 C Enumeration (5:40)
- 49 preprocessor and macros (5:18)
- 50 conclusion (2:33)
- C++ Programming
- 0 Introduction (2:51)
- 1 First program.mp4.ns (8:36)
- 2 comment and endl (6:14)
- 3 data types integer (5:34)
- 4 data type char (1:50)
- 5 data type float (2:23)
- 6 user input data (4:23)
- 7 program to convert gallons to litres (3:27)
- 8 program to add two numbers (3:56)
- 9 program to swap two numbers (7:50)
- 10 printing the name and age (4:37)
- 11 Escape sequence (3:15)
- 12 constants (3:41)
- 13 new line using define (2:25)
- 14 operators in c++ (9:57)
- 15 if else satements introdution (6:16)
- 16 c program to find number is positive or negative (5:38)
- 17 c++ program to find the largest number (7:04)
- 18 nested if statements (3:27)
- 19 Loops Introduction (2:46)
- 20 For Loop Example (5:15)
- 21 Program to print multiplication table (5:36)
- 22 Nested For Loops (3:04)
- 23 while loop (3:19)
- 24 do while loop (3:03)
- 25 Finding the factorial of number (5:12)
- 26 Break statement (2:17)
- 27 continue statement (4:28)
- 28 Switch-Case Statements (8:21)
- 29 Functions in c++ Introduction (4:14)
- 30 Functions in c++ example add( ) (6:44)
- 31 Functions example2 (6:16)
- 32 Arrays Introduction (7:31)
- 33 one dimensional arrays (5:57)
- 34 one dimensional array example (5:28)
- 35 array example 2 (6:52)
- 36 array example 3 (4:51)
- 37 adding marks using arrays (6:36)
- 38 Two dimensional arrays (6:08)
- 39 Two dimensional array example (4:29)
- 40 Three dimensional arrays (4:26)
- 41 Adding two arrays (10:36)
- 42 Strings in C++ Introduction (6:17)
- 43 String Example (3:48)
- 44 String Functions (8:37)
- 45 Pointers Introductioni (4:19)
- 46 Pointers Example (7:04)
- 47 Pointers and Arrays (6:56)
- 48 Pointers and Arrays Example (6:59)
- 49 Pointers and Funtions (13:13)
- 50 References in C++ (4:01)
- 51 Reference Example (3:09)
- 52 Data Structures Introduction (10:42)
- 53 Structures Example (5:36)
- 54 Pointers in Structures (3:09)
- 55 Structures and Funtions (6:38)
- 56 Unions (4:43)
- 57 Enemurated Data Types (5:20)
- 58 OOPs Introduction (7:14)
- 59 class and objects (6:00)
- 60 class and object Example (6:09)
- 61 class and object example (8:32)
- 62 Inheritance (7:52)
- 63 Multiple inheritance and visibility (11:22)
- 64 Inheriatance example (9:09)
- 65 Inheritance example2 (3:39)
- 66 Inheritance visibility section example (7:13)
- 67 Using protected members (2:21)
- 68 Protected Inheritance (10:11)
- 69 Multiple Inheritance example (6:39)
- 70 Constructor and Destructor Introduction (4:28)
- 71 Default Constructor (4:07)
- 72 Parameterized Constructor (3:54)
- 73 Copy Constructor (2:21)
- 74 Destructor (2:44)
- 75 Polymorphism Introduction (2:25)
- 76 Function Overriding (5:31)
- 77 Function overloading pointers (1:01)
- 78 Virtual Funtion (4:28)
- 79 Abstract class and pure virtual function (10:36)
- 80 Virtual Destructor (6:50)
- 81 Function Overloading (4:56)
- 82 Operator overloading (2:54)
- 83 namespace (3:09)
- 84 using namespace (2:27)
- 85 conclusion (2:14)
- Python Programming Language
- 1 Introduction (8:15)
- 2 First Program (5:36)
- 3 Basics1 (5:56)
- 4 Commenting (5:41)
- 5 Variables (5:58)
- 6 variable2 (4:08)
- 7 User entered data (5:59)
- 8 Operators (6:17)
- 9 Creating file and .exe file (7:34)
- 11 If statement (5:35)
- 12 If-else statements (5:16)
- 13 Program to print odd or even (5:25)
- 14 Program to find vowel (6:51)
- 15 Find the greatest number (5:23)
- 16 For Loops (6:10)
- 17 While Loops (4:53)
- 18 Program to print factorial of number (7:00)
- 19 Program for multiplication table (2:45)
- 20 multi multiplication table (5:50)
- 21 Exponential Program (4:55)
- 22 Break statement (4:16)
- 23 continue statement (3:01)
- 24 Example password (5:15)
- 25 Functions and Modules (7:09)
- 26 User defined functions (5:22)
- 27 Functions with arguements (4:02)
- 28 Creating modules (6:16)
- 29 Strings (4:35)
- 30 Strings2 (2:55)
- 31 List introduction (6:03)
- 32 List methods (6:57)
- 33 Tuples (3:47)
- 34 Dictionaries (6:05)
- 35 Time module (5:11)
- 36 Time module example (4:43)
- 37 delay time example (4:33)
- 38 Small assignment (2:48)
- 39 Calendar module (4:57)
- 40 Files intoduction (3:35)
- 41 Rename and Remove files (3:35)
- 42 Working with folders (5:47)
- 43 Exceptions (4:57)
- 44 Formatting inside print() (6:27)
- 45 .format() function (6:55)
- 46 Class and Object Introduction (4:01)
- 47 Class creation (5:44)
- 48 Constructor method (6:37)
- 49 Student class example (8:13)
- 50 Special functions (8:53)
- 51 Inheritance (3:29)
- 52 overloading (4:37)
- 54 Before GUI (3:30)
- 55 Creating window (3:27)
- 56 Changing size and position (4:51)
- 57 Adding Labels to window (4:43)
- 58 grid and place to change label position (7:16)
- 59 Adding buttons (4:22)
- 60Adding methods to buttons (4:30)
- 61 Creating text box (2:43)
- 62 two windows (6:44)
- 63 Adding menubar (5:13)
- 64 Adding menulist (4:59)
- 65 Adding functionality to menulist (3:20)
- 66 Changing font (3:16)
- 67 message box (6:13)
- 68 Creating a counter (6:40)
- 69 colorchooser (6:12)
- 70 askopenfile (4:04)
- 71 content inside file (3:29)
- 72 radio buttons intro (7:36)
- 73Radiobutton example (7:41)
- 74 Radio button interaction (7:54)
- 75 Radio button example (4:16)
- 76Indicatoron radiobutton (2:52)
- 77 Check button (5:09)
- 78 Check button values (7:01)
- 79checkbutton on menu list (4:15)
- 80 Entry class (6:23)
- 81 insert and delete in Entry (7:11)
- 82 litres to gallons example (9:26)
- 83 Litres gallons modifications (3:26)
- Ruby Programming Language
- 1 Introduction to ruby (7:07)
- 2 ruby software install (7:40)
- 3 First program (4:18)
- 4 Basic numbers (5:59)
- 5 Commenting (3:51)
- 6 variables (4:49)
- 7 text editor and file (6:56)
- 8 User input (7:10)
- 9 If statement (5:23)
- 10 if else statements (6:54)
- 11 Program to find odd or even (4:40)
- 12 vowel or consonant (4:28)
- 13Finding greatest number (5:25)
- 14 Operators in ruby (8:17)
- 15 While Loop (4:50)
- 16 Until Loop (4:52)
- 17 For Loops (4:26)
- 18 Program to find factorial of any number (8:46)
- 19 Program to print multiplication table (2:56)
- 20 Multi multiplication table (4:09)
- 21 Exponent value (2:50)
- 22 Break Statement (4:32)
- 23 Next statement (2:20)
- 24 redo (4:01)
- 25 .times (1:22)
- 26 Password example (6:53)
- 27 chomp (1:51)
- 28 print vs puts (4:24)
- 29 Interpolation (5:01)
- 30 Arrays (5:36)
- 31 Push and Pop in arrays (3:58)
- 32 loop in arrays (2:19)
- 33 Adding arrays (3:41)
- 34 Hashes (3:25)
- 35 Hashes methods (2:21)
- 36 Methods Introduction (4:56)
- 37 Methods example (3:54)
- 38 add and sub example (8:56)
- 39 methods with arguements (2:10)
- 40 list as arguement (5:35)
- 41 user entered array (5:37)
- 42 OOPs Introduction (6:38)
- 43 Class and Object (3:00)
- 44 Class and objects example (4:14)
- 45 Accessing attributes (8:12)
- 46 Constructor method (5:21)
- 47 attr_reader,writer,accessor (7:22)
- 48 singleton (3:19)
- 49 Inheritance (5:21)
- 50 Method overriding (2:49)
- 51 string method (3:16)
- 52 Multiple Inheritance (4:14)
- 53 Modules (3:11)
- 54 Begin and end blocks (3:32)
- 55 Class Variable (4:37)
- 56 Class Variable example (4:26)
- 57 Class method or self method (2:49)
- 58 setter and getter methods (6:45)
- 59 Global Variable (1:59)
- 60 Constants (2:45)
- 61 Object Freeze (3:08)
- 62 require statement to load files (2:58)
- 63 Ranges (5:52)
- 64 Blocks (3:03)
- 65 Blocks example (4:20)
- 66 Blocks with arguement (1:57)
- 67 Blocks Example (3:56)
- 68 Blocks with reference (3:16)
- 69 Procs (1:53)
- 70 Proc Example (2:58)
- 71 Lambda (1:30)
- 72.Proc.new and implicit method (4:25)
- 73 Example (6:21)
- 74 Difference between proc and lambda (7:12)
- 75 last diff between lambda and proc (2:41)
- 76 proc and arity method (2:59)
- 77 Example (5:37)
- 78 Time Class (3:34)
- 79 conclusion (2:00)
Terms
- Instant digital redemption
