Trading Technologies Software Developer Interview Questions and Answers

Q1. Basics of angular, ts,js
Add your answer

Q1. Programming questions
Add your answer

Q1. Family backgroud
Add your answer

Q1. Hash map implementation
Ans. 
Hash map is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.
• Hash map uses a hash function to map keys to indices in an array.

• Collision handling is important in hash map implementation.

• Common operations include adding, removing, and retrieving key-value pairs.

• Example: HashMap map = new HashMap<>();
Answered by AI
Add your answer
Q2. About software development models
Add your answer

Medium level question are asked

Q1. Given a array and asked sum
Add your answer

Includes basic concepts of computer networks, computer architecture and technical MCQ questions. First round also includes 3 coding questions of easy level. Those who solved 2 coding questions got selected for next round.

Q1. Question from oops concept, c++ and JAVA were asked.
Add your answer
Q2. Questions data structures like how to reverse a linked list were asked.
Add your answer
Q3. Explain packages in java
Ans. 
Packages in Java are used to organize classes and interfaces into namespaces for better code organization and reusability.
• Packages help in avoiding naming conflicts by grouping related classes together.

• Packages can be nested within each other to create a hierarchical structure.

• Packages are declared using the 'package' keyword at the beginning of a Java file.

• Example: 'package com.example.myapp;' declares a package named
Answered by AI
Add your answer
Q4. Explain the use of public static void main
Ans. 
The public static void main method is the entry point of a Java program.
• It is a mandatory method in Java programs, as it is the starting point of execution.

• The 'public' keyword allows the main method to be accessed from outside the class.

• The 'static' keyword allows the main method to be called without creating an instance of the class.

• The 'void' keyword indicates that the main method does not return any value.

• The 'main...read more
Answered by AI
View 1 more answer

Q1. Questions about the awards and certification i mentioned in my resume
Add your answer
Q2. Common HR questions like location....salary......why tata elxsi ect..
Add your answer

Technical round was really good

Q1. What is binary search
Ans. 
Binary search is a search algorithm that finds the position of a target value within a sorted array.
• Divide and conquer approach

• Compares target value with middle element of array

• If target value is smaller, search left half; if larger, search right half

• Repeat process until target value is found or subarray is empty
Answered by AI
Add your answer
Q2. Binary search and time
Add your answer
Q3. What is linked list
Ans. 
A linked list is a data structure consisting of nodes where each node contains a data field and a reference to the next node in the sequence.
• Linked list elements are not stored in contiguous memory locations like arrays.

• Each node in a linked list contains data and a reference to the next node.

• Linked lists can be singly linked (each node points to the next node) or doubly linked (each node points to both the next and pr
Answered by AI
Add your answer
Q4. Tree data structure
Add your answer
Q5. Avl tree and write code
Add your answer

Easy and os que were there

Q1. Os related oops dbms and mostly revolving around resume
Add your answer
Q2. What is collection frameworks
Ans. 
Collection frameworks in Java provide a set of classes and interfaces to store and manipulate groups of objects.
• Collection frameworks provide reusable data structures like lists, sets, and maps.

• They offer algorithms to manipulate and access the elements in these data structures.

• Examples include ArrayList, HashSet, and HashMap in Java.
Answered by AI
Add your answer

Q1. Projects: architecture, Technology stack
Add your answer
Q2. OOP: Scenarios in IT
Add your answer

Logical reasoning, quantitative aptitude

Q1. Operating systems, oops concepts, networking and database related.
Add your answer
Q2. Scheduling algorithm
Ans. 
Scheduling algorithm is a method used to determine the order of tasks to be executed on a computer system.
• Scheduling algorithms help in optimizing resource utilization and improving system performance.

• Examples of scheduling algorithms include First Come First Serve, Shortest Job Next, Round Robin, etc.
Answered by AI
Add your answer
Q3. Cache policy explain
Ans. 
Cache policy determines how data is stored, accessed, and replaced in a cache memory.
• Cache policies include FIFO, LRU, LFU, and random replacement algorithms.

• FIFO (First In, First Out) replaces the oldest data first.

• LRU (Least Recently Used) replaces the least recently accessed data first.

• LFU (Least Frequently Used) replaces the least frequently accessed data first.

• Random replacement algorithm replaces data randomly.
Answered by AI
Add your answer
Q4. How do you donormalisation?
Ans. 
Normalization is the process of organizing data in a database to reduce redundancy and improve data integrity.
• Normalization involves breaking down data into smaller, more manageable parts.

• It helps in reducing data redundancy by storing data in a structured way.

• Normalization ensures data integrity by avoiding anomalies like insertion, update, and deletion anomalies.

• There are different normal forms like 1NF, 2NF, 3NF, BC...read more
Answered by AI
Add your answer