Module Name | Download |
---|---|
noc20-cs53_Week_01_Assignment_01 | noc20-cs53_Week_01_Assignment_01 |
noc20-cs53_Week_01_Assignment_02 | noc20-cs53_Week_01_Assignment_02 |
noc20-cs53_Week_01_Assignment_03 | noc20-cs53_Week_01_Assignment_03 |
noc20-cs53_Week_02_Assignment_01 | noc20-cs53_Week_02_Assignment_01 |
noc20-cs53_Week_02_Assignment_02 | noc20-cs53_Week_02_Assignment_02 |
noc20-cs53_Week_02_Assignment_03 | noc20-cs53_Week_02_Assignment_03 |
noc20-cs53_Week_03_Assignment_01 | noc20-cs53_Week_03_Assignment_01 |
noc20-cs53_Week_03_Assignment_02 | noc20-cs53_Week_03_Assignment_02 |
noc20-cs53_Week_03_Assignment_03 | noc20-cs53_Week_03_Assignment_03 |
noc20-cs53_Week_04_Assignment_01 | noc20-cs53_Week_04_Assignment_01 |
noc20-cs53_Week_04_Assignment_02 | noc20-cs53_Week_04_Assignment_02 |
noc20-cs53_Week_04_Assignment_03 | noc20-cs53_Week_04_Assignment_03 |
noc20-cs53_Week_05_Assignment_01 | noc20-cs53_Week_05_Assignment_01 |
noc20-cs53_Week_05_Assignment_02 | noc20-cs53_Week_05_Assignment_02 |
noc20-cs53_Week_05_Assignment_03 | noc20-cs53_Week_05_Assignment_03 |
noc20-cs53_Week_06_Assignment_01 | noc20-cs53_Week_06_Assignment_01 |
noc20-cs53_Week_06_Assignment_02 | noc20-cs53_Week_06_Assignment_02 |
noc20-cs53_Week_06_Assignment_03 | noc20-cs53_Week_06_Assignment_03 |
noc20-cs53_Week_07_Assignment_01 | noc20-cs53_Week_07_Assignment_01 |
noc20-cs53_Week_07_Assignment_02 | noc20-cs53_Week_07_Assignment_02 |
noc20-cs53_Week_07_Assignment_03 | noc20-cs53_Week_07_Assignment_03 |
noc20-cs53_Week_07_Assignment_04 | noc20-cs53_Week_07_Assignment_04 |
noc20-cs53_Week_08_Assignment_01 | noc20-cs53_Week_08_Assignment_01 |
noc20-cs53_Week_08_Assignment_02 | noc20-cs53_Week_08_Assignment_02 |
noc20-cs53_Week_08_Assignment_03 | noc20-cs53_Week_08_Assignment_03 |
noc20-cs53_Week_08_Assignment_04 | noc20-cs53_Week_08_Assignment_04 |
noc20-cs53_Week_09_Assignment_01 | noc20-cs53_Week_09_Assignment_01 |
noc20-cs53_Week_09_Assignment_02 | noc20-cs53_Week_09_Assignment_02 |
noc20-cs53_Week_09_Assignment_03 | noc20-cs53_Week_09_Assignment_03 |
noc20-cs53_Week_10_Assignment_01 | noc20-cs53_Week_10_Assignment_01 |
noc20-cs53_Week_10_Assignment_02 | noc20-cs53_Week_10_Assignment_02 |
noc20-cs53_Week_10_Assignment_03 | noc20-cs53_Week_10_Assignment_03 |
noc20-cs53_Week_10_Assignment_04 | noc20-cs53_Week_10_Assignment_04 |
noc20-cs53_Week_11_Assignment_01 | noc20-cs53_Week_11_Assignment_01 |
noc20-cs53_Week_11_Assignment_02 | noc20-cs53_Week_11_Assignment_02 |
noc20-cs53_Week_11_Assignment_03 | noc20-cs53_Week_11_Assignment_03 |
noc20-cs53_Week_12_Assignment_01 | noc20-cs53_Week_12_Assignment_01 |
noc20-cs53_Week_12_Assignment_02 | noc20-cs53_Week_12_Assignment_02 |
noc20-cs53_Week_12_Assignment_03 | noc20-cs53_Week_12_Assignment_03 |
Sl.No | Chapter Name | MP4 Download |
---|---|---|
1 | Lecture 1 Part 1: Introduction | Download |
2 | Lecture 1 Part 2 : Introduction | Download |
3 | Lecture 1 Part 3 : Introduction | Download |
4 | Lecture 1 Part 4 : Introduction | Download |
5 | Lecture 2 Part 1 : Problem Solving using Computer | Download |
6 | Lecture 2 Part 2 : Problem Solving using Computer | Download |
7 | Lecture 2 Part 3 : Problem Solving using Computer | Download |
8 | Lecture 2 Part 4 : Problem Solving using Computer | Download |
9 | Lecture 2 Part 5 : Problem Solving using Computer | Download |
10 | Lecture 3 Part 1 : Basic Elements of Program | Download |
11 | Lecture 3 Part 2 : Basic Elements of Program | Download |
12 | Lecture 3 Part 3 : Basic Elements of Program | Download |
13 | Lecture 3 Part 4 : Basic Elements of Program | Download |
14 | Lecture 4 Part 1 : Program Design | Download |
15 | Lecture 4 Part 2 : Program Design | Download |
16 | Lecture 4 Part 3 : Program Design | Download |
17 | Lecture 5 : Simple cpp Graphics | Download |
18 | Lecture 6 Part 1 : Conditional Execution | Download |
19 | Lecture 6 Part 2 : Most general form of if | Download |
20 | Lecture 6 Part 3 : More general form of conditions | Download |
21 | Lecture 6 Part 4 : A somewhat large program example | Download |
22 | Lecture 6 Part 5 : Switch statement and logical data | Download |
23 | Lecture 7 Part 1 : Loops | Download |
24 | Lecture 7 Part 2 : Mark averaging | Download |
25 | Lecture 7 Part 3 : The break and continue statements | Download |
26 | Lecture 7 Part 4 : The for statement | Download |
27 | Lecture 7 Part 5 : Euclid's algorithm for GCD | Download |
28 | Lecture 7 Part 6 : Correctness proof for GCD | Download |
29 | Lecture 8 : Computing Mathematical Functions Part 1 : Taylor series | Download |
30 | Lecture 8 : Computing Mathematical Functions Part 2 : Numerical integration | Download |
31 | Lecture 8 : Computing Mathematical Functions Part 3 : Bisection Method | Download |
32 | Lecture 8 : Computing Mathematical Functions Part 4 : Newton Raphson Method | Download |
33 | Lecture 9 : Loops in various applications Part 1 : Loops in various applications brute force algorithms | Download |
34 | Lecture 9 : Loops in various applications Part 2 : Finding Pythagorean Triples | Download |
35 | Lecture 9 : Loops in various applications Part 3 : Modelling a system: bargaining | Download |
36 | Lecture 9 : Loops in various applications Part 4 : Simulating a water tank | Download |
37 | Lecture 9 : Loops in various applications Part 5 : Arithmetic on very large numbers | Download |
38 | Lecture 10 : Functions Part 1 : Basics | Download |
39 | Lecture 10 : Functions Part 2 : Examples | Download |
40 | Lecture 10 : Functions Part 3 : Reference parameters | Download |
41 | Lecture 10 : Functions Part 4 : Pointers | Download |
42 | Lecture 10 : Functions Part 5 : Graphics Objects and Lecture conclusion | Download |
43 | Lecture 11 : Recursion Part 1 : Introduction | Download |
44 | Lecture 11 : Recursion Part 2 : Recursive objects, Tree drawing | Download |
45 | Lecture 11 : Recursion Part 3 : How to think about recursion | Download |
46 | Lecture 12 : Virahanka Numbers Part 1 : Introduction | Download |
47 | Lecture 12 : Virahanka Numbers Part 2 : Recursive Program | Download |
48 | Lecture 12 : Virahanka Numbers Part 3 : Iterative Program and Conclusion | Download |
49 | Lecture 13 : Program Organization and Functions Part 1 : Introduction | Download |
50 | Lecture 13 : Program Organization and Functions Part 2 : Splitting into files | Download |
51 | Lecture 13 : Program Organization and Functions Part 3 : Namespaces | Download |
52 | Lecture 13 : Program Organization and Functions Part 4 : How to use C++ without simplecpp | Download |
53 | Lecture 14 : Advanced Features of Functions Part 1 : Introduction and passing one function to another | Download |
54 | Lecture 14 : Advanced Features of Functions Part 2 : Lambda expressions | Download |
55 | Lecture 14 : Advanced Features of Functions Part 3 : Default values to parameters | Download |
56 | Lecture 14 : Advanced Features of Functions Part 4 : Function overloading and lecture conclusion | Download |
57 | Lecture 15 : Array Part-1 : Part 1 : Introduction | Download |
58 | Lecture 15 : Array Part-1 : Part 2 : Marks averaging problem | Download |
59 | Lecture 15 : Array Part-1 : Part 3 : Histogram computation | Download |
60 | Lecture 15 : Array Part-1 : Part 4 : Marks display variation | Download |
61 | Lecture 15 : Array Part-1 : Part 5 : Polynomial multiplication | Download |
62 | Lecture 15 : Array Part-1 : Part 6 : Queues in dispatching taxis | Download |
63 | Lecture 15 : Array Part-1 : Part 7 : More efficient Queues in dispatching taxis | Download |
64 | Lecture 15 : Array Part-1 : Part 8 : Disk intersection | Download |
65 | Lecture 15 : Array Part-1 : Part 9 : Arrays of graphical objects and conclusion | Download |
66 | Lecture 16 : Array Part-2 : Part 1 : Introduction | Download |
67 | Lecture 16 : Array Part-2 : Part 2 : Interpretation of aname[index] | Download |
68 | Lecture 16 : Array Part-2 : Part 3 : Arrays and function calls | Download |
69 | Lecture 16 : Array Part-2 : Part 4 : A function to sort an array | Download |
70 | Lecture 17 : More on Arrays : Part 1 : Textual data | Download |
71 | Lecture 17 : More on Arrays : Part 2 : Functions on character strings | Download |
72 | Lecture 17 : More on Arrays : Part 3 : Two dimensional arrays | Download |
73 | Lecture 17 : More on Arrays : Part 4 : Command Line Arguments | Download |
74 | Lecture 18 : Arrays and recursion : Part 1 : Binary Search Introduction | Download |
75 | Lecture 18 : Arrays and recursion : Part 2 : Binary search analysis | Download |
76 | Lecture 18 : Arrays and recursion : Part 3 : Mergesort overview | Download |
77 | Lecture 18 : Arrays and recursion : Part 4 : Merge function | Download |
78 | Lecture 18 : Arrays and recursion : Part 5 : Mergesort conclusion | Download |
79 | Lecture 19 : Structures : Part 1 : Definition and instantiation | Download |
80 | Lecture 19 : Structures : Part 2 : Operations on structures | Download |
81 | Lecture 19 : Structures : Part 3 : An example program | Download |
82 | Lecture 19 : Structures : Part 4 : Pointers and lecture conclusion | Download |
83 | Lecture 20 : Structures Part 2 : Part 1 : Introduction to Member functions | Download |
84 | Lecture 20 : Structures Part 2 : Part 2 : Vectors from Physics | Download |
85 | Lecture 20 : Structures Part 2 : Part 3 : Taxi dispatch | Download |
86 | Lecture 21 : Classes : Part 1 : Introduction | Download |
87 | Lecture 21 : Classes : Part 2 : Constructors | Download |
88 | Lecture 21 : Classes : Part 3 : Operator overloading | Download |
89 | Lecture 21 : Classes : Part 4 : Access control | Download |
90 | Lecture 21 : Classes : Part 5 : Classes for graphics and input output | Download |
91 | Lecture 21 : Classes : Part 6 : General remarks | Download |
92 | Lecture 22 : Representing variable length entities: Part 1 : Introduction | Download |
93 | Lecture 22 : Representing variable length entities: Part 2 : Heap memory basics | Download |
94 | Lecture 22 : Representing variable length entities: Part 3 : Pitfalls of using heap memory | Download |
95 | Lecture 22 : Representing variable length entities: Part 4 : Automating memory management | Download |
96 | Lecture 22 : Representing variable length entities: Part 5 : Implementing a class with automated memory management 1 | Download |
97 | Lecture 22 : Representing variable length entities: Part 6 : Implementing a class with automated memory management 2 | Download |
98 | Lecture 22 : Representing variable length entities: Part 7 : Using the implemented class and conclusion | Download |
99 | Lecture 23 : The Standard Library: Part 1 : Class string | Download |
100 | Lecture 23 : The Standard Library: Part 2 : Class vector | Download |
101 | Lecture 23 : The Standard Library: Part 3 : Classes map and unordered_map | Download |
102 | Lecture 23 : The Standard Library: Part 4 : Iterators | Download |
103 | Lecture 23 : The Standard Library: Part 5 : Iterators | Download |
104 | Lecture 24 : Data structure based programming : Part 1 : Introduction | Download |
105 | Lecture 24 : Data structure based programming : Part 2 : Set and pair classes | Download |
106 | Lecture 24 : Data structure based programming : Part 3 : Implementation of standard library data structures | Download |
107 | Lecture 24 : Data structure based programming : Part 4 : Composing data structures | Download |
108 | Lecture 24 : Data structure based programming : Part 5 : typedef and lecture conclusion | Download |
109 | Lecture 25 : Medium size programs : Part 1 : The new marks display program | Download |
110 | Lecture 25 : Medium size programs : Part 2 : Manual algorithm for new marks display | Download |
111 | Lecture 25 : Medium size programs : Part 3 : RSMTAB and rest of the program | Download |
112 | Lecture 25 : Medium size programs : Part 4 : Sophisticated solutions to marks display | Download |
113 | Lecture 26 : A graphical editor and solver for circuits : Part 1 : Outline | Download |
114 | Lecture 26 : A graphical editor and solver for circuits : Part 2 : Main program and organization | Download |
115 | Lecture 26 : A graphical editor and solver for circuits : Part 3 : Mathematical representation of the circuit | Download |
116 | Lecture 26 : A graphical editor and solver for circuits Part 4 : Extensions and concluding remarks | Download |
117 | Lecture 27 : Cosmological simulation : Part 1 : Introduction and First order Euler method | Download |
118 | Lecture 27 : Cosmological simulation : Part 2 : Second order Euler method | Download |
119 | Lecture 27 : Cosmological simulation : Part 3 : The program | Download |
120 | Lecture 27 : Cosmological simulation : Part 4 : Concluding remarks | Download |
Sl.No | Chapter Name | English |
---|---|---|
1 | Lecture 1 Part 1: Introduction | Download Verified |
2 | Lecture 1 Part 2 : Introduction | Download Verified |
3 | Lecture 1 Part 3 : Introduction | Download Verified |
4 | Lecture 1 Part 4 : Introduction | Download Verified |
5 | Lecture 2 Part 1 : Problem Solving using Computer | Download Verified |
6 | Lecture 2 Part 2 : Problem Solving using Computer | Download Verified |
7 | Lecture 2 Part 3 : Problem Solving using Computer | Download Verified |
8 | Lecture 2 Part 4 : Problem Solving using Computer | Download Verified |
9 | Lecture 2 Part 5 : Problem Solving using Computer | Download Verified |
10 | Lecture 3 Part 1 : Basic Elements of Program | Download Verified |
11 | Lecture 3 Part 2 : Basic Elements of Program | Download Verified |
12 | Lecture 3 Part 3 : Basic Elements of Program | Download Verified |
13 | Lecture 3 Part 4 : Basic Elements of Program | Download Verified |
14 | Lecture 4 Part 1 : Program Design | Download Verified |
15 | Lecture 4 Part 2 : Program Design | Download Verified |
16 | Lecture 4 Part 3 : Program Design | Download Verified |
17 | Lecture 5 : Simple cpp Graphics | Download Verified |
18 | Lecture 6 Part 1 : Conditional Execution | Download Verified |
19 | Lecture 6 Part 2 : Most general form of if | Download Verified |
20 | Lecture 6 Part 3 : More general form of conditions | Download Verified |
21 | Lecture 6 Part 4 : A somewhat large program example | Download Verified |
22 | Lecture 6 Part 5 : Switch statement and logical data | Download Verified |
23 | Lecture 7 Part 1 : Loops | Download Verified |
24 | Lecture 7 Part 2 : Mark averaging | Download Verified |
25 | Lecture 7 Part 3 : The break and continue statements | Download Verified |
26 | Lecture 7 Part 4 : The for statement | Download Verified |
27 | Lecture 7 Part 5 : Euclid's algorithm for GCD | Download Verified |
28 | Lecture 7 Part 6 : Correctness proof for GCD | Download Verified |
29 | Lecture 8 : Computing Mathematical Functions Part 1 : Taylor series | Download Verified |
30 | Lecture 8 : Computing Mathematical Functions Part 2 : Numerical integration | Download Verified |
31 | Lecture 8 : Computing Mathematical Functions Part 3 : Bisection Method | Download Verified |
32 | Lecture 8 : Computing Mathematical Functions Part 4 : Newton Raphson Method | Download Verified |
33 | Lecture 9 : Loops in various applications Part 1 : Loops in various applications brute force algorithms | Download Verified |
34 | Lecture 9 : Loops in various applications Part 2 : Finding Pythagorean Triples | Download Verified |
35 | Lecture 9 : Loops in various applications Part 3 : Modelling a system: bargaining | Download Verified |
36 | Lecture 9 : Loops in various applications Part 4 : Simulating a water tank | Download Verified |
37 | Lecture 9 : Loops in various applications Part 5 : Arithmetic on very large numbers | Download Verified |
38 | Lecture 10 : Functions Part 1 : Basics | Download Verified |
39 | Lecture 10 : Functions Part 2 : Examples | Download Verified |
40 | Lecture 10 : Functions Part 3 : Reference parameters | Download Verified |
41 | Lecture 10 : Functions Part 4 : Pointers | Download Verified |
42 | Lecture 10 : Functions Part 5 : Graphics Objects and Lecture conclusion | Download Verified |
43 | Lecture 11 : Recursion Part 1 : Introduction | Download Verified |
44 | Lecture 11 : Recursion Part 2 : Recursive objects, Tree drawing | Download Verified |
45 | Lecture 11 : Recursion Part 3 : How to think about recursion | Download Verified |
46 | Lecture 12 : Virahanka Numbers Part 1 : Introduction | Download Verified |
47 | Lecture 12 : Virahanka Numbers Part 2 : Recursive Program | Download Verified |
48 | Lecture 12 : Virahanka Numbers Part 3 : Iterative Program and Conclusion | Download Verified |
49 | Lecture 13 : Program Organization and Functions Part 1 : Introduction | Download Verified |
50 | Lecture 13 : Program Organization and Functions Part 2 : Splitting into files | Download Verified |
51 | Lecture 13 : Program Organization and Functions Part 3 : Namespaces | Download Verified |
52 | Lecture 13 : Program Organization and Functions Part 4 : How to use C++ without simplecpp | Download Verified |
53 | Lecture 14 : Advanced Features of Functions Part 1 : Introduction and passing one function to another | Download Verified |
54 | Lecture 14 : Advanced Features of Functions Part 2 : Lambda expressions | Download Verified |
55 | Lecture 14 : Advanced Features of Functions Part 3 : Default values to parameters | Download Verified |
56 | Lecture 14 : Advanced Features of Functions Part 4 : Function overloading and lecture conclusion | Download Verified |
57 | Lecture 15 : Array Part-1 : Part 1 : Introduction | Download Verified |
58 | Lecture 15 : Array Part-1 : Part 2 : Marks averaging problem | Download Verified |
59 | Lecture 15 : Array Part-1 : Part 3 : Histogram computation | Download Verified |
60 | Lecture 15 : Array Part-1 : Part 4 : Marks display variation | Download Verified |
61 | Lecture 15 : Array Part-1 : Part 5 : Polynomial multiplication | Download Verified |
62 | Lecture 15 : Array Part-1 : Part 6 : Queues in dispatching taxis | Download Verified |
63 | Lecture 15 : Array Part-1 : Part 7 : More efficient Queues in dispatching taxis | Download Verified |
64 | Lecture 15 : Array Part-1 : Part 8 : Disk intersection | Download Verified |
65 | Lecture 15 : Array Part-1 : Part 9 : Arrays of graphical objects and conclusion | Download Verified |
66 | Lecture 16 : Array Part-2 : Part 1 : Introduction | Download Verified |
67 | Lecture 16 : Array Part-2 : Part 2 : Interpretation of aname[index] | Download Verified |
68 | Lecture 16 : Array Part-2 : Part 3 : Arrays and function calls | Download Verified |
69 | Lecture 16 : Array Part-2 : Part 4 : A function to sort an array | Download Verified |
70 | Lecture 17 : More on Arrays : Part 1 : Textual data | Download Verified |
71 | Lecture 17 : More on Arrays : Part 2 : Functions on character strings | Download Verified |
72 | Lecture 17 : More on Arrays : Part 3 : Two dimensional arrays | Download Verified |
73 | Lecture 17 : More on Arrays : Part 4 : Command Line Arguments | Download Verified |
74 | Lecture 18 : Arrays and recursion : Part 1 : Binary Search Introduction | Download Verified |
75 | Lecture 18 : Arrays and recursion : Part 2 : Binary search analysis | Download Verified |
76 | Lecture 18 : Arrays and recursion : Part 3 : Mergesort overview | Download Verified |
77 | Lecture 18 : Arrays and recursion : Part 4 : Merge function | Download Verified |
78 | Lecture 18 : Arrays and recursion : Part 5 : Mergesort conclusion | Download Verified |
79 | Lecture 19 : Structures : Part 1 : Definition and instantiation | Download Verified |
80 | Lecture 19 : Structures : Part 2 : Operations on structures | Download Verified |
81 | Lecture 19 : Structures : Part 3 : An example program | Download Verified |
82 | Lecture 19 : Structures : Part 4 : Pointers and lecture conclusion | Download Verified |
83 | Lecture 20 : Structures Part 2 : Part 1 : Introduction to Member functions | Download Verified |
84 | Lecture 20 : Structures Part 2 : Part 2 : Vectors from Physics | Download Verified |
85 | Lecture 20 : Structures Part 2 : Part 3 : Taxi dispatch | Download Verified |
86 | Lecture 21 : Classes : Part 1 : Introduction | Download Verified |
87 | Lecture 21 : Classes : Part 2 : Constructors | Download Verified |
88 | Lecture 21 : Classes : Part 3 : Operator overloading | Download Verified |
89 | Lecture 21 : Classes : Part 4 : Access control | Download Verified |
90 | Lecture 21 : Classes : Part 5 : Classes for graphics and input output | Download Verified |
91 | Lecture 21 : Classes : Part 6 : General remarks | Download Verified |
92 | Lecture 22 : Representing variable length entities: Part 1 : Introduction | Download Verified |
93 | Lecture 22 : Representing variable length entities: Part 2 : Heap memory basics | Download Verified |
94 | Lecture 22 : Representing variable length entities: Part 3 : Pitfalls of using heap memory | Download Verified |
95 | Lecture 22 : Representing variable length entities: Part 4 : Automating memory management | Download Verified |
96 | Lecture 22 : Representing variable length entities: Part 5 : Implementing a class with automated memory management 1 | Download Verified |
97 | Lecture 22 : Representing variable length entities: Part 6 : Implementing a class with automated memory management 2 | Download Verified |
98 | Lecture 22 : Representing variable length entities: Part 7 : Using the implemented class and conclusion | Download Verified |
99 | Lecture 23 : The Standard Library: Part 1 : Class string | Download Verified |
100 | Lecture 23 : The Standard Library: Part 2 : Class vector | Download Verified |
101 | Lecture 23 : The Standard Library: Part 3 : Classes map and unordered_map | Download Verified |
102 | Lecture 23 : The Standard Library: Part 4 : Iterators | Download Verified |
103 | Lecture 23 : The Standard Library: Part 5 : Iterators | Download Verified |
104 | Lecture 24 : Data structure based programming : Part 1 : Introduction | Download Verified |
105 | Lecture 24 : Data structure based programming : Part 2 : Set and pair classes | Download Verified |
106 | Lecture 24 : Data structure based programming : Part 3 : Implementation of standard library data structures | Download Verified |
107 | Lecture 24 : Data structure based programming : Part 4 : Composing data structures | Download Verified |
108 | Lecture 24 : Data structure based programming : Part 5 : typedef and lecture conclusion | Download Verified |
109 | Lecture 25 : Medium size programs : Part 1 : The new marks display program | Download Verified |
110 | Lecture 25 : Medium size programs : Part 2 : Manual algorithm for new marks display | Download Verified |
111 | Lecture 25 : Medium size programs : Part 3 : RSMTAB and rest of the program | Download Verified |
112 | Lecture 25 : Medium size programs : Part 4 : Sophisticated solutions to marks display | Download Verified |
113 | Lecture 26 : A graphical editor and solver for circuits : Part 1 : Outline | Download Verified |
114 | Lecture 26 : A graphical editor and solver for circuits : Part 2 : Main program and organization | Download Verified |
115 | Lecture 26 : A graphical editor and solver for circuits : Part 3 : Mathematical representation of the circuit | Download Verified |
116 | Lecture 26 : A graphical editor and solver for circuits Part 4 : Extensions and concluding remarks | Download Verified |
117 | Lecture 27 : Cosmological simulation : Part 1 : Introduction and First order Euler method | Download Verified |
118 | Lecture 27 : Cosmological simulation : Part 2 : Second order Euler method | Download Verified |
119 | Lecture 27 : Cosmological simulation : Part 3 : The program | Download Verified |
120 | Lecture 27 : Cosmological simulation : Part 4 : Concluding remarks | Download Verified |
Sl.No | Language | Book link |
---|---|---|
1 | English | Download |
2 | Bengali | Not Available |
3 | Gujarati | Not Available |
4 | Hindi | Not Available |
5 | Kannada | Not Available |
6 | Malayalam | Not Available |
7 | Marathi | Not Available |
8 | Tamil | Not Available |
9 | Telugu | Not Available |