Programming for Problem Solving ( KCS101/KCS201) for AKTU First Year

Programming for Problem Solving ( KCS101/KCS201) for AKTU First Year

Rs.1,392.40

Please register to enroll for this course.

SKU: cid_227530 Category:

Prutor collaborated with EICT IIT Kanpur to create online and live courses.

About the course

In this course, you will learn about the components of a computer which includes Memory, processor, input, and output devices along with storage and operating system. You will also understand the concept of assembler, compiler, interpreter, loader, and linker. Then you will be introduced to algorithms and flowcharts which include representation of an algorithm, flowchart, along with the concept of pseudocode and its examples, converting algorithms to programs, and writing source code.

After that, you will learn about the basics of programming which includes the structure of a C program, how to write and execute a C program. In addition to this, you will learn about the various types of errors such as logical errors and syntax errors. You will also learn about the components of the C language, variables, data types, memory locations, and storage classes. Then you will learn about arithmetic operators and their precedence, if-else, switch-case statements, for loop, while and do-while loops, break and continue statements. You will also learn about functions, arrays, basic searching, and sorting algorithms in detail. The course will conclude with detailed coverage of pointers and file operations in C.

Learning Outcomes

After completing this course, you will be able to:

  • Develop simple algorithms for arithmetic and logical problems.
  • Translate the algorithms to programs in C language and execute them.
  • Implement conditional branching, iteration, and recursion.
  • Decompose a problem into functions and synthesize a complete program using the divide and conquer approach.
  • Use arrays, pointers, and structures to develop algorithms and programs.
  • Boost your hireability through innovative and independent learning.
  • Get a certificate on successful completion of the course.
Target Audience

The course can be taken by:

Students: Students: All students who are pursuing professional graduate/post-graduate courses related to computer science and engineering or data science.

Teachers/Faculties: All computer science and engineering teachers/faculties.

Professionals: All working professionals from the computer science / IT / Data Science domain.

Why learn Programming for Problem Solving?

Problem-solving refers to your ability to solve problems in an effective and timely manner without any impediments. Whether you are a student, a parent, a businessperson, or the president of any country, you face problems every day that needs solving. For all these things, problem-solving is really really important. Especially when it comes to programming, problem-solving is a must. If you do not develop sound problem-solving skills, you will end up messing around with a given problem, and you would not be able to obtain a solution for ages.

Course Features
  • 24X7 Access: You can view lectures at your own convenience.
  • Online lectures: 10 hours of online lectures with high-quality videos.
  • Updated Quality content: Content is latest and gets updated regularly to meet the current industry demands.
Test & Evaluation

There will be a final test containing a set of multiple-choice questions. Your evaluation will include the scores achieved in the final test.

Certification

Certification requires you to complete the final test. Your certificate will be generated online after successful completion of the course.

 

Topics to be covered

Unit:1 Introduction to Programming

    • Introduction to components of a computer system
      In this lecture, we will understand about different components of the computer and see how the computer works.
    • Processor
      In this lecture, we will understand the various computer processors used in the computer and will compare between single-core and multi-core processors.
    • I/o devices  

A brief introduction of various devices to input data into the computer and receive output.

    • Memory unit
      Introducing Internal (primary) and external (secondary) memory used in the computer.
    • Operating system
      In this lecture, we will understand the important part of the computer operating system and its type.
    • The concept of assembler, Compiler, Interpreter, Loader, and linker
      In this lecture, we will understand what happens to the assembler, compiler, interpreter, loader, and liner, and see how computers use them to convert them into different languages.
    • The idea of an algorithm: representation of an algorithm, Flowchart, Pseudocode with examples
      In this lecture, we will understand what the algorithm is and will see how the algorithm is written with the help of flowchart and pseudocode.
    • From algorithms to programs, Source code
      In this lecture, we will understand how an algorithm is changed to the source code and create an extensible code.
    • Programming Basics: Structure of C program
      In this lecture, we will understand what basic things are necessary to do programming and understand how the structure of programming is done.
    • Writing and executing the first C program
      In this lecture, we will do our first program code with the help of the C programming language and will see how some program is executed.
    • Syntax and logical errors in compilation
      In this lecture, we will understand what is the syntax and logical error that occurs during the compilation and how it is done.
    • Object code and executable code
      In this lecture, we will understand how an object code is converted into executable code.
    • Components of c language
      In this lecture, we will understand about different components of the C language.
    • Standard i/o in c
      In this lecture, we will understand about various standard input and output of C programming.
    • Fundamental data types
      In this lecture, we will understand various fundamental data types of programming that will also understand how they are used.
    • Variables and memory locations
      In this lecture, we will understand how the variables and memory locations are deployed in the C language.
    • Storage classes
      In this lecture, we will look at the storage class used in the C language and its various types.

