DTCC Software Engineer Interview Questions and Answers

Basic array and vectors DSA questions

Q1. Asked me about my past project and my contribution in it
Add your answer
Q2. Linux commands and c++ language control
Add your answer
Q3. Asked me to write last function i wrote and explain what it does
Add your answer

Q1. Asked me about my past projects and my contribution
Add your answer
Q2. Checked my work ethics
Add your answer

Q1. Basic hr questions
Add your answer
Q2. Salary negotiation
Add your answer

Q1. What is policy manager
Ans. 
Policy manager is a software tool used to centrally manage and enforce policies across an organization's systems and applications.
• Policy manager helps define, monitor, and enforce policies related to security, compliance, access control, and other governance aspects.

• It allows administrators to set rules and regulations that govern how data and resources are accessed and used within an organization.

• Policy manager can au...read more
Answered by AI
Add your answer

Java, OS, CN, DBMS MCQs

Q1. List of randome integers, return top 5 largest numbers
Ans. 
Return top 5 largest numbers from a list of random integers
• Sort the list of integers in descending order

• Return the first 5 numbers from the sorted list
Answered by AI
Add your answer
Q2. Mockitio and unit testing
Add your answer

Cognitive test basically testing aptitude

Test TO show my coding skills on Dsa and Dbms

Q1. WHat IS circular linked list
Ans. 
A circular linked list is a linked list where the last node points back to the first node, forming a circle.
• Each node has a reference to the next node in the list.

• The last node's reference points back to the first node.

• Traversal can start from any node and loop through the entire list.
Answered by AI
Add your answer
Q2. What is time omplexity . explain with examples
Ans. 
Time complexity refers to the amount of time an algorithm takes to run as a function of the input size.
• Time complexity is typically expressed using Big O notation, which describes the worst-case scenario.

• Common time complexities include O(1) for constant time, O(log n) for logarithmic time, O(n) for linear time, O(n^2) for quadratic time, and O(2^n) for exponential time.

• For example, searching for an element in a sorted...read more
Answered by AI
Add your answer