Department of Training and Development

Computer Engineering and Application

Training Module: Capgemini Exceller Prep 2024 Bootcamp.

Broad Topic Weightage (%)

Programming Fundamentals (Through Pseudo Code) 30-40

DBMS and Operating System 10-15

Data Structure and Algorithm ~ 25

Cloud Fundamentals ~ 10

Computer Networks ~ 10

Detailed Syllabus:

Topics Important Tips / Practice Problems

Programming Fundamentals ▪ Here the main agenda is to test

Pseudocode | Arithmetic Operators | Conditional statements | Looping Constructs | Arrays | Recursive base applicants programming logical skills and
cases | Functions | Bitwise operators | Increment and decrement operators not their syntax skills. So don’t get
In addition, also review the following: bogged down by syntax errors
▪ Practice pseudocode with an emphasis
▪ Code snippet questions on general and language-specific (C, C++, and Java).
on data structures
▪ Object-Oriented Programming (OOP) Concepts on Encapsulation, Abstraction, Inheritance,
▪ Practice programs that involve pointer
Polymorphism, Exception Handling, etc.
arithmetic and bitwise operations in C.

Key Focus Areas (Don’t Miss)

Bitwise Operators || Conditional Statements || Looping Constructs || Recursive Base Cases

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

Database Management Systems (DBMS)

▪ Practice SQL queries to retrieve and
DBMS Concepts
manipulate data from complex
• Understanding databases databases
• DBMS architecture, and types of database models (Hierarchical, Network, Relational).
Relational Database Management System (RDBMS): ▪ Perform normalization on a given
• Fundamentals of RDBMS, entities, attributes, and relationships. database schema up to BCNF.
• ER diagrams, mapping ER diagrams to tables, understanding cardinality and participation constraints.
▪ Create indexes on tables and analyzing
SQL Basics
the performance impact.
• Introduction to SQL, writing basic SQL queries
• Data retrieval using SELECT, filtering data using WHERE, sorting using ORDER BY. ▪ Practice transaction controls in SQL
Normalization simulating concurrency issues using
• Normal Forms (1NF, 2NF, 3NF, BCNF) and their application multiple transactions.
• Reducing data redundancy and improving data integrity
Joins
• Understanding and implementing various types of joins (INNER JOIN, LEFT JOIN, RIGHT JOIN, FULL
OUTER JOIN).
• Using aliases for table names in join queries
Advanced SQL
• Subqueries, nested queries, GROUP BY, HAVING, aggregate functions, working with NULL values.
Indexing and Optimization
• Concepts of indexing, types of indexes (primary, secondary), query optimization techniques.

Key Focus Areas (Don’t Miss)

Data models | DBMS architecture and components | SQL Queries | ER Diagrams | Normal Forms | Joins | Keys | Constraints | Transactions and Concurrency
Control | Query optimization | Integrity rules

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

Operating Systems
▪ Simulate process scheduling algorithms
Introduction to Operating Systems
(e.g., Round Robin, Priority Scheduling)
▪ Types of operating systems, including Batch, Time-Sharing, Distributed, Real-Time, and Embedded
systems. ▪ Solve problems that involve detecting
▪ Architecture of operating systems, including the kernel, shell, system calls, and user interface. and resolving deadlocks using
Process management techniques like the Banker's Algorithm.
• Process lifecycle (creation, execution, termination)
▪ Simulate paging and segmentation
• Context switching and process states
schemes, implementing page
• Thread replacement algorithms
Process scheduling
• Scheduling algorithms (e.g., round-robin, priority-based, shortest job first) ▪ Analyze different file system
architectures, and design directory
• Multilevel queue scheduling
structures for specific scenarios
• Real-time scheduling
File management system
• File organization (directories, files, paths)
• File permissions (read, write, execute)
• File system types (e.g., ext4, NTFS, FAT)
Memory management
• Virtual memory (paging, segmentation)
• Memory allocation (malloc, free)

Key Focus Areas (Don’t Miss)

Process Scheduling | Deadlocks | Thread | Virtual memory management | Disk Scheduling | Multithreaded programming

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

DATA STRUCTURE AND ALGORITHM ▪ Implement a dynamic array that supports

automatic resizing.
Array and String
▪ Understanding the difference between static and dynamic arrays, memory allocation, and resizing ▪ Practice graph problems, Matrix
arrays. Programs, Linked list implementations
▪ Working with 2D and 3D arrays, accessing elements, and understanding their storage in memory. etc.
▪ Array Manipulation: Insertion, Deletion, Search
▪ String manipulation techniques; ▪ Solve problems related to finding
▪ Searching for substrings within strings, using algorithms like the Knuth-Morris-Pratt (KMP) algorithm. permutations of a string using recursion.
Recursion and Backtracking
▪ Solving classic recursive problems like factorial calculation, Fibonacci sequence, and the Tower of Hanoi ▪ Practice functions for inserting and
▪ Understanding the importance of the base case to terminate recursion, and how to structure the deleting nodes in a singly and doubly
recursive case. linked list.
▪ Exploring backtracking techniques for solving problems like the N-Queens problem, Sudoku solver, and
finding all subsets of a set. ▪ Implement Quick Sort and analyze its
Linked Lists performance on different datasets.
▪ Understanding the structure of singly linked lists and performing basic operations (insertion, deletion,
traversal). ▪ Solve the 0/1 Knapsack problem using
▪ Doubly linked lists, their advantages over singly linked lists, and implementing forward and backward dynamic programming.
traversal.
▪ Implementing circular linked lists where the last node points back to the first, and their use cases. ▪ Implement a stack-based expression
Trees evaluator (infix to postfix conversion).
▪ Structure and operations of binary trees, including Binary Search Trees (BST).
▪ Heap data structures, constructing Min-Heap and Max-Heap, and implementing heap operations. ▪ Create a priority queue and demonstrate
▪ AVL trees (self-balancing BST), and implementing insertion, deletion, and rotation operations to its use in scheduling tasks.
maintain balance.
▪ Tree traversal methods: inorder, preorder, postorder, and level-order traversals. ▪ Implement DFS and BFS for a given graph
Sorting and Searching Algorithms and analyze their time complexities.
▪ Various sorting algorithms, including Quick Sort, Merge Sort, Bubble Sort, and their time complexities.
▪ Searching algorithms like Binary Search and Linear Search.

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

