Get Latest Exam Updates, Free Study materials and Tips

Exit Intent

Tata Consultancy Services – National Qualifier Test

How To Apply for TCS NQT ?

National Qualifier Test (NQT) is a multi-level assessment to assess the following competencies and skills to generate an associated score: Industry-specific knowledge and insights. Competence on the core cognitive processes required for entry-level jobs.
When filling out the TCS NQT Application form, make sure you don’t include any extraneous information because even a minor error might have a significant influence on the Hall Ticket.

Even if you submit all of the information required and in the correct order, the TCS System may not recognize you and you will not obtain your Hall Ticket.

Click below to start the online registration process

TCS NQT Eligibility Criteria

Criteria Requirements
Qualification Full Time Graduates From B.E /B.Tech /M.E /M.Tech
Eligible Streams from UG/PG All Engineering Streams.
Percentage Criteria 60% throughout Academics in X/XII/UG/PG
Backlog Criteria 1 Active Backlog at the time of appearing for the Exam
Gap Criteria Overall Gap in Academic Career not to exceed 1 year

TCS NQT Detailed Syllabus 2022

TCS NQT has updated its entire syllabus. They have introduced some new sections in their selection process. TCS NQT Syllabus for the 2022 batch below, go through the entire syllabus so that you don’t miss any point TCS NQT Syllabus for 2022 batch is the following given below

  • Cognitive Skills

    • Verbal Ability
    • Reasoning Ability
    • Numerical Ability
  • Programming Skills

    • Programming Logic
    • Coding

IMPORTANT NOTE:

  1. There will be no negative marking.
  2. TCS NQT is adaptive this year
  3. You will not get any extra rough paper in the exam as a calculator and Rough Paper will be available on your Desktop Screen. You are not allowed to move your eyes down while giving the examination.

Syllabus

Section No. Of Questions Allotted Time
Numerical Ability 26 Ques 40 minutes
Verbal Ability 24 Ques 30 minutes
Reasoning Ability 30 Ques 50 minutes
Programming Logic 10 MCQs 15 minutes
Hands on(Coding 1) 1 Code 15 minutes
Hands on(Coding 2) 1 Code 30 minutes
Total 180 minutes

Detailed Syllabus Topicwise

  • 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 (Rational and Irrational Number)
  • English Grammar

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

  • 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
  • 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
You will be given 2 Question with a time limit of 15 mins and 30 mins
  • Questions - 2
  • Time - 15 mins + 30 mins
  • Negative Marking - No
You can expect Questions from the following concepts -
  • Number Series Printing - Example - 1, 2, 5, 4, 25, 16, 125, 64 ...... This series is mixture of power of 2 and power of 5. You have to print it via code.
  • Strings - Example - Read a string and convert all the uppercases to $ sign and all lower cases to & sign and print the output.
  • Matrix - Finding Highest sum for a row in a given matrix
  • Pythagoras Triplets
  • LCM of 3 numbers

Right free icon  Prepare For Your Placements  Left free icon

Stay connected with us on