DXC Technology Computer Programming MCQ Questions with Solutions 2023 PDF

DXC Computer Programming MCQ Questions with Solutions(Updated)

DXC Technology Computer Programming MCQ latest 2023 batch Questions and Solutions are given here. Some website has displayed the wrong syllabus for the Coding Exam but on PrepInsta you will find the Accurate Syllabus and Pattern.

DXC Computer Programming Test 2023

Computer Test For
 DXC
Number of Questions 12
Time Limit 15 min
Mode Conducted Online
Adaptive No

No of Questions

12

Sections Time

15mins

Is latest Materials

Yes

Negative Marking

No

Curriculum

DXC computer programming test paper with solutions

DXC Computer Programming Syllabus

DXC Computer Programming Syllabus

DXC Technology Computer Programming MCQ Questions & Answers

Here below you will get the detailed information about DXC Computer Programming MCQ curriculum:-

  • C/C++/Java Concepts
  • Computer Fundamentals
  • Operating Systems
  • Data Structures
  • DBMS

DXC  Technology Tips Regarding Computer Programming Mcq’s

1. Be in touch with coding languages like C, C++ .

2. Learn the basics of the Data Structures

3. Study OOPS concept, it is asked most of the time.

Prime

Prime Video

Complete Video Course for DXC

(For DXC)
Get Prime Video

Prime

PrepInsta Prime Mock

Topic-wise and full mocks & much more

(For DXC)
Get Prime Mock

DXC Computer Programming MCQ Questions

DXC Technology Computer Programming MCQ Questions & Answers 2023

Here below you will get similar pattern questions of previous year computer programming questions and answers.

DXC Computer Programming MCQ Test paper with Solutions

  • C/C++/Java Concepts
  • Computer Fundamentals
  • Operating Systems

DXC Computer Programming Question with Solved Papers

  • DBMS
  • Data Structures
> Start

1. 

void fun1(struct node* head)
{
  if(head == NULL)
    return;
  
  fun1(head->next);
  printf("%d  ", head->data);
}

Prints all nodes of linked lists

Prints all nodes of linked lists

49.81%

Prints all nodes of linked list in reverse order

Prints all nodes of linked list in reverse order

35.09%

Prints alternate nodes of Linked List

Prints alternate nodes of Linked List

10.28%

Prints alternate nodes in reverse order

Prints alternate nodes in reverse order

4.82%

fun1() prints the given Linked List in reverse manner.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

2. Which of the following points is/are true about Linked List data structure when it is compared with array

Arrays have better cache locality that can make them better in terms of performance.

Arrays have better cache locality that can make them better in terms of performance.

5.74%

It is easy to insert and delete elements in Linked List

It is easy to insert and delete elements in Linked List

15.02%

Random access is not allowed in a typical implementation of Linked Lists

Random access is not allowed in a typical implementation of Linked Lists

8.17%

The size of array has to be pre-decided, linked lists can change their size any time

The size of array has to be pre-decided, linked lists can change their size any time

16.29%

All of the above

All of the above

54.78%

Key Differences Between Array and Linked List
1. An array is the data structure that contains a collection of similar type data elements whereas the Linked list is considered as non-primitive data structure contains a collection of unordered linked elements known as nodes.
2. In the array the elements belong to indexes, i.e., if you want to get into the fourth element you have to write the variable name with its index or location within the square bracket.
3. In a linked list though, you have to start from the head and work your way through until you get to the fourth element.
4. Accessing an element in an array is fast, while Linked list takes linear time, so it is quite a bit slower.
5. Operations like insertion and deletion in arrays consume a lot of time. On the other hand, the performance of these operations in Linked lists is fast.
6. Arrays are of fixed size. In contrast, Linked lists are dynamic and flexible and can expand and contract its size.
7. In an array, memory is assigned during compile time while in a Linked list it is allocated during execution or runtime.
9. Elements are stored consecutively in arrays whereas it is stored randomly in Linked lists.
10. The requirement of memory is less due to actual data being stored within the index in the array. As against, there is a need for more memory in Linked Lists due to storage of additional next and previous referencing elements.
11. In addition memory utilization is inefficient in the array. Conversely, memory utilization is efficient in the linked list.

Following are the points in favor of Linked Lists.

(1) The size of the arrays is fixed: So we must know the upper limit on the number of elements in advance. Also, generally, the allocated memory is equal to the upper limit irrespective of the usage, and in practical uses, the upper limit is rarely reached.

