1. Once you register for the course, you will receive a detailed call with our Mentor after which you will be given a detailed preparation plan depending on your aim, strengths & weakness.
2. Courses & Test series are assigned according to your customized preparation plan.
3. Your progress, course & task status will be monitored by the Mentor every week.
4. 100 days of course plan will be assigned to you which you can complete as per your flexibility.
5. After 100 days you can access the course and take benfit of our mentorship till you placement.
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. All the test questions will have video solutions with deatiled statistics and analysis. 100+ tests are covered in this test series.
This test series consists of minimum 3 tests of Top 15 companies viz. TCS, Wipro, Infosys, Capgemini, Cognizant, Tech Mahindra, Atos Syntel, Accenture, L&T Infotech, IBM, Zoho, Delloite, HCL, Mphasis, Mindtree. All the test questions will have video solutions with deatiled statistics and analysis. A total of 50+ tests are covered in this test series.
This test series consists of tests based on various concepts of computer science and also questions previously appread in technical tests of various companies.
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.
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.
You will face 1 Personal Interview and 1 Technical Interview which will help during your actual placement. The Mock interviews will be conducted by Industry Experts. A Virtual Mock Technical Interview by Industry Experts will help you to the core in excelling your technical interview skills before your actual Placement Interview. A Mock Technical & Personal Interview can help you understand your strong and weak technical & interpersonal areas which you can improve before your actual campus interview.
Video courses specific to Top 10 companies viz. TCS – 35 hours ,Wipro- 30 hours, Infosys- 30 hours,Capgemini- 20 hours, Cognizant- 20 hours,Mindtree-20 hours, Atos-Syntel- 20 hours, Accenture- 20 hours, L&T Infotech- 20 hours, IBM- 20 hours is covered. All previous year questions are covered in these courses.
55+ hours of video lectures all important chapters of Quantitative Aptitude, Logical Reasoning and Verbal Ability from basics to advacned 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.
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.
Overview, Features, Syntax, Data types, Variables, One Dimensional array, Two dimensional array, Arithmetic operator, Bitwise operator, Relational operator, Loop Statement , Jump statement, Classes , Objects, Methods, Method overloading, Method overriding, Constructor, Constructor overloading, Destructor, Single inheritance, Multilevel inheritance, hierarchical inheritance, Super keyword, Final keyword, Abstract class, Implementing interface, Exception types, Build in Exception, User defined Exception, Creating thread, Main thread, Multithreading, String Handling, File IO, Applet, Package, Event handling.
Programs/Codes based on all above concepts will be covered.
Basic Python: Python Introduction and Installation, Data Structure of python, numbers, strings, list, tuple, dictionary, set, functionsoperators logical expression, loops, Inbuilt library functions, copy(), pickle(), sys(), time(), Basic keywords, hands-on two basic projects
Advanced Python: Oops concept, Regular expression, Exception handling, GUI Programming, Database, Network programming, Sending email, Module and package, .py to .exe conversion Windows based application hands-on project.
System Life Cycle :Algorithm Specification, Recursive Algorithms, Data Abstraction, Performance Analysis, Space Complexity, Time Complexity, Asymptotic Notation, Comparing Time Complexities, Performance Measurement.
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
The Stack Abstract Data Type, The Queue Abstract Data Type, Evaluation of Expressions, Evaluating Postfix Expressions, Infix to Postfix, Multiple Stacks and Queues.
Linked Lists, Pointers, 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.
Trees, 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.
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
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
Hashing, Symbol Tables, Static Hashing, Hash Tables, Hashing Functions, Linear Open Addressing, Chaining, Theoretical Evaluation of Overflow Techniques, Dynamic Hashing, Dynamic Hashing Using Directories
Search Structures, Optimal Binary Search Trees, AVL Trees, Digital Search Trees, B-Trees, Differential Files
Database concepts, Architecture, Differentiate between DBMS, RDBMS, and NoSQL, Server and Client Database, RDBMS products and vendors, RDBMS Client Softwares, Database Users, Overall System Structure,
Relational Model , Structure of Relational Database, Basic Structure, Database Scheme, Keys, Query Languages
The Relational Algebra, Fundamental Operations, Formal Definition of Relational Algebra, Additional Operations, The Tuple Relational Calculus, Example Queries, Formal Definitions, Safety of Expressions, Expressive Power of Languages, The Domain Relational Calculus, Formal Definitions, Example Queries, Safety of Expressions, Expressive Power of Languages
Integrity Constraints , Domain Constraints, Referential Integrity, Referential Integrity in the E-R Model, Database Modeling using ER Model
Functional Dependencies, Basic Concepts, Closure of a Set of Functional Dependencies, Closure of Attribute Sets, Canonical Cover
Relational Database Design, Normalization Using Functional Dependencies, Desirable Properties of Decomposition, Lossless-Join Decomposition, Dependency Preservation, Repetition of Information, Boyce-Codd Normal Form
SQL Introduction, Writing Basic SQL Statements, Writing Queries Based on Conditions, Writing Queries Using Operators, Setting Query Results,
Creating and Modifying Tables , Data Types, Creating Tables, NULL Values, Primary Keys, Foreign Keys, Creating Tables, Adding and Dropping Columns, Renaming Tables, Dropping Tables
SQL Statements, Simple SELECTs, Sorting Records, The WHERE Clause and Operator Symbols, Advanced SELECTs, Aggregate Functions and Grouping, Sub queries, Joins and Unions, Conditional Processing with CASE
Grouping Data, Aggregate Function, Group By Clause, Grouping Enhancement
Subqueries & Joins, Joins, Inner & Outer Join, Subqueries, Using Subqueries in From clause
Inserting, Updating and Deleting Records, INSERT, Inserting Records, UPDATE, DELETE, Updating and Deleting Records
Indexes, Create and Drop, Types of Index
SQL – Transaction, Commit, Rollback, Savepoint, Set Transaction
Views, Creating Views, Dropping Views, Benefits of Views, Creating a View
Stored Procedures, Creating Stored Procedures, Dropping Stored Procedures, Creating a Stored Procedure, Benefits of Stored Procedures
Cursors, SQL Cursor, SQL Cursor Attributes, Controlling flow of executions, Logic Tables
Triggers, Triggers – Definition, objective and its event type, Application & database triggers, Business application scenarios for implementing triggers, Define DML triggers, Define Non – DML triggers, Triggers event type & body, Instead of triggers
Query Optimization, Understanding what is database tuning, How to lower response time, how to optimize the storage space, Index Statistics and Selectivity, how to tune the database
Introduction to Data Warehouse, Introducing Data Warehouse and Business Intelligence, understanding difference between database and data warehouse, knowledge on ETL, Reporting, and Analysis tools.
#campus placement preparation #placement preparation course #complete placement preparation #placement coding questions
Mock Interview Preparation