CATEGORY: All courses

# Crack TCS NQT in First Attempt

Course Overview

This Test Series covers all the expected questions that can be asked in TCS NQT Exam 2021. It includes previous year’s questions with solutions as well. We guarantee you a 100% passing rate after the completion of these 25 test series.

## Quantitive Aptitude:

• #### Number System

• Number System, LCM & HCF
• Divisibility
• Numbers & Decimal Fractions
• #### Mensuration

• Geometry
• Area, Shapes & Perimeter
• #### Arithmetic Ability

• Percentages
• Allegations and Mixtures
• Ratios, Proportion
• Work and Time
• Speed Time and Distance
• Profit and Loss
• Averages
• Equations
• Ages
• Probability
• Clocks & Calendar
• Series and Progressions
• #### Elementary Statistics

• Mean, Median, Mode
• Variance
• Standard Deviation
• #### Data Interpretation

• Pie Charts
• Tabular DI
• Graphical DI
• #### Simplifications & Approximations

• Simplifications and Calculations

## Verbal Ability

#### English Grammar

• Word Completion
• Sentence Completion
• Error Identification
• Arrangement
• Formal or Informal Sentences, Sentence Joining
• Meanings

## Logical Reasoning:

• #### Identifying Word

• Word Pattern
• Letter Series
• #### Numeric Patterns

• Number Series
• #### Problem Solving

• Seating Arrangements
• Blood Relations
• Data Arrangements
• #### Figural and Factual Analysis

• Cube Folding, Paper Cuts, and Folds
• #### Decision Making

• Decision Making
• Syllogism
• Data Sufficiency
• #### Propositional Reasoning

• Statements Based
• Logical Venn Diagram Based DI
• #### Visual/Spatial Reasoning

• Visual and Spatial Reasoning

## Programming Language

• Basics of C (4 – 5 Question)
• Data Types
• Input-Output (based on C)
• Functions and Scope
• Inbuilt Libraries (based on C)
• Variables and Registers
• Command Line Programming
• Pointers
• Call by value/reference
• Iteration
• Recursion
• OOPs (1 – 2 Question)
• Procedural Vs OOPs
• Classes and Objects
• Inheritance
• Abstraction
• Encapsulation
• Virtual and Pure Virtual
• Constructor and Destructor
• Polymorphism
• Data Structure (3 Question)
• Stacks
• Queues
• Linked Lists (Singly, Doubly, Circular)
• Trees
• Binary Search Trees
• Graphs (only basics)
• Searching
• Sorting
• Hashing
• Advanced-Data Structure (Only 1 Question)
• AVL Trees
• B Trees

## Coding Questions:

• Basic Problems
• Pattern problems
• Dynamic problems
• Recursion and Iteration
• Greedy algorithms
• Array, stacks problems
• Algorithmic problems
• Command Line Arguments