-
About the Course
This Course is Only Available On Our App
Dive-in and start learning! Get offline access to all the course contents!
Capgemini Complete Study Materials
Crack your Capgemini in first attempt with LMT Study Materials-
- 📚Complete Study Notes (Concepts & Solved Example)
- 📌 500+ Practice Problems
- 📝 Formula's and tricks
- 👣 Beginner Friendly
- ⭐️ Trusted by 1000+ Students
The one-stop destination for everything you need for Capgemini Complete Preparations
So let's dive in - Enroll today, Crack the exam & get to work with your Dream CompanyNo items in this section -
-
Capgemini Detailed Syllabus
-
[Technical Test Prep] Fundamental of Database
- Introduction to DBMS Basic Concept
- Advantages and Disadvantage of DBMS
- Architecture of DBMS
- Database Administrator Manager Storage Manager
- Data Independence
- Entity Relationship Modelling with solved example
- Extended Entity Relationship Model with solved example
- Data Modelling
- Inference Rules
- Keys
- E-R To Relational Schema #1
- E-R To Relational Schema #2
- Introduction to SQL
- Data definition language
- DML ( data manipulation language )
- DRL ( Data Retrieval Language)
- Aggregate Function in SQL
- Types Of Joins & Inner Join
- Left, Right & Full Join
- SQL Queries | Solved Example – 1
- SQL Queries | Solved Example – 2
- SQL Queries | Solved Example – 3
- SQL Queries | Solved Example – 4
- SQL Queries | Solved Example – 5
- PL SQL | part 1 |
- PL SQL | part 2 |
- Query Processing And Query Optimisation [Part 1]
- Query Processing And Query Optimisation [Part 2]
- Query Processing And Query Optimisation [Part 3]
- Query Processing And Query Optimisation [Part4]
- Integrity Constraints
- Trigger
- Normalization and first normal form 1NF
- Second Normal Form 2NF example
- Third Normal Form 3NF with example
- BCNF | Boyce Cod Normal Form | with example
- Decomposition And Dependency Preservation
- Canonical Cover
- Concurrency Control
- Concurrency Control – Lock Based Protocol in DBMS Transaction
- Timestamp Based Protocol
- Deadlock Full concept in DBMS transaction management
- Shadow Paging in Database Recovery
- Log Based Database Recovery
- Shadow Copy Technique in Database recovery
- Transaction State and Acid Properties
- Transaction Schedule
- View Serializability
- Conflict Serializability
-
[Technical Test Prep] Data Structures
- 01 – Introducton [DSA Introduction]
- 02 – Types Of Data Structures [DSA Introduction]
- 03 – Operations Of Data Structures [DSA Introduction]
- 04 – Concept Of Abstract Data Type [DSA Introduction]
- 05 – Arrays – Part 1 [DSA Introduction]
- 06 – Arrays – Part 2 [DSA Introduction]
- 07 – Introduction To Stack [Stacks]
- 08 – Operations Of Stack ADT [Stacks]
- 09 – Stack Implementation Using Array Part – 1 [Stacks]
- 10 – Stack Implementation Using Array Part – 2 [Stacks]
- 12 – Operations Of Queue ADT [Queues]
- 11 – Introduction Of Queue [Queues]
- 13 – Queue Implementation Using Array Part – 1 [Queues]
- 14 – Queue Implementation Using Array Part-2 [Queues]
- 15 – Circular Queue Implementation Part – 1 [Queues]
- 16 – Circular Queue Implementation Part – 2 [Queues]
- 17 – Introduction To Linked List [Linked Lists]
- 18 – Array Vs Linked List [Linked Lists]
- 19 – Linked List Implementation Part – 1 [Linked Lists]
- 20 – Linked List Implementation Part – 2 [Linked Lists]
- 21 – Linked List Implementation Part – 3 [Linked Lists]
- 22 – Linked List Implementation Part – 4 [Linked Lists]
- 23 – Linked List Implementation Part – 5 [Linked Lists]
- 24 – Linked List Implementation Part – 6 [Linked Lists]
- 25 – Stack Implementation Using Linked List – Part 1 [Linked Lists]
- 26 – Stack Implementation Using Linked List – Part 2 [Linked Lists]
- 27 – Queue Using Linked List Part – 1 [Linked Lists]
- 28 – Queue Using Linked List Part – 2 [Linked Lists]
- 29 – Circular Queue Using Linked List [Linked Lists]
- 30 – Implementation Of Doubly Linked List – Part 1 [Linked Lists]
- 31 – Implementation Of Doubly Linked List – Part 2 [Linked Lists]
- 32 – Implementation Of Doubly Linked List – Part 3 [Linked Lists]
- 33 – Implementation Of Doubly Linked List – Part 4 [Linked Lists]
- 34 – Implementation Of Doubly Linked List – Part 5 [Linked Lists]
- Data Structures And Algorithms
- Data Structures And Algorithms Practice Problem
- Binary Tree Implementation Part 1 – Insertion & Traversing [Trees]
- Introduction to Tree Data Structure & Binary Tree [Trees]
- Binary Tree Implementation Part 2 – Traversing & Deletion [Trees]
- Binary tree Traversal [Trees]
- Tree traversal methods: Pre, post and in-order traversal [Trees]
- (Binary Search Tree) – Traverse the Tree in In-Order, Pre-Order and Post-Order [Trees]
- Height Balaced Binary Search Tree
- AVL Tree [Trees]
- AVL Tree Solved Example – #1 [Trees]
- AVL Tree Solved Example – #2 [Trees]
- B-Tree Introduction [Trees]
- B-Tree Solved Example – #1
- B-Tree Solved Example – #2 [Trees]
- Huffman Coding [Trees]
- BFS & DFS – #1 [Graphs]
- Topological Sorting [Graphs]
- Graphs Introduction [Graphs]
- BFS & DFS – #2 [Graphs]
- Topological Sorting – Solved Example [Graphs]
- Linear Search [Recursion and Storage Management]
- Recursion – Winding & Unwinding [Recursion and Storage Management]
- Binary Search [Recursion and Storage Management]
- Introduction to Buddy System [Recursion and Storage Management]
- Problems on Buddy System [Recursion and Storage Management]
- Hashing Collision [Searching & Sorting]
- Hashing concept [Searching & Sorting]
- Linear Probing – #2 [Searching & Sorting]
- Linear Probing – #1 [Searching & Sorting]
- Linear Probing With Collisions – Solved [Searching & Sorting]
- Linear + Quadratic Probing – Solved Example [Searching & Sorting]
- Searching & Sorting Introduction [Searching & Sorting]
- Selection Sorting – #2 [Searching & Sorting]
- Selection Sorting – #1 [Searching & Sorting]
- Insertion Sort – #1 [Searching & Sorting]
- Insertion Sort – #2 [Searching & Sorting]
- Merge Sort – #2 [Searching & Sorting]
- Merge Sort – #1 [Searching & Sorting]
- Merge Sort – #3 [Searching & Sorting]
- Quick Sort – #1 [Searching & Sorting]
- Quick Sort – #2 [Searching & Sorting]
- Radix Sort – #1 [Searching & Sorting]
- Radix Sort – #2 [Searching & Sorting]
- Heap Data Structure [Applications of Data Structures]
- Min & Max Heap [Applications of Data Structures]
- Infix Notation & Conversion [Applications of Data Structures]
- Prefix, Postfix Notation & Conversion [Applications of Data Structures]
- Prim’s & Kruskal’s #1 [Applications of Data Structures]
- Prim’s & Kruskal’s #2 [Applications of Data Structures]
- [Soln] Mod 4 – Recursion & Storage Management [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 5 – Searching & Sorting [MU – Dec-2024 Importance Solutions]
- [Soln] Mod 6 – Application Of Data Structures [MU – Dec-2024 Importance Solutions]
-
[Technical Test Prep] Networking and Cloud
- [Introduction To Networking] Introduction to Computer Networks
- [Introduction To Networking] Network Topologies
- [Introduction To Networking] Network Connecting Devices
- [Introduction To Networking] Connection-Oriented vs Connection-Less Communication
- [Introduction To Networking] OSI Reference Model
- [Introduction To Networking] TCP-IP Reference Model
- [Introduction To Networking] OSI vs TCP-IP Model Comparision
- [Introduction To Networking] Network Classification LAN, MAN, WAN
- [Introduction To Networking] Virtual Lan’s
- [Physical Layer] Transmission Media: Guided and Unguided [Difference]
- [Physical Layer] Twisted-Pair Cables
- [Physical Layer] Co-Axial Cable
- [Physical Layer] Fiber Optics Part [01]
- [Physical Layer] Fiber Optics Part [02]
- [Data Link Layer] Framing and it’s Methods
- [Data Link Layer] Error Detection and its Methods
- [Data Link Layer] Hamming Code
- [Data Link Layer] Cyclic Redundancy Check Part [01]
- [Data Link Layer] Cyclic Redundancy Check Part [02]
- [Data Link Layer] Parity Checking and Checksum Error Detection
- [Data Link Layer] Flow Control: Stop and Wait and Sliding Window Protocol
- [Data Link Layer] Go Back- N ARQ System
- [Data Link Layer] SDLC protocol
- [Data Link Layer] HDLC protocol
- [Data Link Layer] Carrier Sense Multiple Access-Collision Detection Procedure (CSMA-CD)
- [Network Layer] IP address vs MAC address
- [Network Layer] IPv4 Header Format
- [Network Layer] IPv4 vs IPv6
- [Network Layer] Routing Algorithms Part 01
- [Network Layer] Routing Algorithms Part 02
- [Network Layer] ARP & RARP
- [Network Layer] Leaky Bucket Algorithm
- [Network Layer] Token Bucket Algorithm
- [Transport Layer] Berkeley Sockets
- [Transport Layer] User Datagram Protocol
- [Application Layer] Domain Name Server – DNS
- [Application Layer] Simple Mail Transfer Protocol – SMTP
- [Application Layer] Hypertext Transfer Protocol – HTTP
- [Application Layer] File Transfer Protocol – FTP
-
Essay Writing Prep
-
[ Verbal ] - Reading Comprehension
-
[ Verbal ] - Sentence Completion
-
[ Verbal ] - Error Identification
-
[ Verbal ] - Synonyms And Antonyms
-
[ Verbal ] - Roots words
-
[ Verbal ] - Sentence Rearrangement
-
[ Verbal ] - Paragraph
-
[ Verbal ] - Sentence Corrections
-
[ Verbal ] - Fill in the Blanks
-
[ Verbal ] - Subject Verb Agreement
-
[ Verbal ] - Verbal Ability Extra
- Introduction to Verbal Ability + Tenses Part #1
- Tenses Part #1
- Tenses [ Notes + Solved Examples + Practice Problem ]
- Error Detection and Correction + Sentence Completion #1
- Sentence Completion Part #2
- Spotting Erorrs [ Notes + Solved Examples + Practice Problem ]
- Sentence Completion [ Notes + Solved Examples + Practice Problem ]
- Assumption in Verbal Reasoning
- Deduction in Verbal Reasoning
-
Aptitude Test Game Based
-
Coding
-
[Coding Languages Tutorials] C Programming
- C Programming Part #1
- C Programming Part #2
- C Programming Part #3
- C Programming Part #4
- C Programming Part #5
- C Programming Part #6
- C Programming Part #7
- C Programming Part #8
- C Programming Part #9
- C Programming Part #10
- C Programming Part #11
- C Programming Part #12
- C Programming Part #13
- C Programming Part #14
- C Programming Part #15
- C Programming Part #16
- C Programming Part #17
- C Programming Part #18
- C Programming Part #19
- C Programming Part #20
- C Programming Part #21
- C Programming Part #22
- C Programming Part #23
- C Programming Part #24
- C Programming Part #25
- C Programming Part #26
- C Programming Part #27
- C Programming Part #28
- C Programming Part #29
- C Programming Part #30
- C Programming [Notes]
- C Programming Practice Problem
-
[Coding Languages Tutorials] C++ Tutorials
- Introduction to C++
- Input & Output in C++
- Difference between Structure in C & C++
- Class & Objects C++
- Inspector, Mutators, Facilitators
- Contructor & Destructor
- Default Arguments & Inline Function
- Array of Objects
- Dynamic Memory Allocation
- Static Member and function
- Exception handling
- Composition
- Friend Class and function
- Function Overloading
- Operator Overloading
- Copy Constructor
- Inheritance
- Types of Inheritance
- Virtual Function
- Pure Virtual Function
- Template
- RTTI
- Casting Operators
- Dynamic Array of Object
- Notes – Object Oriented Programming in C++
- Practice Problems – Object Oriented Programming In C++
-
[Coding Languages Tutorials] Python for Beginners
- 1.1 Introduction And Installation
- 2.1 Numbers and Strings
- 2.2 Lists and Dictionaries
- 2.3 Assignment Operators
- 2.4 Development Environment
- 2.5 Visual Studio Code: [VS_Code]
- 3.1 Conditional Statement
- 3.2 User Input
- 3.3 WHILE Loop
- 3.4 FOR Loop
- 3.5 FOR Loop: (Dictionary Enumeration)
- 4.1 Functions
- 4.2 Class and Objects
- 4.3 Constructor
- 4.4 Exception Handling
- 5.1 Modules
- 5.2 Statistics Module
- 5.3 CSV Module
- 5.4 PIP
- 5.5 Jupyter Note Book
- 6.1 SQLite
- 6.2 Tkinter
- 6.3 Making [.exe] in Python
- Rock Paper Scissor Python Game
- Message Encode Decode in Python Project
- Calculator in Python
- Source Code of all 3 Projects
-
How to Crack Technical Interviews
-
Technical Interview Prep ( Notes + MCQ )
-
HR Interview Course
- Introduction
- Basics of HR Interview [ Understand the WHY ]
- Interview – 01 Tell Me About Yourself
- Interview – 02 What are your Strength and Weaknesses
- Interview – 03 Are you Planning for further Studies
- Interview Q4 – Why Should we Hire you
- Interview Q5 – Where do you see yourself in 5 years
- Interview Q6 – Why do you want to work for our Company
- Interview Q7 – What are your Salary Expectations
- Interview Q8 – Do you have any Questions
- HR Interview Questions with Sample Answer
Rock Paper Scissor Python Game
Rock Paper Scissor Python Game
Python Project Idea – The rock paper scissors is a game played between two players that have few sets of rules. We can define the rules and conditions of who wins the game based on the player’s pattern.
Prepare For Your Placements: https://lastmomenttuitions.com/courses/placement-preparation/
/ Youtube Channel: https://www.youtube.com/channel/UCGFNZxMqKLsqWERX_N2f08Q
Follow For Latest Updates, Study Tips & More Content!
