- Academic Calendar
- Syllabus
- Micro Syllabus
- Student List
- Lesson Plan
- Attendance
- Lecture Notes
- Unit - I
- What is Computational Thinking
- Flow Chart and Algorithm
- Exchanging the values of two variables
- Counting
- Factorial Computation
- Generation of Fibonacci Sequence
- Reversing the Digits of an Integer
- Unit - II
- Finding the square root of a number
- The smallest divisor of an Integer
- The greatest common divisor of two Integer
- Computing the Prime Factors of an Integer
- Generation of Pseudo-Random Numbers
- QUESTION PAPERS
- Marks
- Unit - III
- Array order reversal
- Array counting or Histogramming
- finding the maximum number in a set
- Removal of duplicates from an ordered array
- partitioning an array
- Unit - IV
- The two-way merge
- Sorting by selection
- Sorting by exchange
- Sorting by insertion
- Linear search
- Binary search
- Unit - V
- Unit - I
- What is Computational Thinking
- Flow Chart and Algorithm
- Exchanging the values of two variables
- Counting
- Factorial Computation
- Generation of Fibonacci Sequence
- Reversing the Digits of an Integer
- Unit - II
- Finding the square root of a number
- The smallest divisor of an Integer
- The greatest common divisor of two Integer
- Computing the Prime Factors of an Integer
- Generation of Pseudo-Random Numbers
- QUESTION PAPERS
- Marks
- Unit - III
- Array order reversal
- Array counting or Histogramming
- finding the maximum number in a set
- Removal of duplicates from an ordered array
- partitioning an array
- Unit - IV
- The two-way merge
- Sorting by selection
- Sorting by exchange
- Sorting by insertion
- Linear search
- Binary search
- Unit - V