Combo Package For Wipro, Tech Mahindra, TCS iON NQT

Brief Syllabus / Content:

Video Courses:

Company-Specific Video Courses 

Video courses specific to  TCS Ninja – 35 hours, Wipro- 30 hours, Tech Mahindra- 3o hours is covered. All previous year questions are covered in these courses.

Complete Aptitude Video Course (50+ hours) 

55+ hours of video lectures all important chapters of Quantitative Aptitude, Logical Reasoning and Verbal Ability from basics to advanced level.

Percentage, Average, Ratio Proportion, Partnership, Ages, Clock, Time & Work, Pipes and Cisterns(Tank), Area & Volume(Mensuration), Surds & Indices, Probability, Permutation & Combination, Alligation & Mixtures, Progressions, Geometry, Simple Interest, Compound Interest, Profit Loss, Speed Distance Time, Trains, Boats, Numbers & Divisibility, HCF LCM, Calendar, Data Interpretation, Logarithm.

Verbal Analogies, Para Jumble (Sentence Re-arrangement), Error Detection/Spotting, Sentence Completion, Tenses, Cloze Test, Sentence Correction, Reading Comprehension, Subject-Verb Agreement, Sentence Correction. Usage of Prepositions, Articles, Pronouns.

Direction Sense, Family Tree, Number Series, Letter Series, Coding-Decoding, Data Sufficiency, Syllogisms, Seating Arrangements, Odd man out, Decisive Reasoning, Puzzles.

Test Series:

General Aptitude Test Series:  

This test series will consist of topic wise, difficulty wise, mix and full-length pratice aptitude tests based on quantitative aptitude, logical reasoning, verbal ability. 

Company-Specific Test Series:

This test series consists of 12 tests of  TCS, 5 Tests of Wipro and 3 Tests of Tech Mahindra.

Resume, Personal & Technical Interview Preparation:

Resume & Personal Interview Preparation Course (6 hours)

This course consists of in detailed information to create resume with appropriate content and design. It also consists of in detailed discussion on How to answer frequently asked Personal Interview questions and how to prepare those answers effectively.

Technical Interview Course for Software Companies (30 hours)

This course Includes detailed video lectures Technical Interview Questions asked during a software company technical interview. It consists of 1500+ Interview questions based on Basic Programming, C, CPP, JAVA, C#, .Net, Testing, DBMS, Software Engineering, PHP, SQL.

C Programming Video Course (25 hours)

Introduction to Programming and Problem Solving : The meaning of algorithms Flowcharts, Pseudo codes, Writing algorithms and drawing flowcharts for simple exercises, Memory concepts, History of C, C Program development environment, Types of problems, problems solving with computers

Introduction to ‘C’ Language : Importance of ‘C’ Language, Sample ‘C’ Program, Structure of ‘C’ Program, Constants, variables and data types. Operators and expressions, Managing input / output operations, Control statements.

Functions: Need for user defined functions, elements of User defined functions, defining functions, return values and their types, function calls, function declaration, methods of parameter passing, User defined and library functions.

Arrays and Strings:The meaning of an array, one dimensional and two dimensional arrays, declaration and initialization of arrays, reading , writing and manipulation of above types of arrays, multidimensional arrays. Declaring and initialing string variables, reading string from terminal, writing string to screen, arithmetic operations on characters, putting strings together, comparison of two strings, string handling functions.

Structures and Pointers: Defining a structure, declaring structure variables, accessing structure members, structure initialization, copying and comparing structure variables, operations on individual members, array of structures, structures and functions, Unions. Understanding pointers, accessing the address space of a variable, declaring and initialization pointer variables, accessing a variable through its pointer, pointer expressions, pointers and arrays, pointer and character strings.

File Management in C: Defining and opening a file, closing a file, input/output operations on files, error handling during I/O operations, random access files, command line arguments.

Programs/Codes based on all above concepts will be covered.

Data Structures & Algorithms - Placement Preparatory Course (20 Hours)

Detailed Syllabus:

Session – 1 System Life Cycle                                          

• Algorithm Specification       
  • Introduction
  • Recursive Algorithms
• Data Abstraction                  
• Performance Analysis          
• Space Complexity
• Time Complexity
• Asymptotic Notation
• Comparing Time Complexities
• Performance Measurement 

Session – 2  :ARRAYS AND STRUCTURES                          

• The Array as an Abstract Data Type
• The Polynomial Abstract Data Type
• The Sparse Matrix Abstract Data Type        
• Transposing a Matrix
• Matrix Multiplication
• The Representation of Multidimensional Arrays   
• String Abstract Data Type    
• Pattern Matching
• Structures and Unions         
• Self-Referential Structures

Session – 3 : STACKS AND QUEUES

• The Stack Abstract Data Type      
• The Queue Abstract Data Type        
• Evaluation of Expressions   
• Evaluating Postfix Expressions
• Infix to Postfix
• Multiple Stacks and Queues

Session – 4 : LINKED LISTS              

• Pointers
• Pointer Can Be Dangerous
• Using Dynamically Allocated Storage
• Singly Linked Lists
• Dynamically Linked Stacks and Queues
• Polynomials                          
• Representing Polynomials as Singly Linked Lists
• Additional List Operations
• Operations for Singly Linked Lists
• Operations for Doubly Linked Lists
• Sparse Matrices

Session – 5 : TREES

• Introduction
• Terminology
• Representation of Trees
• Binary Trees
• The Abstract Data Type
• Properties of Binary Trees
• Binary Tree Representations
• Binary Tree Traversals
• Additional Binary Tree Operations  
• Threaded Binary Trees
• Heaps
• The Heap Abstract Data Type
• Priority Queues
• Insertion into a max heap
• Deletion from a max heap
• Binary Search Trees
• Searching a Binary Search Tree
•  Inserting an Element into a Binary Search Tree
• Deleting an Element from a Binary Search Tree
• Height of a Binary Search Tree

Session – 6 : GRAPHS

• The Graph Abstract Data Type         
• Introduction
• Definitions
• Graph Representations
• Elementary Graph Operations
• Depth First Search
• Breadth First Search
• Connected Components
• Spanning Trees
• Minimum Cost Spanning Trees
• Shortest Paths and Transitive Closure
• Single Source All Destination
• All Pairs Shortest Paths

Session – 7 : SORTING

• Searching and List Verification
• Sequential Search
• Binary Search
• List Verification
• Insertion Sort                       
• Quick Sort
• Optimal Sorting Time
• Merge Sort
• Iterative Merge Sort
• Recursive Merge Sort
• Heap Sort
• Radix Sort                             
• List and Table Sorts
• External Sorts

Session – 8 : HASHING                   

• Symbol Tables
• Static Hashing
• Hash Tables
• Hashing Functions
• Linear Open Addressing
• Chaining
• Theoretical Evaluation of Overflow Techniques
• Dynamic Hashing
• Dynamic Hashing Using Directories

Session – 9 : SEARCH STRUCTURES                                   

• Optimal Binary Search Trees
• AVL Trees
• Digital Search Trees
• B-Trees
• Differential Files