(2) Inserting a new element in an array of elements is expensive because a room has to be created for the new elements and to create room existing elements have to be shifted.

For example, suppose we maintain a sorted list of IDs in an array id[].

id[] = [1000, 1010, 1050, 2000, 2040, …..].

And if we want to insert a new ID 1005, then to maintain the sorted order, we have to move all the elements after 1000 (excluding 1000).

Deletion is also expensive with arrays until unless some special techniques are used. For example, to delete 1010 in id[], everything after 1010 has to be moved.

So Linked list provides the following two advantages over arrays
1) Dynamic size
2) Ease of insertion/deletion

Linked lists have following drawbacks:
1) Random access is not allowed. We have to access elements sequentially starting from the first node. So we cannot do a binary search with linked lists.
2) Extra memory space for a pointer is required with each element of the list.
3) Arrays have better cache locality that can make a pretty big difference in performance.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

3. Consider the following function that takes reference to head of a Doubly Linked List as parameter. Assume that a node of doubly linked list has previous pointer as prev and next pointer as next.

void fun(struct node **head_ref)
{
    struct node *temp = NULL;
    struct node *current = *head_ref;
    while (current !=  NULL)
    {
        temp = current->prev;
        current->prev = current->next;
        current->next = temp;
        current = current->prev;
    }
    if(temp != NULL )
        *head_ref = temp->prev;
}

Assume that reference of head of following doubly linked list is passed to above function 1 <--> 2 <--> 3 <--> 4 <--> 5 <-->6. What should be the modified linked list after the function call?

2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

2 <--> 1 <--> 4 <--> 3 <--> 6 <-->5

23.98%

5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

5 <--> 4 <--> 3 <--> 2 <--> 1 <-->6.

12.89%

6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

6 <--> 5 <--> 4 <--> 3 <--> 2 <--> 1.

48.58%

6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

6 <--> 5 <--> 4 <--> 3 <--> 1 <--> 2

14.54%

The given function reverses the given doubly linked list

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

4. The worst-case running time to search for an element in a balanced in a binary search tree with n2^n elements is

O(nlogn)

O(nlogn)

30.85%

O(n2^n)

O(n2^n)

33.88%

On

On

17.73%

O(logn)

O(logn)

17.54%

Time taken to search an element is \Theta (h) where h is the height of Binary Search Tree (BST). The growth of height of a balanced BST is logerthimic in terms of number of nodes. So the worst case time to search an element would be \Theta (Log(n*2^n)) which is \Theta (Log(n) + Log(2^n)) Which is \Theta (Log(n) + n) which can be written as \Theta (n) .

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

5. Following function is supposed to calculate the maximum depth or height of a Binary tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.

int maxDepth(struct node* node)
{
   if (node==NULL)
       return 0;
   else
   {
       /* compute the depth of each subtree */
       int lDepth = maxDepth(node->left);
       int rDepth = maxDepth(node->right);
 
       /* use the larger one */
       if (lDepth > rDepth)
           return X;
       else return Y;
   }
}

X = lDepth, Y = rDepth

X = lDepth, Y = rDepth

30.16%

X = lDepth + 1, Y = rDepth + 1

X = lDepth + 1, Y = rDepth + 1

41.96%

X = lDepth - 1, Y = rDepth -1

X = lDepth - 1, Y = rDepth -1

16.94%

None of the above

None of the above

10.94%

f a tree is not empty, height of tree is MAX(Height of Left Subtree, Height of Right Subtree) + 1

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

6. Which one of the below is not divide and conquer approach?

Insertion Sort

Insertion Sort

42.06%

Merge Sort

Merge Sort

18.72%

Heap Sort

Heap Sort

15.88%

Shell sort

Shell sort

23.34%

Explanation

Among the options, only Merge sort divides the list in sub-list, sorts and then merges them together

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

7. What is the functionality of the following code?

public void function(Node node)
{
	if(size == 0)
		head = node;
	else
	{
		Node temp,cur;
		for(cur = head; (temp = cur.getNext())!=null; cur = temp);
		cur.setNext(node);
	}
	size++;
}

Inserting a node at the beginning of the list

Inserting a node at the beginning of the list

43.17%

Deleting a node at the beginning of the list

Deleting a node at the beginning of the list