Unit:2 Arithmetic expressions & Conditional Branching

    • Arithmetic expressions and precedence: Operators and expression using numeric and relational operators
      In this lecture, we will learn about the different operators and expressions used in programming and how to use their Numeric and Relational Operators.
    • Mixed operands
      In this lecture, we will understand the mixing exercises used in C programming.
    • Type conversion
      In this lecture, we will understand the types of type conversion used in programming and see why they are used in programming.
    • Logical operators
      In this lecture, we will understand the logical operators used in C programming.
    • Bit operations
      In this lecture, we will understand the bit operators used in C programming.
    • Assignment operator
      In this lecture, we will understand the assignment operators used in C programming.
    • Operator precedence and associativity
      In this lecture, we will understand different operators about the Presidency and Associativity.
    • Conditional Branching: Applying if and switch statements
      In this lecture, we will learn to use conditional branching in C programming and use if and switch statements.
    • Nesting if and else
      In this lecture, we will learn to use Nesting if and ales in C programming.
    • Use of break and default with a switch
      In this lecture, we will learn to use break and default settings in C programming in the switch statement.

Unit:3 Loops & Functions

    • Iteration and loops: use of while
      In this lecture, we will learn to use the intersections in C programming and learn to salute iteration through a wipe loop.
    • Do while and for loops
      In this lecture, we will learn how to use the do-while and for loop in C programming.
    • Multiple loop variables
      In this lecture, we will learn to use nesting loops and multiple loop variables in C programming.
    • Use of break and continue statements
      In this lecture, we will understand break and condition statements in C programming and see how they are used.
    • Functions: introduction
      In this lecture, we will understand the functions used in C programming.
    • Types of functions
      In this lecture, we will understand how many types of functions are in programming.
    • Functions with an array
      In this lecture, we will learn to use the functions in C programming with the array.
    • Passing parameters to functions
      In this lecture, we will learn to pass the parameters of the C programming function.
    • Call by value
      In this lecture, we will learn to pass the parameters from the Call by value Method by C programming Functions.
    • Call by reference
      In this lecture, we will learn to pass the parameters from the C by Programming Functions.
    • Recursive functions
      In this lecture, we will understand recursive functions and see how they are used.

Unit:4 Arrays & Basic Algorithms

    • Arrays: Array Without cogitation and representation
      In this lecture, we will understand different codification and their representations of Array.
    • Manipulating array elements
      In this lecture, we will learn to manipulate Array Elements.
    • Using one dimensional and multidimensional arrays
      In this lecture, we will learn to use the Forest Dimensional and Multi-Dimensional Array.
    • Character arrays and strings
      In this lecture, we will understand about Array and String Array.
    • Structure and Array of structures
      In this lecture, we will understand what the structure is and how the structure is used in the array.
    • Union
      In this lecture, we will learn to use the union in C programming.
    • Enumerated data types
      In this lecture, we will understand various enumerated data types used in C programming.
    • Passing arrays to functions
      In this lecture, we will learn how to use functions by the array in the C language.
    • Basic algorithms: Searching and basic sorting algorithms (bubble, insertion, and selection)
      In this lecture, we will understand the basic algorithm of the search and sorting, as well as the use of bubble, insertion, and selection sorting technique.
    • Finding roots of equations without a condition of an order of complexity(algorithm)
      In this lecture, we will learn to take the root of any mathematical equation.

Unit:5 Pointer & File Handling

    • Pointers: Introduction, declaration, applications
      In this lecture, we will understand the pointers and see how pointers are used in programming.
    • Introduction to dynamic memory allocation
      In this lecture, we will understand the dynamic memory location (DMA) concept and see how it is used in memory allocation.
    • Use of pointers in self-referential structures
      In this lecture, we will learn to use the panners through self-referential structures.
    • Linked list
      In this lecture, we will learn to use the linked list.
    • File handling: File I/O functions
      In this lecture, we will learn to use different input and output functions for file handling and file handling.
    • Standard C preprocessors
      In this lecture, we will understand the various preprocessor used in the C language.
    • Defining and calling macros
      In this lecture, we will learn to define and erase the macros and also see how they are used.
    • Command-line arguments
      In this lecture, we will understand command-line arguments in the C language.

AKTU Previous Year Paper

', { 'anonymize_ip': true });