Questions on C MCQ for TCS NQT

TCS NQT C MCQ Questions

This section is a new section in TCS NQT Test and majority of the questions are asked from C input output and theory. However, some questions are also asked from Data Structure topics as well.

TCS C MCQ Questions and Answers Difficulty

Difficulty : High

Topics

10

Time

20 mins

Order in the Test

4th

Negative Marking

Y

C MCQ Syllabus

TCS NQT C MCQ Previous Year Papers

Click here to view detailed Syllabus for C MCQ

TCS NQT Syllabus
  • Number of Questions - 10
    • Number of MCQ Questions - 7
    • Number of FUB Questions - 3
  • Time - 20 mins
  • Negative Marking - Yes

Each correct question gives you 1 mark for MCQ type of question and 2 marks for FUB type of questions. However there is negative marking for MCQ -0.33. While, there is no negative marking for FUB type of questions.

You can check the detailed Syllabus for C MCQ topic on this page here.

Paid Materials and Online Classes

TCS NQT C MCQ Previous Questions

TCS NQT C MCQ Previous Year Papers

TCS NQT Placement C MCQ Questions

Here you will find the previous year questions for TCS NQT C MCQ Questions -

Most Asked TCS Questions in C MCQ Sections

TCS Computer Science Papers – C Language Part 2

Interview Experience

  • Name: Venkatesh R. Reddy
  • College: Indian Institute of Technology, Chennai
  • Branch: Computer Science and Engineering
  • Type of interview: ON-campus Interview

Student Interview

I am a computer science student and wanted to join an MNC like TCS. Last year when our placement cell informed about the TCS on-campus drive in our college, I applied immediately for it. I collected materials from my seniors. I asked them about the difficulty level, and types of question asked in the interview round. They asked me to refer PrepInsta website. I found a lot of sample questions and interview experiences on the site, which helped me a lot during the entire placement process.

The eligibility criteria for the interview was:

 

  • Qualifications: Full-time graduate from B.E/B.Tech/M.Tech./M.Sc./MCA
  • Eligible Stream: Eligible Stream
  • %Criteria: 60% marks throughout academics
  • Backlogs: 1 active backlog accepted
  • Academic Gap: Not exceeding 2 years

Rounds

The TCS conducted its recruitment process in three rounds. The first round was the written round which involved an online test, followed by two more rounds:

  1. Written Test Round
  2. Technical Round
  • TCS Ninja Interview
  • TCS Digital Interview
  1. HR Round

Written Test

The first round of TCS was made up of four sections. The first one among them was the English section, followed by the quantitative aptitude, programming concepts, and coding.

English: In this round, there were questions on sentence completion. I had to fill answers using the option provided with the blanks. The time allotted for this round was 10 minutes for 15 questions.

Quantitative Aptitude: The next section was Quantitative Reasoning. These questions were simple for me to answer and had thoroughly prepared them. The time given was 30 minutes for 15 questions. The questions asked were of time & work, profit & loss, number, decimal fraction, time, speed & distance, geometry, coordinate geometry, and blood relations.

Programming Concept: The test had some questions from a programming language. The topics asked were Iteration, recursion, procedural vs. Oop, Algorithms, and Data Structures. 20 minutes were allotted for 10 questions.

Coding: In this section, only one problem statement was given, and the time allotted was 30 minutes.

Technical Interview Round

The second was divided into two interviews:

  • TCS Ninja
  • TCS digital

The TCS Ninja interview was for about 25 minutes and included questions on:

  • Properties of intrinsic semiconductor?
  • What is the concept of Oops?
  • Different types of modulation?
  • Difference between C and C++?
  • What is the highest precision Datatype?
  • Why do I want to go to an IT job?

The second interview round was TCS Digital interview. The interviewer first asked me the part of the framework I was handling. He then asked me to implement a concurrent mask and discuss the concurrency challenges.  He also asked me about the default constructor. The interview got over in 20 minutes, and I was sent to HR for the final round.

HR Round

The HR first asked me to introduce myself and then asked me some questions about:

  • My most significant accomplishment.
  • What most of the people like in me?
  • My hobbies and interest?

Finally, he asked me if I had any doubts or queries. So, I asked him about the training procedure. One week after the interview, the results were announced, and I was happy that I was selected.

TCS NQT C MCQ Questions

Previous Questions

Question 27

#include <stdio.h> Int main()

{

Int n,ch, for(n=7;n!=0;n–)

printf(“n=%d”,n–) ch=getchar(); Return 0;

}

Infinite loop

Numbers 7 to 0 in descending order

None of the other choices as there is a compilation error Numbers 7 to 1 in descending order.

Ans: Infinite loop

Question 28

Eesha works for ISRO where she is involved in a mission to intercept a comet that is likely to collide with in each with in 1 month.she is developing a c program to calculate the trajectory of the missile to be launched to intercept and destroying the approaching comet.in order to achieve highest accuracy of the missile trajectory what data type should she use for the variables in her equation??

  • Long int
  • Double
  • Float
  • Int Ans: Double

Question 29

a program reads in 500 integers in the range [0…100]representing the scores of 500 students.it then prints the frequency of each score above 50.what would be the best way for the program to store the frequencies?

  • An array of 101 numbers
  • An array of 50 numbers
  • An array of 500 numbers
  • A dynamically allocated array of 550 numbers Ans: An array of 50 numbers

Question 30

Which of the following is TRUE about binary trees?

The number of nodes on the last level is equal to the sum of the number of nodes on all other levels

A.A node may have one child

  • The total number of nodes is one less than a power of 2
  • Every node must have 2 children Ans : A node may have one child

Question 31

#include <studio . h> Long int fact (int n);

Int main ()

{

Int n;

Printf (“enter a positive integer: “); Scanf (“%d”, &n);

printf(“factorial of %d = %ld “, n, fact (n)); Return 0;

}

Long int fact (int n)

{

If (n.=1)

Return n*fact (n-1)

Else

}

Return 1;

Ans: recursion

Question 32

Not a core of os

a)multi tasking

b) memory management

C) virus protection

d) file management

Answer – C

Question 33

Which are crt options for array

A) same type

B) sequential memory allocation

c) we can change size of array at run time

D) counting items appropriate

Answer !

Question 34

Which of the following statements are true..?
1. DFS linearly grows with depth.
2. BFS always has the shortest path from start state to goal state.
3. DFS uses stack
4.BFS uses queue.

Question 35

Esha writes a prgm for factorial but she forgot to write the function fact what is the error displayed
A)file not found
B)syntax errors
c)it takes the function from standard library

Question 36

Eesha wants to incorporate a history feature .When she presses “go back” then it will be able to be vist the previous page.what data type is used ?
1. Tree
2. Queue
3. Stack
4. Array.

Comments