DXC Technology Computer Programming MCQ Questions with Solutions 2024 PDF

Curriculum

Use Coupon Code “CT10” and get flat 10% OFF on PrepInsta Prime, additionally get:

    • 1 month extra on 3 & 6 months plans
    • 2 months extra on 12 & 24 months plans
    • 3 months extra on 36 & 48 months plans

Use Coupon Code "CT10" to get Flat 10% OFF on PrepInsta Prime

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.

DXC Computer Programming MCQ Questions

DXC Technology Computer Programming MCQ Questions & Answers 2024

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
0%

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

51.44%

Prints all nodes of linked list in reverse order

Prints all nodes of linked list in reverse order

34.17%

Prints alternate nodes of Linked List

Prints alternate nodes of Linked List

9.44%

Prints alternate nodes in reverse order

Prints alternate nodes in reverse order

4.95%

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.56%

It is easy to insert and delete elements in Linked List

It is easy to insert and delete elements in Linked List

16.36%

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

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

7.61%

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

17.73%

All of the above

All of the above

52.74%

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.1%

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

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

12.97%

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

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

49.31%

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

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

14.61%

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)

32.4%

O(n2^n)

O(n2^n)

32.61%

On

On

16.82%

O(logn)

O(logn)

18.17%

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

32.45%

X = lDepth + 1, Y = rDepth + 1

X = lDepth + 1, Y = rDepth + 1

41.29%

X = lDepth - 1, Y = rDepth -1

X = lDepth - 1, Y = rDepth -1

16.26%

None of the above

None of the above

10%

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

41.93%

Merge Sort

Merge Sort

17.71%

Heap Sort

Heap Sort

15.46%

Shell sort

Shell sort

24.89%

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.6%

Deleting a node at the beginning of the list

Deleting a node at the beginning of the list

11.2%

Inserting a node at the end of the list

Inserting a node at the end of the list

40.8%

Deleting a node at the end of the list

Deleting a node at the end of the list

4.41%

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;
}

34.22%

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;
}

19.86%

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.75%

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.17%

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.8%

Print fail if a particular element is not found

Print fail if a particular element is not found

31.27%

Print success if a particular element is equal to 1

Print success if a particular element is equal to 1

22.77%

Print fail if the list is empty

Print fail if the list is empty

11.17%

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.87%

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.8%

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

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

27.68%

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.65%

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

prepinsta-prime

Analytics 2024

Stats About Computer Programming MCQ 2024

Number of Questions 12%
Cut-Off 80%
Difficulty 70%

Topic Wise Analytics

C/C++/Java Concepts
0-3 Number of Questions
Difficulty 65%
Importance 60%
Computer Fundamentals
1-5 Number of Questions
Difficulty 70%
Importance 65%
Operating System
0-3 Number of Questions
Difficulty 70%
Importance 65%
Data Structure
1-3 Number of Questions
Difficulty 65%
Importance 70%
DBMS
1-4 Number of Questions
Difficulty 65%
Importance 60%

DXC Computer Programming MCQ Detailed Information 2024:-

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

Get over 200+ Courses under One Subscription

Get Prime Course List
mute
Limitless Learning

One Subscription access everything

Job Assistance

Get Access to PrepInsta Prime

Top Faculty

from FAANG/IITs/TOP MNC's

Get Prime

Don’t settle Learn from the Best with PrepInsta Prime Subscription

manish-prepinsta

Manish Agarwal

Ex- Accenture

Trained 3.2L+ students

Rushikesh-prepinsta

Rushikesh Konapure

Data Science & Full Stack Mentor

Trained 35k+ students

atulya-prepinsta

Atulya Kaushik

Ex- Google & Instamojo

Trained 3.2L+ students

Aashay-prepinsta

Aashay Mishra

Ex- Sapient

Trained 83k+ students

Janvi-prepinsta

Janvi Jain

Lead Verbal Mentor

Trained 46k+ students

Learn from Top 1%
Get Prime
prepinsta
prepinsta
prepinsta
prepinsta
prepinsta
prepinsta
prepinsta

One Subscription, For Everything

The new cool way of learning and upskilling -

Limitless Learning

One Subscription access everything

Job Assistance

Get Access to PrepInsta Prime

Top Faculty

from FAANG/IITs/TOP MNC's

Get Prime →

Get over 200+ course One Subscription

Courses like AI/ML, Cloud Computing, Ethical Hacking, C, C++, Java, Python, DSA (All Languages), Competitive Coding (All Languages), TCS, Infosys, Wipro, Amazon, DBMS, SQL and others.

Get Prime Course List
Get Prime Course List

One comment on “DXC Technology Computer Programming MCQ Questions with Solutions 2024 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..

February 13, 2024