COMPETITIVE CODING with C and DS

(No prior knowledge required)

COURSE NAME: COMPETITIVE CODING with C and DS

What background knowledge is necessary?
None! Whether you are completely new to problem solving (Coding) or have some exposure, this
course is the right program for you. We start from scratch.
Course Overview
Be it product-based companies, leading financial institutions, leading start-ups or service-based
companies (like Accenture, TCS, Infosys, Cognizant, etc), this program is here to make you land the
job you want!
Who is this course for?
The programme will help those who want to up-skill their coding experience and want to groom
themselves to place in Top IT companies. Best suitable for 2nd year and 3rd year B.Tech students.
Course USPs
 Module-wise material
 Topic wise MCQs discussion
 Company specific problem discussion
 Topic wise problem discussion in Competitive Programming module
 Nearly 200 problem discussion
 Assistance to collect badges from different Competitive Programming Platforms.
 Special focus on the topics like Recursion, STL, Counting Problem, String, Trees, Graph
and Dynamic Programming
 Seasoned Faculty
 Discussion on Company Specific Hiring Process (Test Patterns and Interview Experiences)
What You Will Learn?
 Module-1 : Programming in C (35 hrs)
 Module-2 : Data Structure (40 hrs)
 Module-3 : Competitive Programming (35 hrs)
Frequently Asked Questions
1. Can I learn Programming in C from Basic?
2. Ans: Yes, you will learn Programming in C from scratch including problem solving.
3. Can I learn Data Structure from Basic?
4. Ans: Yes, you will learn Data Structure from scratch including implementations of each data
structure.
5. Is this course suitable for Non CS/IT students?
6. Ans: Yes, This course is designed in a specific order so that anyone can learn. Interest
matters.
7. What will I be able to do upon completing the course?
8. Ans: Having taken your programming and problem solving skill to the next level. You will be
confident to solve medium to high level coding problems which is highly required to crack IT
jobs and internships.
COMPETITIVE CODING with C and DS : Course Details
Course Duration 110 hrs

Course Fee 7,500

Mode of Teaching Live online class
Class Timing 7.30pm – 9.30pm
Batch Size 50-60
Educator 1.Mr. Sudhansu Dalai (M- 9777036556)
2.Mr. Dambarudhar Mohanty (M- 8249431423)

Page 1 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

Detailed Syllabus : (COMPETITIVE CODING with C and DS)

A. PROGRAMMING IN C _________________________________________________________
1. Introduction to Programming and Programming Language
 What is Programming?
 Types of software
 Evolution of Programming Language
 Translator
 Execution process of High Level language
2. Introduction to C
 History of C Language
 Features of C language
 Application of C language
 The C character set
 Constants
 Keywords
 Identifiers
 Data types
 Variables
 Defining Constants
 Basic Structure of C program (in Details)
 C IDE
 Compiling and Executing the Program
3. Input-Output in C
 Preliminaries
 Writing Output Data – The printf Function
 Entering input Data – The scanf Function
 Escape sequences
 Single Character Input – The getchar Function
 Single Character Output – The putchar Function
 First C program
 Compilation and Execution process of a C program
 Types of error
 More about printf and scanf function
 MCQs / Pseudo code
4. Operators and Expression
 Arithmetic operators
 Increment & decrement operators
 Relational operators
 Logical operators
 Assignment operators
 Conditional operator
 Bitwise operators
 Sizeof operator
 Comma operator
 Type casting
 Operators Precedence and Associativity
 Evaluation of Expressions
 Programs (10 +)
 MCQs / Pseudo code
5. Control Statements
 Conditional Control Statements
 if
 if-else

Page 2 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

 nested if-else
 if-else-if ladder
 MCQs / Pseudo code
 Programs (10 +)
 Multiple Branching Control Structure
 switch-case
 Programs (5 +)
 MCQs / Pseudo code
 Loop Control statements
 while
 do-while
 for
 Nested Loops
 MCQs / Pseudo code
 Jump Control structures
 break
 continue
 goto
 return
6. CODING PRACTICE using Control Statement (70+)
7. Array
 One Dimensional Array
 Declaration of 1D Array
 Initialization of 1D Array
 Accessing 1D Array elements
 Reading and displaying elements
 Operations on 1D array
 Sorting and Searching
 Programs on 1D Arrays (15+)
 Two Dimensional Array
 Declaration of 2D Array
 Initialization of 2D Array
 Accessing 2D Array elements
 Reading and displaying elements
 Programs on 2D Arrays (10+)
 Multi Dimensional Array
8. Function
 Functions
 Advantages of using functions
 Library functions
 User-defined functions
 Function Prototype declaration
 Function definition
 Function call
 Return statement
 Function argument
 Basic Function Designs
 Types of function
 Programs Using Functions
 Recursion
 Iteration vs Recursion
 Programs Using Recursion
 Nested functions

Page 3 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

 MCQs / Pseudo code

9. Storage Class
 Scope and Lifetime of a variable
 auto
 static
 extern
 register
 MCQs / Pseudo code