11.79%

Inserting a node at the end of the list

Inserting a node at the end of the list

40.46%

Deleting a node at the end of the list

Deleting a node at the end of the list

4.58%

Explanation: The for loop traverses through the list and then inserts a new node as cur.setNext(node);

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

8. How do you count the number of elements in the circular linked list?

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head)
{
temp = temp.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head)
{
temp = temp.getNext();
length++;
}
return length;
}

33.46%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != null)
{
temp = temp.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != null)
{
temp = temp.getNext();
length++;
}
return length;
}

21%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp != null)
{
temp = head.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp != null)
{
temp = head.getNext();
length++;
}
return length;
}

30.52%

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp == null)
{
temp = head.getNext();
length++;
}
return length;
}

public int length(Node head)
{
int length = 0;
if( head == null)
return 0;
Node temp = head.getNext();
while(temp != head && temp == null)
{
temp = head.getNext();
length++;
}
return length;
}

15.01%

Explanation: If the head is null, it means that the list is empty. Otherwise, traverse the list until the head of the list is reached

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

9. What is the functionality of the following piece of code? Select the most appropriate

public void function(int data)
{
	int flag = 0;
	if( head != null)
	{
		Node temp = head.getNext();
		while((temp != head) && (!(temp.getItem() == data)))
		{
			temp = temp.getNext();
			flag = 1;
			break;
		}
	}
	if(flag)
		System.out.println("success");
	else
		System.out.println("fail");
}

Print success if a particular element is not found

Print success if a particular element is not found

34.75%

Print fail if a particular element is not found

Print fail if a particular element is not found

30.91%

Print success if a particular element is equal to 1

Print success if a particular element is equal to 1

22.82%

Print fail if the list is empty

Print fail if the list is empty

11.51%

Explanation: The function prints fail if the given element is not found. Note that this option is inclusive of option d, the list being empty is one of the cases covered.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

10. Which of the following is false about a circular linked list?

Every node has a successor

Every node has a successor

13.59%

Time complexity of inserting a new node at the head of the list is O(1)

Time complexity of inserting a new node at the head of the list is O(1)

31.71%

Time complexity for deleting the last node is O(n)

Time complexity for deleting the last node is O(n)

27.87%

We can traverse the whole circular linked list by starting from any point

We can traverse the whole circular linked list by starting from any point

26.83%

Explanation: Time complexity of inserting a new node at the head of the list is O(n) because you have to traverse through the list to find the tail node.

Good Job! Did you know? : With $8.5 billion in their kitty, Wipro is the 4th largest Indian IT company in terms of revenue.

Oops!

×

Please login to report

Interview Experience

DXC On-Campus Interview Experience

  • Name: Mahendra
  • JuljuriCollege: Amity College

Recently DXC Technology, one of the renowned IT companies visited our college for an on-campus interview.

The eligibility criteria for this drive was:

There were eligibility criteria for DXC Exam:

  1. BE/B.Tech (All Streams)
  2. MCA/MSc (Comp Science)
  3. Minimum 60% in BE/B.Tech
  4. Minimum 60% in 10th and 12th
  5. There should be no pending backlogs.

Since I fulfilled these criteria, I was eligible to participate in the interview. The selection process had three rounds:

    1. Written Test
    2. Group Discussion
    3. Technical Interview
    4. HR Interview

Round 1- Written Test

For the first round, I referred to some of the previous year papers for practice.

The pattern of the test was as follows:

  • Quantitative:

    This section included questions on HCF and LCM, Divisibility, probability speed, and distance, Algebra, equations, progression, profit and loss, ratio and percentage, averages, geometry, probability, Clocks and calendars, Geometry, Coordinate geometry, etc.

16 Questions in 16 Mins were there in the test

  • Logical reasoning: 

    This section included questions on topics: Coding, Directional Sense, seating arrangement, visual reasoning, blood relations, flowcharts, statement, and conclusion, Data Sufficiency, etc.

14 Questions in 14 Min were there in the test

  • Verbal:

    This section had questions on Contextual vocabulary, Synonyms, Antonyms, Jumbled up sentences, Prepositions, and Conjunctions, Tenses and articles, etc.

12 Questions in 15 Min  were there in the test

  • Computer programming: 

    This section had questions on Data Types, Iteration, Recursion, Decision, Trees, Graphs, Queues, Hash Tables, Heaps, Searching and Sorting, Polymorphism, Encapsulation, Complexity Theory, Searching and sorting, etc.

