skilldevelopment.cpe@lpu.co.in

What you'll learn

Course Description The course enhances the thinking ability of students to build logic for problem solving. The course will help beginners in programming to understand programming languages from scratch to solving data structures problems.It provides best road map from Beginner to advanced level Programming. Learning outcomes 1. The course enhances the ability to build logic (how to think)for problem solving using programming languages 2. The students will be able to make programs from scratch to advanced levels 3. Students will be able to understand basics of object oriented programming languages 4. students will be able to build programs using data structures 5. the course focuses on placement oriented problems to the students and giving insights on solving them

  • "HOW TO THINK"-Creation of Automata to build logic, Different set of examples to build logic, Applications of logic building ,Introduction to Logic in Programming, Practical Implications of Automata, Overview of Programming Languages and Their Applications, Introduction to Flowcharts and Their Role in Problem-Solving, Using Pseudocode to Plan and Structure Solutions, Writing Code: Translating Pseudocode , Algorithms: Understanding and Implementing Basic Algorithms, Basics of Programming Language: Variables, Data Types, Constants, Expressions, Statements, and Operators Control Structures: Loops (for, while, do-while) and Conditional Statements (if-else, switch-case),Problem-Solving Strategies and Techniques
  • Functions, Types of Functions, Structure of Functions, Polymorphism, Types of Polymorphism, Scope of Variable, Function Overloading.
  • Classes and Objects, Operator Overloading, Run Time Polymorphism, Inheritance, Modes of Inheritance, Types of Inheritance
  • Overview of Data Structures and Their Importance, Arrays: Definition, Declaration, Initialization, and Manipulation, Strings: Basics and Operations, Introduction to Linked Lists: Concepts and Implementation, Working with Linked Lists: Insertion, Deletion, and Traversal, Stacks: Concepts, Operations, and Applications, Queues: Implementation and Real-World Use Cases, Trees: Basics of Binary Trees and Binary Search Trees (BST),Traversing Trees: Pre-order, In-order, and Post-order Traversal, Introduction to Graphs: Concepts, Representations, and Algorithms.
  • Understanding Pointers - Basics and Applications, Dynamic Memory Allocation and Deallocation, Introduction to Searching Algorithms - Linear, Binary, and Interpolation Search, Introduction to Sorting Algorithms - Selection Sort and Bubble Sort, Multithreading Concepts.

Avatar
Nitish Kumar
Assistant Professor

Er. Nitish Kumar is an Assistant Professor at Lovely Professional University. He is skilled in Data Structures and Algorithms (DSA) and Full Stack Web Development.


Avatar
Dr. Chirag Sharma
Associate Professor

Dr. Chirag Sharma has 13 years of Working in Lovely Professional University. He is skilled in Programming languages and Full Stack Web Development.