10. Pointer
 What is pointer?
 Why pointer?
 What is an address?
 Declaration of Pointer Variables
 Initialization of Pointer Variables
 Dereferencing / Redirecting Pointer Variables
 Pointer to Pointer
 Void Pointer
 Null Pointer
 Pointer Arithmetic
 Precedence of Dereferencing Operator and Increment/Decrement Operators
 Pointer Comparison
 Pointers and One-Dimensional Array
 Pointer to an Array
 Pointers and Two-Dimensional Array
 Subscripting Pointer to an Array
 Array of Pointers
 Pointer and Function
 Parameter Passing Techniques – Call by value & Call by Address
 Passing 1D Array to Function
 Passing 2D Array to Function
 Return More than one value from a function
 Function Returning Pointer
 Pointers to Functions
 Dynamic Memory Allocation
 MCQs / Pseudo code
11. String
 Character handling functions
 String Concept
 Introduction to String in C
 Declaring Strings
 Initializing Strings
 Strings in memory
 String Input Functions / Reading Strings
 String Output Functions / Writing Strings
 String Manipulation Library Functions
 Programs Using Character Arrays
 String Pointer
 Passing string to function
 Programs (10 +)
 Array of Strings (2D Character Arrays)
 Programs Using Array of Strings
 MCQs / Pseudo code
12. Structure and Union
 Structures

Page 4 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

 What is structure?
 Defining a Structure
 Structure Variable Declaration
 Initialization of Structure
 Accessing the members of a structure
 Structure elements in memory
 Programs Using Structures
 Array of Structures
 Array within structure
 Nested structures
 Structures Containing Arrays
 Array of Structures
 Pointer to Structure
 Pointers within Structures
 Passing Structures to Functions
 Self-referential structures
 Functions returning Structures
 Union
 Differences between Structures & Unions
 Enumerated Types / enum keyword
 The Type Definition / typedef keyword
 MCQs / Pseudo code
B. DATA STRUCTURE __________________________________________________________
13. Introduction to Data Structure
14. Algorithm
15. Performance Analysis
 Time complexity
 Space complexity
16. Asymptotic Notations-
 Big O
 Omega
 Theta notations
17. CODING PRACTICE on Array ,Function and Pointer (CAMPUS PLACEMENT
QUESTIONS) (20+)
18. Stacks
 Stack Operations
 push()
 pop()
 isEmpty()
 isFull()
 Stack implementation using arrays
 Applications
 String reverse
 Stack and Recursion
 Balanced Parentheses
 Expressions
19. Stack Implementation using pointer (Dynamic)
20. Expression
 Introduction to Notations
 Importance of Notations in expression evaluation
 Conversion Algorithms
 Infix to prefix
 Infix to postfix

Page 5 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

 Prefix to infix
 Prefix to postfix
 Postfix to infix
 Postfix to prefix
 Implementation of all the conversions (7+)
 MCQs/ Pseudo Code
21. Queues
 Operations on Queue – enqueue(), dequeue()
 Queue implementation using static arrays
 Applications
 Queues Implementations using pointer (dynamic)
 MCQs/ Pseudo Code
22. Circular queues
23. Double Ended queue (Deques)
24. Single linked list
 Introduction
 Construction
 Length
 Insertion
 Deletion
 Sort
 Reverse list
 Swap nodes
 Applications
25. Stack implementation using linked list
26. Queue implementation using linked list
27. Doubly linked list
28. Circular linked list
29. Binary Tree
 Terminology
 Differences between Tree and Binary Tree
 Binary Tree Representations
 Expression Trees
 Traversals
 In-order
 pre-order
 post-order
30. Binary Search Tree
 Introduction to BST
 Insertion
 Deletion
 Search
 Implementation
 Program (25 +)
 MCQs/ Pseudo Code
31. AVL Trees
 Introduction
 BST v/s AVL
 Rotations
 L-L-Rotation
 R-R-Rotation
 L-R-Rotation
 R-L-Rotation
 Insertion

Page 6 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

 Deletion
 Implementation
 Traversal
 MCQs/ Pseudo Code
32. B trees
 M-way Search Tree
 Search
 Insertion
 Deletion
33. Searching Algorithms
 Linear search
 Binary search
34. Sorting Algorithms
 Bubble sort
 Selection sort
 Insertion sort
 Heap sort
 Merge sort
 Quick sort
 Count sort
 Radix sort
 MCQs/ Pseudo Code
35. Graph
 Introduction & Terminology
 Graph Representations
 Dijkstra's Algorithm
 Kruskal's Algorithm
 Traversal
 BFS (Breadth First Search)
 DFS (Depth First Search)
 MST
 MCQs/ Pseudo Code
36. Hashing
 Hash Table representation
 Hash function-Division Method
 Collision
 Collision Resolution Techniques
 Separate Chaining
 open addressing
 linear probing
 quadratic probing
 double hashing
 Rehashing
 Programs (5+)

C. COMPETITIVE PROGRAMMING (75+ Problem)___________________________________

1. Mathematics for Competitive Programming.
2. Special pattern making problems (including Flag programs)
3. Counting problems (Story problem)
4. Array problems
5. String problems (Story problem)
6. Standard Template Library (STL)
7. Linked list problems
8. Tree problems

Page 7 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423
 COMPETITIVE CODING with C and DS
(No prior knowledge required)

9. Graph problems
10. Searching and Sorting problems
11. Backtracking
12. Dynamic Programming (Concepts with problems)
13. Segment Trees
14. Trie

Note: Live problem discussion on LeetCode and HackerRank platform.

Educator:

1. Mr. Sudhansu Dalai (M- 9777036556)

2. Mr. Dambarudhar Mohanty (M- 8249431423)

Page 8 of 8
COMPETITIVE CODING with C and DS | 9777036556 / 8249431423