12 Questions in 15 Min were there in the test

  • Automata fix

    In this section, you have to find the error in the given code. There can be error like syntax error, logical error etc. So you have to fix that given code.

    7 Questions in 20 Min were there in the test

Round 2- Group Discussion

Next was the Group discussion round. All the students who cleared the test successfully were qualified for the Group discussion round.

For this round, all the participants were divided into groups, and each group was given a topic. The topics were related to everyday activities and events prevalent around society.

My group got the topic “How is the IT industry influencing the economy?”.

In this round, we were being judged for our general knowledge, confidence, convincing ability, and communication skills. This round also went well. The list was out within an hour, and I was selected for the next round as well.

Round 3- Technical Interview

This was more of a resume round where I was asked all the technical questions on the previous projects that I had done in my final term internship and the one that was mentioned in my resume. The interviewer also asked me the below-mentioned questions:

  • Explain SDLC?
  • List the different storage class specifiers in C?
  • What is the necessity & advantages of OOPS?
  • Write the programming code to swap two numbers without using the third variable?
  • What is networking?
  • What was your role in your major project?

Mainly, he was checking the details written on my resume. I answered all the questions correctly and fortunately passed this round as well.

Round 4- HR Interview or Face to Face Interview Round

It was the most comfortable and most relaxed round of all the above. It was more of a cakewalk for me. Here the interviewer asked me some personal questions like,

  • What are your future plans?
  • What are your strengths professionally?
  • Tell us about an accomplishment you are most proud of
  • Do you want to pursue higher education?

Moreover, the interviewer was testing my fundamental knowledge and communication skills. I answered all the raised questions in a polite, clear, and confident way. This helped me to clear this round as well.

A week later I got an email from the company that I got selected for the Job. Hence my interview ended on a happy note.

Thank you PrepInsta!!!!!

Analytics 2023

Stats About Computer Programming MCQ 2023

Number of Questions 12 Questions
Cut-Off 8-9 Questions
Difficulty Medium

Topic Wise Analytics

C/C++/Java Concepts 0-3 Number of Questions
Difficulty Medium
Importance Medium
Computer Fundamentals 1-5 Number of Questions
Difficulty Medium
Importance Medium
Operating System 0-3 Number of Questions
Difficulty Medium
Importance Medium
Data Structure 1-3 Number of Questions
Difficulty High
Importance High
DBMS 1-4 Number of Questions
Difficulty Medium
Importance Medium

DXC Computer Programming MCQ Detailed Information 2023:-

Here below you will get detailed information about the DXC Computer Fundamentals section. So prepare well for this section as it is most scoring section.

TOPICS NO OF QUESTIONS DIFFICULTY
C/C++/Java Concepts 0-3 Moderate
Computer Fundamentals 1-5 Medium
Operating Systems 0-3 High
Data Structures 0-3 Medium
DBMS 1-4 Medium

DXC Technology Computer Programming Paper Based FAQ”s

Ans- Basically, they are ask basic type of questions of program. For the DXC programming paper PrepInsta will help you to find out more topics and tips & trick to solve the programming paper of DXC.

Difficulty level of this round is Moderate to High.  Go through this page to understand more about DXC Computer Programming Round.

Reviews

Chetna Mehta

DXC

This is the best site you can ever find for preparation. You can find every single information related to the company or placement paper on this website. They provide the best-paid material which helps in Online test paper.

Prime

PrepInsta Prime Video

Complete Video Course for DXC

Get Prime Video(For DXC)

82% of our Prime Learners got selected in DXC

Prime Mock Access is Included with Prime Video Course

Interview and Resume Preparation included with Prime Subscription

Get Prime Video
Prime

PrepInsta Prime Mock

Topic wise and full mocks & much more

Get Prime Mock(For DXC)

82% of PrepInsta Prime Course students get selected in DXC

8 out of 10 fresh grads in Cognizant are from Prepinsta

11,000+ bought in last 1 month

Get Prime Mock

July 23, 2022

Comments

One comment on “DXC Technology Computer Programming MCQ Questions with Solutions 2023 PDF”


  • mahesh

    The most imp section in the most of the companies hiring process and many think it to be difficult but the way this section has explained me programming and fundamental is the best way..

    2