Your roadmap · आपका रोडमैप
- 1
Admission & first meetingप्रवेश और पहली मुलाकातEnquire at your nearest NDSS centre, meet the teacher, fix the batch time and get your study material.
- 2
Part 1 of the syllabusपाठ्यक्रम भाग 1Unit-wise coaching with notes and doubt classes.
Unit 1: Problem Solving and AlgorithmsUnit 2: Flowcharts and PseudocodeUnit 3: Programming Concepts
- 3
Part 2 of the syllabusपाठ्यक्रम भाग 2Unit-wise coaching with notes and doubt classes.
Unit 4: Control StructuresUnit 5: Searching, Sorting and Complexity
- 4
Unit tests & assignmentsयूनिट टेस्टRegular tests in the university / board pattern.
- 5
Semester 1 exam (university / board)विश्वविद्यालय / बोर्ड परीक्षाPrevious papers and full revision before the exam.
- 6
Online tests & resultऑनलाइन टेस्ट और रिज़ल्टTake the tests online; your marks and result show in your student login and at the centre.
Syllabus · पाठ्यक्रम
1 subject · 5 chapters · 23 topics
01Unit 1: Problem Solving and Algorithms
4 topics+
- Steps of problem solving
- Top-down and bottom-up approach
- Definition and properties of an algorithm
- Writing algorithms for simple problems
02Unit 2: Flowcharts and Pseudocode
4 topics+
- Flowchart symbols
- Rules for drawing flowcharts
- Pseudocode conventions
- Flowcharts for sum, largest, factorial, prime
03Unit 3: Programming Concepts
5 topics+
- Generations of programming languages
- Compiler, interpreter, assembler
- Linker and loader
- Variables, constants and data types
- Operators and precedence
04Unit 4: Control Structures
5 topics+
- Sequence
- Selection - if, if-else, switch
- Iteration - while, do-while, for
- Nested loops and tracing
- Modular programming and functions
05Unit 5: Searching, Sorting and Complexity
5 topics+
- Linear and binary search
- Bubble, selection and insertion sort
- Recursion
- Time and space complexity
- Big-O notation
About this course
You will be able to
- Analyse a problem and break it into steps using a top-down approach
- Write algorithms and pseudocode with the properties of a good algorithm
- Draw flowcharts using standard symbols
- Explain programming language generations and the roles of compiler, interpreter, assembler, linker and loader
- Use sequence, selection and iteration constructs and trace their output
- Write and compare simple searching and sorting algorithms using Big-O notation
Who it is for
- BCA students of Semester 1 (UP state universities, Lucknow University pattern)
- Beginners who want a strong logic base before learning C programming
What you need
- Class 12 mathematics or basic arithmetic and logic
- No prior programming knowledge needed
Online tests & result
Practice and unit tests online; marks and result show in your student login and at the centre.
Student login →
Questions
Which syllabus does this Programming Principles and Algorithms course follow?
It follows the common UP state university BCA syllabus (University of Lucknow pattern) for BCA Semester 1. If your own university's syllabus differs, the centre follows your university's syllabus and unit order.
Which language is used in this paper?
The paper is language-independent (algorithms, flowcharts, pseudocode); examples are shown in C so students are ready for Semester 2.
Will I get practice in tracing programs?
Yes. The trainer gives dry-run (trace table) exercises for loops, searching and sorting.
