TCS NINJA 2019 Exam Pattern : Place for placement preparation
TCS has released its application for TCS Ninja recruitment which is also called as TCS National Qualifier test (TCS NQT). We will strongly recommend to you please follow below TCS Ninja latest syllabus dashboard and you will get recent TCS ninja syllabus 2019-20 from below links.
| Section | No. of Questions | Duration | Question Types |
| English | 15 | 10 minutes | Questions based on Sentence Completion |
| Quantitative Aptitude | 15 | 30 minutes | Time & work |
| Profit & LossNumber, decimal fraction | |||
| Time, Speed & Distance | |||
| Geometry, coordinate geometry | |||
| Blood relations | |||
| Programming Concept | 10 | 20 minutes | Iteration, recursion, procedural vs. Oop |
| Algorithms | |||
| Data Structure | |||
| Coding | 1 | 30 minutes | C/C++ |
| Java | |||
| Perl | |||
| Python 2.7 |
Apply for: TCS Off Campus Drive 2019
TCS NQT Sample Tests:
1) Practice test 1: forms.gle/URjNebGuoaNaHyr87
2) Practice test 2: https://forms.gle/kEUPsWprhiWdG2kq5
3) Practice test 3: https://forms.gle/7fgGmt3nBAs6Yy5AA
4) Practice test 4: https://forms.gle/r71L7CzN2MHp7E338
Topics important for TCS National Qualifier Test:
Programming Logic: 10 questions 20mins.
2 sections:
standard section: 7 questions
Advanced Section: 3 questions.
2) Preprocessor directives: header files: list of header files and purpose, macros
3) datatypes: valid datatypes, keywords ,modifiers and range of datatypes 4)switch statement
5)Looping:with continue and break,output based questions
6)functions:function call,function definition, function declaraction ,void datatype, return statment,recrusion and output based quesions
8)storage classes: keyword, default value, storage location, lifetime and scope
9) command line arguments
2) Linked advantages and limitations, Single linked list:def,diagram, what is header,first node and last node contains reverse of single linked list, Double linked list:def,diagram, what is header,first node and last node contains reverse of double linked list, Circular Liked List: def,no NULL,diagram,applications, display of CLL.
3) Stack & Queue: Principle,Applications,operations,Algorithms,time complexity,infix prefix and postfix conversions
Sample Previous Questions:
Set-1:
Set-2:
Set-3:
Topics:
C Programming:
1) Variales: definition ,rules,identifing valid and invalid variables2) Preprocessor directives: header files: list of header files and purpose, macros
3) datatypes: valid datatypes, keywords ,modifiers and range of datatypes 4)switch statement
5)Looping:with continue and break,output based questions
6)functions:function call,function definition, function declaraction ,void datatype, return statment,recrusion and output based quesions
8)storage classes: keyword, default value, storage location, lifetime and scope
9) command line arguments
10)Sorting & searching: procedure algorithm time complexity
11)Pointers:output based questions 12)Dynamic Memory Allocation functions
11)Pointers:output based questions 12)Dynamic Memory Allocation functions
Data Structures:
1) Arrays advantages and limitations(drawbacks)2) Linked advantages and limitations, Single linked list:def,diagram, what is header,first node and last node contains reverse of single linked list, Double linked list:def,diagram, what is header,first node and last node contains reverse of double linked list, Circular Liked List: def,no NULL,diagram,applications, display of CLL.
3) Stack & Queue: Principle,Applications,operations,Algorithms,time complexity,infix prefix and postfix conversions
4) Tree: Given any two traversals and generate third traversal,Binary tree, full binary tree, complete binary tree binary search tree operations.
5) Graphs: DFS & BFS .Algorithms:
1) Greedy and its applications 2)Dynamic programming: 0/1 knapsack LCS LIS .Sample Previous Questions:
Set-1:
Set-2:
Set-3:
