Code360 powered by Coding Ninjas X Code360 powered by Coding Ninjas X
Table of contents
DXC Interview Questions
Last Updated: Jun 14, 2024

DXC Interview Questions

Master Python: Predicting weather forecasts
Ashwin Goyal
Product Manager @


DXC Technology is a Fortune 500 global leader in IT services. SAP, Oracle, Microsoft, ServiceNow, and Salesforce are among the enterprise applications they develop, integrate, implement, and manage.

In this article, we are going to go through technical DXC interview questions that have been asked previously by the interview panel from their candidates. We hope that these questions will help you with your upcoming DXC interview.

Also Read: Java OOPs Interview Questions

DXC Interview Questions

  1. What are your thoughts on OS overlays?
    Ans: Overlays are essentially a programming method that divides processes into pieces so that important and required instructions can be saved in memory. It does not require any kind of OS support. It can run programs larger than physical memory by storing only the most important data and instructions at any given time.
  2. What exactly is virtual memory?
    Ans: An OS memory management technique gives users the illusion of having a large (main) memory. It is simply more space in which more programs can be stored in the form of pages. It allows us to increase the use of physical memory by using a disc while also providing memory protection. 

    The operating system can manage it in two ways: paging and segmentation. It serves as temporary storage for computer processes alongside RAM.
  3. What exactly do you mean by FCFS?
    Ans: FCFS (First Come, First Serve) is a type of operating system scheduling algorithm that executes processes in the order in which they arrive. In other words, the process that arrives first will be carried out first. It has no preemptive nature. FCFS scheduling may result in starvation if the first process's burst time is the longest of all jobs. 

    Burst time refers to the time required by the process to execute in milliseconds. It is also regarded as the simplest and easiest OS scheduling algorithm when compared to others. The FIFO (First In First Out) queue is commonly used to manage FCFS implementation.
  4. What exactly is reentrancy?
    Ans: Reentrant is simply a function that allows multiple clients to use and share a single copy of a program at the same time. This concept is usually associated with operating system code and has nothing to do with concurrency. It serves two primary purposes:
    • The program code cannot be changed or modified.
    • Local data for each client process must be stored on separate discs.
  5. What's the distinction between paging and segmentation?
  6. Are NULL values in a database synonymous with blank space or zero?
    Ans: No, a NULL value is not the same as zero or blank space because it represents a value that is assigned, unknown, unavailable, or not applicable, whereas blank space represents a character and zero represents a number.
  7. Explain the various types of relationships between tables in a DBMS.
    Ans: The following are the various types of table relationships in a DBMS system:
    • One to One Relationship: This type of relationship exists when one row in table X is linked to one row in table Y.
    • One to Many Relationship: When a single row in table X is related to many rows in table Y, this type of relationship is used.
    • Many to Many Relationship: When multiple rows in table X can be linked to multiple rows in table Y, this type of relationship is used.
    • Self-Referencing Relationship: This type of relationship is used when a specific row in table X is linked to another table.
  8. Explain the difference between the DELETE and TRUNCATE commands in a database management system.
  9. What do normalization and denormalization mean?
    Ans: Normalization is the process of organizing data into multiple tables to reduce redundancy. Normalization improves disc space utilization and makes database integrity easier to maintain.

    Denormalization is the opposite of normalization in that it combines the normalized tables into a single table to speed up data retrieval. By reversing the normalization, we can create a denormalized form of the data using the JOIN operation. 
  10. What exactly do you mean by "transparent DBMS"?
    Ans: A transparent DBMS is a type of DBMS that conceals its physical structure from users. Physical structure or physical storage structure refers to the DBMS memory manager and describes how data is stored on a disc.
  11. What is the definition of bootstrapping in compiler design?
    Ans: Bootstrapping is a process in compiler design in which a simple language is used to translate more complex programs. This complex program can handle even more complex programs and so on.
  12. What is the meaning of Relocatable Machine Code?
    Ans: The execution address of the relocatable machine code can be changed.
    Program code that can be loaded anywhere in memory is referred to as relocatable code. The code is typically divided into control sections, and all memory addresses are expressed relative to the beginning of a control section. As part of the loading process, the compiler/assembler generates a table of all such memory references, which the loader converts into absolute addresses.

    Must Read: Difference Between Compiler and Assembler
  13. What are some examples of compiler development tools?
    Ans: Here are some examples of compiler construction tools:
    • Scanner Generator Parser Generator
    • Engines for syntax-directed translation
    • Code generators that work automatically
    • Construction toolkits for compilers
    • Engines for analyzing data flow.
  14. What are the uses of graph Data Structure?
    Ans: The uses of the graph data structure are as follows:
    • Transport grids in which stations are represented as vertices and routes as graph edges
    • Utility graphs of power or water, with vertices representing connection points and edges representing wires or pipes connecting them.
    • Social network graphs to determine information flow and hotspots (edges and vertices).
    • Neural networks in which the vertices represent neurons and the edges represent synapses between them.
  15. Can you tell the difference between linear and non-linear data structures?
    Ans: linear data structure is one in which the elements of a data structure result in a sequence or a linear list. Non-linear data structures, on the other hand, traverse nodes in a non-linear fashion.
    Linear data structures include lists, stacks, and queues, whereas non-linear data structures include graphs and trees.
  16. Describe the scenarios in which linked lists can be used over arrays.
    Ans: The following are some examples of when we would prefer to use a linked list over an array:
    • When we don't know the exact number of elements ahead of time.
    • When we anticipate a large number of add or remove operations.
    • There are fewer random access operations.
    • When inserting items anywhere in the middle of a list, such as when implementing a priority queue, a linked list is more appropriate.
  17. What distinguishes a stack from a queue?
    Ans: In a stack, the most recently added item is removed first, whereas, in a queue, the least recently added item is removed first.
  18. What are the distinctions between the B and B+ trees?
    Ans: The B tree is an m-way self-balancing tree, with m defining the order of the tree. Btree is an extension of the Binary Search tree with more than one key and more than two children, depending on the number of m. The data is presented in a sorted manner in the B tree, with lower values on the left subtree and higher values on the right subtree.

    While the B+ tree is an advanced self-balanced tree as every path from the tree's root to its leaf is of the same length. Because all leaf nodes are the same length, they must all occur at the same level. Some leaf nodes cannot appear on the third level, while others can appear on the second level.
  19. Describe the procedure for storing a variable in memory.
    Ans: Based on the amount of memory required, a variable is stored in memory. The steps for storing a variable are as follows:
    • First, the required amount of memory is assigned.
    • The data is then stored using the data structure in use.
    • Using concepts such as dynamic allocation ensures high efficiency and that the storage unit can be accessed in real-time based on requirements.
  20. What is the time complexity of the HashMap class's basic functions get() and put()?
    Ans: If the hash function employed in the hash map distributes elements uniformly among the buckets, the time complexity is O(1).
  21. What is the definition of an algorithm?
    Ans: Algorithms define how calculations, data processing, automated reasoning, automated decision making, and other tasks should be carried out. A method for calculating a function that can be described in a finite amount of space and time, as well as in a well-defined formal language, is known as an algorithm. 

    Starting from an initial state and initial input, the instructions describe a computation that, when executed, proceeds through a finite number of well-defined following stages, eventually producing "output" and terminating at a final ending state (possibly empty). The transition from one state to the next is not always predictable; certain algorithms referred to as randomized algorithms, factor in random input.
  22. What do you mean by an algorithm's best case, worst case, and average case scenarios?
    Ans: The asymptotic analysis defines the mathematical foundation/framing of an algorithm's run-time performance. Using asymptotic analysis, we can readily determine the best case, average case, and worst-case situations of an algorithm.

    • Algorithm Best-Case Scenario: The best-case scenario for an algorithm is defined as the data arrangement in which the algorithm performs best. For example, in a binary search, the best-case situation is if the target value is in the very center of the data we're looking for. The binary search would have a time complexity of O(1) or continuous-time complexity in the best-case scenario.
    • Algorithm Worst-Case Scenario: The worst-case scenario of an algorithm is the worst collection of input for that algorithm. If the pivot value is set to the largest or smallest element of a sublist, quicksort may perform poorly. Quicksort will devolve into an algorithm with an O(n2) time complexity, where n is the length of the list to be sorted.
    • Algorithm Average-Case Scenario: According to computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the process, averaged over all potential inputs. The randomized quicksort algorithm, for example, has an average complexity of O(n*log(n)), where n is the size of the list to be sorted. 
  23. What are your thoughts on greedy algorithms?
    Ans: A greedy algorithm is an algorithm that seeks to select the best optimal decision at each sub-step on the way to a globally optimal solution. This means that, regardless of the consequences, the algorithm chooses the best response accessible at the time. 

    In other words, when an algorithm seeks a solution, it always chooses the best immediate, or local, choice. Greedy algorithms may find less-than-ideal solutions to some problems while finding the overall, ideal solution to some idealistic problems.
  24. Explain how the merge sort algorithm works.
    Ans: Merge sort is a computer science-developed general-purpose, comparison-based sorting algorithm. The majority of its implementations provide a stable sort, which means that equal elements in the input and output are sorted in the same order. 

    The concept of merge sort is,
    • Divide the unsorted list into n sublists, each containing a single entry (a list of one element is considered sorted).
    • Repeat the process of merging sublists to create new sorted sublists until only one sublist remains. The sorted list will then be shown.
    • The Merge Sort Algorithm's time complexity is O(n*log(n)), where n is the length of the list of elements to be sorted, while the Merge Sort Algorithm's space complexity is O(n), or linear space complexity.
  25. What exactly is a VPN?
    Ans: VPN is an abbreviation for virtual private networks. A virtual private network (VPN) is a technology that establishes a secure, encrypted connection over an insecure network, such as the internet. A Virtual Private Network (VPN) is a method of extending a private network by utilizing a public network, such as the internet. 

    The name only implies that it is a virtual "private network," implying that a user can be a part of a local network while sitting in a remote location. To establish a secure connection, it employs tunneling protocols.
  26. IPsec operates at what layer?
    Ans: IPsec operates on the OSI model's layer 3.
  27. What are the various factors that influence network security?
    Ans: There are primarily two security influencing factors, these are viruses and unauthorized access.
  28. What are the various factors that influence network reliability?
    Ans: The following factors influence network reliability:
    • Failure frequency
    • After-failure network recovery time
  29. What exactly is a Tunnel mode?
    Ans: This is a data exchange mode in which two communicating computers do not use IPSec. Instead, the gateway that connects their LANs to the transit network creates a virtual tunnel that secures all communication that passes through it using the IPSec protocol.

    Tunnel mode is most commonly used between gateways or between end-stations and gateways, with the gateway acting as a proxy for the hosts behind it. Tunnel mode is typically used to encrypt traffic between secure IPSec gateways, such as the Cisco router and the PIX Firewall.
  30. What is the primary function of a DNS server?
    Ans: DNS is an abbreviation for Domain Name Server. It converts Internet domains and hostnames to IP addresses and the other way around. DNS technology allows you to type names into your Web browsers and our computer will find that address on the Internet for you. 

    A critical component of the DNS is a global network of DNS servers. It is in charge of assigning domain names and mapping them to Internet resources by appointing an authoritative name server for each domain. The Internet has two main namespaces: the Domain Name System and the Internet Protocol Address Space.
