Syllabus
Course Overview
Projects
Schedule
Demo
FAQs
Trainer
Certificate
Syllabus
-
INTRODUCTION TO C
-
Design Methods
- Top Down Design
- Bottom Up Design
-
Programming Languages
-
Low Level language
- Machine Language
- Assembly Language
- High Level Languages
-
Low Level language
- Structure of C Program
-
Design Methods
-
Elements of C
-
C Character set
- Alphabets
- Digits
- Special Characters
- Keywords/Reserved Words
- Data Types
-
Constants
- Numeric Constants
- Character Constants
- String Constants
-
Variables
- Variable Declaration
- Variable Initialisation
-
C Character set
-
Operators And Expressions
-
Arithmetic Operators
- Unary Arithmetic Operators
- Binary Arithmetic Operators
- Integer Arithmetic
- Floating Point Arithmetic
- Relational Operators
-
Logical Operators
- AND (&&) Operator
- OR (||) Operator
- NOT (!) Operator
- Sizeof Operator
-
Arithmetic Operators
-
Control Statements
-
If else
- Nesting of If else Ladder
- Else if Ladder
-
Loops
- While Loop
- Do While loop
- For loop
- Nesting of Loops
- Infinite Loops
- Break statement
- Continue Statement
- Switch Case
-
If else
-
Functions
- Advantages of Using Functions
- Library Functions
- User defined functions
- Function Definition
- Function Call
- Return Statement
- Function Arguments
-
Types Of Functions
- Function with no Arguments and no Return type
- Function with no Arguments and Return type
- Function with Arguments and no Return type
- Function with Arguments and Return type
-
Recursion
- Advantages and Disadvantages of recursion
- Local variables In recursion
-
Arrays
-
One dimensional Arrays
- Declaration Of 1-D Array
- Accessing 1-D Array
- Initialisation of 1-D Array
- 1-D array and Functions
-
Two dimensional array
- Declaration and Accessing of 2-D Array
- Initialisation of 2-D arrays
- Introduction to Strings
-
One dimensional Arrays
-
Pointers
- About Memory Organisation
- Address Operator
- Pointer Variables
- Pointer Addresses
- Pointer arithmetic’s
- Pointer to Pointer
- Pointer And 1-D array
- Pointer and 2-d array
- Pointers and Functions
- Function returning Pointer
- Array of pointers
- Void Pointers
-
Dynamic Memory Allocation
- malloc()
- calloc()
- realloc()
- free()
-
Strings
- String constants and String Variables
-
String Library Functions
- strlen()
- strcpy()
- strcmp()
- strcat()
- String pointers
- Array of strings
-
Structures and Unions
- Defining a structure
-
Declaring Structure variables
- With structure Definition
- Using Structure Tag
- Initialisation of Structure Variables
- Accessing of Members of structures
- Storage of Structures in Memory
- Structure Bit-Fields
- Sizeof structures
- Array of Structures
- Arrays within Structures
- Pointers to Structures
- Pointers Within Structures
- Structures and functions
- Self Referential structures
-
C Preprocessor
- #define
- Macros and Macros With Arguments
- Nesting in Macros
- Problems with Macros
- Macros vs Functions
- Conditional Compilation
- Predefined Macros
- #pragma directive
-
Operation on Bits
- Bitwise AND(&&)
- Bitwise OR(|)
- Bitwise XOR(^)
- Bitwise Right Shift(>>)
- Bitwise Left Shift(<<)
- One’s Compliment
- Masking
- Bit fields
-
Storage Classes
- auto
- register
- static
- extern
- Linked list
- Introduction to single linked list
- Traversing a single linked list
- Inserting an element in SLL
- Deleting a node from SLL
- Question on rearranging an SLL
- Question on moving last node to front of list
- Printing the elements of SLL using recursion
- Recursive program to reverse an SLL
- Doubly linked list
- Circular linked list
- Problems on DLL and CLL
- Stacks and Queues
- Introduction to stacks
-
- Implementing of stacks using arrays
- Linked list implementation of stack
- Implementing of queue using arrays
- Implementing of queue using Linked list
- Implementation of queue using circular array
- Infix to postfix conversion algorithm
- Postfix evaluation algorithm
- Problems on Stacks and queues
- Trees
-
- Introduction to tree traversals
- Implementation of traversals and time and space analysis
- Double order traversal
- Triple order traversal
- Number of binary tress possible
- Recursive program to count number of leaves and non leaves
- Recursive program to find the height of tree
- Binary search Tree
- Problems on BST
- Introduction to ARM Cortex m3
- Introduction to LPC 1313
- Memory Architecture
- GPIO Handling
- Configuring General Purpose Input and Output Module
- Switching the Peripherals (on / off)
- Signaling LED’s
- Monitoring the User Keys…etc
- LED Blinking
- Analog Joystick
- Analog touch Sensor
- Analog Encoder
- Seven Segment Display
- LCD
- ADC
- Implementation of Analog to Digital Converter
- Observing LM35(Temperature)
- Analog Voltage Measurement (POT)
- Finding Analog Joystick Positions
- DA
- PWM
- Implementation of Pulse Width Modulation
- Motor Speed Control
- Light Intensity Control
- Buzzer Sound Control
- Timers
- Implementation of Timers
- We Can Implement Task Scheduler
- For Counting Events
- For Encoder Pulses
- Systic timer
- NVIC
- Interrupts
- UART
- Implementation of Universal Asynchronous Receiver and Transmitter
- See the Controller data at live time in another Screen
- Send Instructions to Machine when it is running
- Perform Simplex communication
- I2C
- Implementation of Inter Integrated Circuit
- Transmitting the Data from Master to Outside Slave
- Saving the Live Data in EEPROM
- Handling Real Time Clock
- SPI
- Implementation of Serial Peripheral Interface
- Processor to Processor Communication
- Handling DAC with SPI
- Sending data to MAX7219(4 digit SSD)
- CAN
- Elaboration of Control Area Network
- Real time data Transmission
- Data Security
- Filtering data
- Error Handling
- Cooperative task Scheduler
- Implementation of Co-operative Task Scheduler
- Periodic Execution of tasks
- Real Time Projects
- Project1 : Setting Factory Defaults
- Usage: Fix vehicles speed limit, rpm, engine Temperature etc.
- Project2 : Smart Home Automation
- Usage: You can able to Set any electronic device when to ON and When to OFF or Automatically sensing etc.
- Project1 : Setting Factory Defaults
- Interview Point of Questions
1. Operating System
- What is an operating system
- Why Linux?
- Linux Kernel Architecture
- Process State
- Process Control Block
- Context Switch
- CPU scheduler
- Dispatcher
- FIFO Scheduling Algorithm
- Round robin
- Priority Based Scheduling
- Shortest Job First
- Creating Sub process with fork
- Synchronising With the Creator process
- System commands
- The Process Table
- Orphan and Zombie Process
- What are System Calls?
- System call Interface
- Pipes
- What is Pipe?
- Parent and Child Processes
- Reading closed Pipes
- FIFO
- Accessing a FIFO
- Client/Server Using FIFO
- Need of Synchronisation
- Introduction to Synchronisation Mechanisms
- Conditions for Synchronisation Mechanisms
- Lock Variables
- TSL
- TSL Question
- Disabling Interrupts
- Turn Variable or Strict Alteration Method
- interested Variable
- Peterson Solution
- Tracing Peterson Solution
- Sleep and Wake
- Counting Semaphores
- Problems on Counting Semaphore
- Binary Semaphore or mutexes
- Introduction
- Threads Creation
- Thread Termination
- Thread Synchronization
- Mutexes
- Semaphores
- Reentrancy
- Message Queues
- msgget
- msgsnd
- msgrcv
- msgctl
- Shared Memory segment
- shmget
- shmat
- shmdt
- shmctl
- Semaphores
- Semaphore Definition
- Linux semaphore Facilities
- Using Semaphore
- Memory Hierarchy
- Virtual memory
- Fragmentation and Compaction
- Dealing with Fragmentation
- Page Table in Memory
- Memory allocation with Paging
- Sharing the processor and sharing Memory
- Swapping
- Page Tables
- Levels of page Table
- Page Table Hierarchy
- Page Tables problem
- Page Replacement
- Page Replacement Algorithms
- Virtual to Physical address translation
- Two level Translation
- Three level Translation
- What is Deadlock?
- Why Deadlock is a problem?
- Conditions for Deadlock to Occur
- How to deal with Deadlock
- Deadlock Prevention
- Deadlock Avoidance
- Deadlock Recovery
- Deadlock Handling Mechanisms
- Bankers Algorithm
- Resource allocation Graph
1. Introduction
- Why C++
- Difference Between C and C ++
- Procedural Oriented Programming Language
- Object Oriented Programming Language
2.What is C++
- Features of C++
- Data Encapsulation
- Data Abstraction
- Polymorphism
- Inheritance
3. Basic Input Output Statements in C++
- The standard output stream(cout)
- C++ program Structure
- Compiling and Executing C++ Program
- Namespaces
- New Datatypes in C++
4. Scope Resolution Operator
- Syntax of Scope resolution operator
- References
- C++ References vs Pointers
- C++ pointers vs References
5. Function Overloading
- What is function Overloading
- Default Values in parameters
- Argument passed by value and reference
- Inline functions
- What is Inline function?
- Reason for the need of Inline Function
- Difference between Inline functions and Macros
- Advantages of Inline functions
6. Class
- What is Class?
- Features of Class?
- How to Write a Class?
- Access Specifiers
- Creation of Objects
- Data Encapsulation Example
- Malloc and New
7. Friend Classes
- Friend functions
- Friend Classes
- Class Member Functions and Classes as Friends
- Friend Declarations
8. Constructors
- Types of Constructors
- Default Constructor
- Parameterized Constructor
- Copy Constructor
- Destructor
9. Operator Overloading
- Operator overloading Restrictions
- Operator overloading of Different Unary and Binary Operators
10. Inheritance
- Inheritances Between classes
- Types of Inheritance
- Single Inheritance
- Multiple Inheritance
- Multi Level Inheritance
- Hybrid Inheritance
- Hierarchical Inheritance
11. Polymorphism
- Pointers to Base class
- Abstract base classes
12. Templates
- Function Templates
- Class Templates
- Advantages of templates
13. Exception Handling
- Exceptional Behaviour
- Facing an Exception
- Catching Multiple Exceptions
- Nesting Exceptions
- Group discussions will be running throughout the course
Course Overview
Course Overview
Given the competition in Embedded systems job market, it is essential for BE & ME students to get prepared for Embedded systems job while they are in college. It saves them 6 months of valuable time they have to spend in training after passing out of college.
One year time spent on MTech project gives ample time to the student to work on complex projects inline with industry requirements. It helps student improve the resume and overall skillset, ultimately helping in getting a right job.
Projects
- Project done as part Internship learning phase:
- Weather monitoring station (IoT Category)
- Smart home – complete home automation (IoT)
- Motion Surveillance using RPi (IoT)
- Flow control sensing using Raspberry Pi.
- Mobile phone operated lock using RPi
- Projects as part of Internship application phase, student can choose one of projects
- Lock which opens based face recognition
- HDMI Picture frame with RPi for hotels and large rooms for displaying wall hanging pictures
- Smart phone using RPi – Why do we make customized smart phones ?
- Smart home – complete home automation (IoT)
- Smart garden or agriculture field (Irrigation based on weather and moisture content in soil – to reduce water consumption) and Data analysis
- Interfacing Raspberry pi with Twitter (IoT)
- Measuring the water consumption of every tap (using Infra-red controlled taps) this is a very basic need as water shortage is a big problem all over the world.
- Power control of home using Motion sensor (switch off and on lights in the whole house) Building an Oscilloscope with RPi
- Building a solar cell tracker so that solar panels are automatically adjusted to get maximum sun light
- Embedded Web Server using RPi for monitoring (home and industrial use) IoT use case GNU Radio on Raspberry Pi Simple ECG monitor using RPi and Heart data accusation and upload to cloud for analysis (IoT category)
- A Robot which can climb vertical pipes (lamp post etc) coconut trees, and carry a surveillance wireless camera with it and provide picture/video from a height and comedown when needed
Schedule
| Course | MTech project and internship |
|---|---|
| Duration | 10 months |
| Next Batch | Student can join any time as per their convenience |
| Mode of training | Classroom training & Live online training Course can also be done in hybrid mode. |
| Batch Size | 20 |
Demo
FAQs
- Course presentations for all topics
- Session notes
- Lab documents with detailed steps
- User guides
No per-requisites. Good to know C language & exposure to Digital Design concepts
- Each aspect of course is supported by lot of practical examples
- Dedicated full day lab sessions to ensure student does complete testbench development from scratch
- Yes, You will have option to view the recorded videos of course for the sessions missed
- You will have option to repeat the course any time in next 1 year
- Yes, Course fee also includes support for doubt clarification sessions even after course completion
- You have option to mail you queries
- Option to meet in person to clarify doubts
Trainer
Experienced Trainer
- 10+ years of rich experience of working in Functional Verification domain across various mobile, networking, high speed peripheral domains.
- Experience of working on functional verification of Multiple Complex SOCs, multiple Sub systems
- Experience of working on multiple complex module level projects
Certificate
Play Video
- 1-1 Dedicated Mentor Support
- 24/7 Tool Access
- Multiple mock interviews
- Industry Standard Projects
- Resume Preparation