▪ Dynamic programming, solving problems like the Knapsack problem, and optimizing recursive solutions ▪ Solve the shortest path problem using
using memoization. Dijkstra’s algorithm on a weighted graph.
Queues and Stacks
▪ Principles of First-In-First-Out (FIFO) in queues and Last-In-First-Out (LIFO) in stacks.
▪ Implementing queues using arrays and linked lists, including circular queues.
▪ Priority queues, their implementations using heaps, and their applications.
▪ Basic stack operations (push, pop, peek) and understanding their use in expression evaluation and
function calls.
Graphs
▪ Different ways to represent graphs: adjacency matrix and adjacency list.
▪ Graph traversal techniques like Depth-First Search (DFS) and Breadth-First Search (BFS).
▪ Graph algorithms to solve real-world problems like network flows, social graph analysis, and finding the
shortest paths using Dijkstra's and Floyd-Warshall algorithms.

Key Focus Areas (Don’t Miss)

Application of data structures (Scenario based problems) | Basic operation for data structures | Array manipulation techniques | Base case identification |
String searching algorithms | Backtracking applications | Problem-solving using recursion | Sorting and Searching | Linked lists | AVL trees | Heap operations
| Quick Sort and Merge Sort | Dynamic Programming | Priority Queues | Stack application | DFS and BFS | Shortest Path Algorithms

Cloud Fundamentals
▪ Practice designing of a cloud-based
Fundamentals of Cloud Computing
solution for a scenario requiring rapid
• Shared infrastructure scaling and shared infrastructure.
• On-demand access
• Scalable services ▪ Compare and contrast the infrastructure
and scalability of traditional vs. cloud
Client Server Architecture
data centers.
• Understanding the client-server model
• Role of clients and servers in communication
• Application of client-server architecture

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

Cloud Data Centers ▪ Study comparative analysis of a specific

• Classic data centers vs. cloud data centers service (e.g., cloud storage) across AWS,
Azure, and GCP.
• Virtualization
• Types of clouds
Cloud Service Providers: AWS, Azure, GCP
• Overview of major CSPs (AWS, Azure, Google Cloud Platform)
• Services offered by each provider
• Comparison of features and pricing
Cloud Service Platforms
▪ Exploring platform-as-a-service (PaaS) offerings
▪ Benefits of using cloud service platforms
▪ Real-world applications and use cases

Key Focus Areas (Don’t Miss)

Scalability | On-Demand Access | Cloud Service Models (IaaS, PaaS, and SaaS) and deployment model (Public, Private, Hybrid, Multi, Community) |
Fundamental services offered by AWS, Azure, and GCP.

Computer Networks
▪ Analyze network topology for a small
Basics of Networking
business using a combination of
• Understanding network topologies (e.g., star, bus, mesh)
different topologies.
• OSI model layers and their functions
• Subnetting and CIDR notation ▪ Subnet an IP network and determine the
• Network devices: switches routers, NIC cards, hubs, etc. IP ranges for each subnet.
Network Security
• Authentication methods (e.g., passwords, biometrics, multi-factor authentication) ▪ Practice simulation of a network attack
and implement IDS/IPS measures to
• Access control (permissions, roles, ACLs)
detect and prevent it.
• Intrusion detection and prevention systems (IDS/IPS)

Department of Computer Engineering & Applications, Institute of Engineering & Technology

 Department of Training and Development
Computer Engineering and Application

Encryption Standards and Algorithms ▪ Practice simulation of a secure

• Symmetric encryption (e.g., AES, DES) communication session using SSL/TLS.
• Asymmetric encryption (e.g., RSA, ECC)
▪ Practice simulation of a DoS attack in a
• Hash functions (e.g., SHA-256)
controlled environment and implement
• SSL/TLS for secure communication
mitigation strategies.
Attack Types
• Denial-of-Service (DoS) attacks ▪ Create a mock phishing email and
• Malware (viruses, worms, Trojans) analyze why it might succeed or fail.
• Social engineering (phishing, spear-phishing)
• Man-in-the-middle attacks
Firewalls
• Firewall rules and policies
• Intrusion prevention features
• Network segmentation using a firewall

Key Focus Areas (Don’t Miss)

IP Addressing | Network Protocols | Access Control (AAA) | Intrusion Detection Systems (IDS) | Wireless networks | Virtual Private Networks (VPNs) | Hash
Functions | Man-in-the-Middle (MitM) | Stateful Inspection Firewalls

Department of Computer Engineering & Applications, Institute of Engineering & Technology