Free online training to help students crack TCS NQT (Ninja National Qualifier Test) - Ninja and Digital. This course extensively covers all the concepts required for TCS Exam with 300 practice questions and 50+ Tests.
Learn the basics of ratio and proportion concept, this video includes product of means and extremes, third proportional, fourth proportional and mean proportional. Then few shortcuts to speed up calculations and Type 1 questions based on comparing ratios.
The other models from ratios are finding unknown proportions, increment ratio questions and finally divide and distribute questions. Clear explanation followed by solved examples will make your learning super simple.
In this section, the question consists of a statement, followed by two arguments numbered I and II. You have to decide which of the arguments is a ‘strong’ argument and which is a ‘weak’ argument.
In this section a certain situation is described, and the student has to choose the most suitable reaction to the given situation. This test judges the reasoning skill of the aspirant and his or her ability to act correctly and promptly to a situation that may arise.
This is the first lecture from programming basics, covering important concepts for interviews and this lecture includes datatype range and enum datatype.
This is the first lecture from the topic coding, where you will learn to find the given number to Even or Odd using modules operator and conditional statements.
This lectures introduces the concept of averages, basics formulae to solve questions from averages. Followed by addition or removal of items from a pre-calculated average.
In Statements and Assumptions questions, given a statement took after by two/three assumptions numbered I, II and III. An assumption is something gathered or underestimated. You need to consider the statement and the accompanying presumptions and choose which of the assumptions is understood in the statement.
In this type of questions, a figure, a set of figures, an arrangement, or a matrix is given, each of which bears certain characters, be it numbers, letters or a group/combination of letters/numbers, following a certain pattern. The candidate is required to decipher this pattern and accordingly find the missing character in the figure.
A palindrome is a word, phrase, number or sequence of words that reads the same backwards as forwards. This lecture gives a detailed view on implementing palindrome program
Perfect number, a positive integer that is equal to the sum of its proper divisors. This lecture gives implementation of perfect number using c programming
A positive integer of n digits is called an Armstrong number of order n (order is number of digits) if abcd... = pow(a,n) + pow(b,n) + pow(c,n) + pow(d,n) + ....
Strong number is a special number whose sum of factorial of digits is equal to the original number. This lecture cover how to implement checking for strong number using c programming
A series of numbers in which each number ( Fibonacci number ) is the sum of the two preceding numbers. This lecture is the simplest implementation of the fibonacci series without recursion
This lecture covers four methods to implement swapping of numbers. The methods are using temp variable, call by reference - swap function, without temp variable and bit manipulation technique
Operators and Precedence is a confusing topic, so have tried our best to make as simple as possible. This lecture also covers the Dynamic memory allocation malloc and calloc
This lecture covers, if we are given a decimal number as input, then writing a c program to convert the given decimal number into equivalent binary number.
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. This lecture introduces the basic concept of linked list
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations.This is a continuation to linked list lecture.
Stacks are dynamic data structures that follow the Last In First Out (LIFO) principle. The last item to be inserted into a stack is the first one to be deleted from it.
Iteration is defined as the act or process of repeating. Recursion is the process which comes into existence when a function calls a copy of itself to work on a smaller problem.
Time complexity is simply a measure of the time it takes for a function or expression to complete its task, as well as the name of the process to measure that time.
Dynamic Programming is a method for solving a complex problem by breaking it down into a collection of simpler subproblems, solving each of those subproblems just once, and storing their solutions using a memory-based data structure (array, map,etc)
In Linear search, we search an element or value in a given array by traversing the array from the starting, till the desired element or value is found.
A sentence contains one or two blanks (usually), to be filled in using the choices. These questions test your vocabulary and knowledge of the finer distinctions among words. Root Words Doc
Good luck to all the students who are preparing for TCS NQT. The Complete Course of TARGET TCS is now out... do learn all the concepts and attempt the practice questions and topic tests.
GigaCode - It is a One day Intensive classroom program to help students crack coding interviews. In the training, students are taught with basics of c programming, then 10 most important coding logics and a live implementation of 20 programming tasks.
Everyone has dreamt of becoming great, maintaining our spirit and to reach our goals. We might have drifted due to many reasons, this video puts some effort to bring you back on track and helps you to move further with 3 simple steps.
A quick run through of how to prepare for coding for TCS NQT, where in we explained the usage of command line arguments in the program.
TCS Coding Simulation