Get the tech career you deserve, faster!
Connect with our expert counsellors to understand how to hack your way to success
User rating 4.7/5
1:1 doubt support
95% placement record
Akash Pal
Senior Software Engineer
326% Hike After Job Bootcamp
Himanshu Gusain
Programmer Analyst
32 LPA After Job Bootcamp
After Job


In this article, we discussed the technical DXC interview questions.

We hope this blog has helped you enhance your knowledge regarding interview preparations and will surely help you in DXC interviews. After reading about the DXC interview questions, are you not feeling excited to read/explore more articles? You can visit our interview blogs, can practice coding questions that are frequently asked in interviews, SQL interview questionOOPS interview questions, and much more.

Recommended Readings:


Refer to our Guided Path on Coding Ninjas Studio to upskill yourself in Data Structures and AlgorithmsCompetitive ProgrammingJavaScriptSystem Design, and many more! If you want to test your competency in coding, you may check out the mock test series and participate in the contests hosted on Coding Ninjas Studio!

But suppose you have just started your learning process and are looking for questions asked by tech giants like Amazon, Microsoft, Uber, etc. In that case, you must look at the problems, interview experiences, and interview bundle for placement preparations.

Nevertheless, you may consider our paid courses to give your career an edge over others!

Do upvote our blogs if you find them helpful and engaging!

Happy Learning!

Previous article
EY Interview Questions
Next article
Genc Elevate Interview Questions
Live masterclass