C Programming and Data Structure By 10 Seconds

Note: All Basics (theory) will be handled in less time, more attention will be given on practical implementation overall.

Program Areas
Sl. No. Areas
1 Analysis of Algorithm
2 Pattern Matching
3 Bit Algorithm
4 Mathematical Algorithms
5 Randomized Algorithm
6 Dynamic Programming
7 Backtracking Algorithm
8 Greedy Algorithms
9 Sliding Window Approach
10 Strings and Arrays

C Programming:

10 Seconds Syllabus [ Delivery By 10 Seconds ]

History and Features of C
Importance of C
C Programming and Data Structure By 10 Seconds

About Procedural Language

Role of Compiler
Basic Role of Interpreter
s The Structure of a C Program
Writing C Programs
Building an Executable Version of How to deal with problems and convert it in to
a C Program program,
Debugging a C Program
Understanding of basics in detail
Data Type, Variable Memory layout
Operators
Keywo Control Statement Using of Preprocessor directives for calculating time
rds Pre-processor Directives Input and required for program.
and Output Operators
IO Reading/Writing Characters
State Formatted input/output Function
ments
The IF. ELSE Statement
IF ELSE ladder Removing TLE using different algorithm to same
Nesting of IF ELSE Statements programs
Control The Switching Statements
Statements The do-while Statement
The while statement
FOR Statements

Array: What and Why?

C One Dimensional Arrays Practical Implementation of array based problems like,
Program Arra Two Dimensional Arrays traversing arrays , insertion, delete,unique ,duplicate,
ming ys Selection problems[mathematical formula]
Multi-Dimensional Arrays
Dynamic Arrays
C Programming and Data Structure By 10 Seconds

Reading String from Terminal

Writing String to Screen String based programs without using inbuilt functions,
Working with String Handling Functions like pattern matching algorithms, and using pointer to
String Table of String char , arrays

Function Basics
Advantage of Function To solve real time problems using functions & different
Functions in Recursion parameter passing techniques.
C Variable Storage Classes
Variable arguments Function Backtracking Examples

Understanding memory allocation using storage classes

TRE elimination for efficient use of recursive

functions.

Understanding Pointers
Pointer expressions Code Snippets which appear in Interview MCQ’s
Pointer and Arrays
Point Pointers and Character String Various operations on pointers.
ers Pointers to Functions
in C Pointers and Structures Applications of Pointers & Structures

Structure padding and data alignment for effective

Defining a Structure
memory utilization.
Structures and Advantage of Structure
Unions Size of Structure
Arrays of Structures
Structures and Functions
Defining Unions
C Programming and Data Structure By 10 Seconds

Data Structures:

10 Seconds Topics Topics covered Expectations]

Pointers
Introduction Introduction to Data
Structures Structures
Arrays Cover all the basics
Types of Data Structures Primitive & Non Primitive DS quickly and discuss
Linear & Non-linear Data Structures industry oriented
questions
Various Operations on arrays
● Traversing More Concentration on
● Inserting Time Efficiency
● Deleting
By using indexing & pointers
Data Polynomials and Sparse Matrices
Strings : Operations and Pattern Matching
Structur algorithms
es Linear Search ● Searching: Hash search, Exponential
using Binary Search Search
C Bubble Sort
Searching and Selection Sort ● Sorting:
Sorting Algorithm Insertion Sort Heap Sort, Bucket Sort, Merge Sort, Quick Sort,
With time & space complexities
C Programming and Data Structure By 10 Seconds

Hashing: Hash Table organizations, Hashing

Functions, Static and Dynamic Hashing.
What is Stack? Stacks
Stack Implementation of stack.
Push and pop operations on ● Operations- Multiple stack
stack.
● Applications like conversion of infix More stable Algorithms
expression and evaluation of postfix for Same sorting
expression Techniques which
gives better time
What is Queue? Queues efficiency
Queue Implementation of Queue.
Insertion and deletion ● Operations
operations on Queue
● Types of queues – Linear queue and
circular queue, Dequeue, Priority Queue , The concentration will
Multiple queues be more on practical
use of stack, queue,
Recursion:
Factorial, GCD, Fibonacci Sequence. linked list in programs.
Single Linked List Operations of Linked list:
Linked List Double Linked List
Circular Linked List ● Traversing
● Searching
● Insertion
● Deletion
Types:
Doubly Linked lists, Circular linked lists, and
Header Linked Lists. Linked Stacks and Queues.
Applications of Linked lists – Polynomials,
Sparse matrix representation

Tree Trees and Tree Traversal ● Basics of Trees and Binary search Trees
Programs
C Programming and Data Structure By 10 Seconds

● Tree traversals: inorder, preorder, Postorder

Operations on Binary Search Tree
Graphs Graphs, Representation , Operations,
Applications

Using of Tree data

structure in Product
Based Company
Programs, and Scenario
Based Algorithms

Note1: Hacker Rank and Hacker Earth [ Competitive Exam ]like examples will be taught.

Note2: Common Mistakes made during Coding exams