DataMetica Architect Interview Questions and Answers

Competitive coding, multiple choice questions

Q1. CS fundamentals, Object oriented programming, Networking, SQL
Add your answer
Q2. Explain 4 concept of OOPS
Ans. 
OOPS concepts include Inheritance, Encapsulation, Polymorphism, and Abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation details and showing only the necessary features.
Answered by AI
Add your answer
Q3. Explain subnet in networking
Ans. 
A subnet is a smaller network within a larger network, created by dividing the IP address range of the larger network.
• Subnets help in organizing and managing network resources efficiently.

• They allow for better security by isolating different parts of the network.

• Subnets can be created by dividing an IP address range into smaller ranges.

• For example, a company may have different subnets for different departments like HR,
Answered by AI
Add your answer
Q4. Concepts of Operating system
Add your answer

Q1. Behavioral questions, questions related to project, questions related to internship
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was a MCQ round. 30 ques in 30 mins consisting of difficult quantitative aptitude questions were to be solved.

Round duration - 60 minutes
Round difficulty - Medium

In this test round, 2 coding questions were given. Either write the code or pseudo code

Q1. 
N Queens Problem
Given an integer N, find all possible placements of N queens on an N x N chessboard such that no two queens threaten each other.
Explanation:
A queen can attack another queen if they ar...read more
Ans. 
The N Queens Problem involves finding all possible placements of N queens on an N x N chessboard without threatening each other.
• Use backtracking algorithm to explore all possible configurations.

• Keep track of rows, columns, and diagonals to ensure queens do not threaten each other.

• Generate all valid configurations and print them out.
Answered by AI
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. 
Sort an array of 0s, 1s, and 2s in linear time complexity.
• Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.

• Swap elements based on the values encountered to sort the array in-place.

• Time complexity should be O(N) and space complexity should be O(1).
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

This was a technical round with questions on DSA.

Q1. 
Reverse Words in a String: Problem Statement
You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...read more
Ans. 
Reverse words in a string while handling leading, trailing, and multiple spaces.
• Split the input string by spaces to get individual words

• Reverse the order of the words

• Join the reversed words with a single space in between
Answered by AI
Add your answer
Q2. 
Circular Linked List Detection
You are provided with the head of a linked list containing integers. Your task is to determine if the linked list is circular.
Note:
• A linked list is considered circula...read more
Ans. 
Detect if a given linked list is circular by checking if it forms a closed loop.
• Traverse the linked list using two pointers, one moving at double the speed of the other.

• If the two pointers meet at any point, the linked list is circular.

• If the faster pointer reaches the end of the list (NULL), the linked list is not circular.
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

The first round of the interview includes Data Structures and Algorithms (DSA).

The second round of interviews involves a project.

Very basic aptitude questions along with few coding questions

Q1. A problem statement was given and we had to provide an optimal approach to design and handle that problem
Add your answer
Q2. Oops concepts, SQL queries
Add your answer

Basic Programming questions will be there

Q1. Why Java is most secured!?
Ans. 
Java is most secured due to its strong memory management, bytecode verification, and security manager.
• Java's strong memory management prevents buffer overflow and other memory-related vulnerabilities.

• Bytecode verification ensures that the code is safe to execute and prevents malicious code from running.

• Security manager allows fine-grained control over access to system resources.

• Java also has a robust set of security AP...read more
Answered by AI
Add your answer
Q2. Explain how Java program execute?
Ans. 
Java programs are executed by the Java Virtual Machine (JVM) which interprets and executes the bytecode generated by the Java compiler.
• Java source code is compiled into bytecode by the Java compiler

• The bytecode is platform-independent and can be executed on any device with a JVM

• The JVM interprets the bytecode and executes the instructions

• The JVM manages memory, handles exceptions, and provides other runtime services

• Exa
Answered by AI
View 1 more answer

Q1. Communication and basic technical questions
Add your answer

Difficulty level is medium

Q1. Medium about java and database
Add your answer

Q1. Medium level - about project
Add your answer

Q1. Why strings are immutable
Ans. 
Strings are immutable to ensure data integrity and security by preventing accidental or intentional modification.
• Immutable strings prevent accidental changes to data

• Enhances security by preventing data tampering

• Allows for efficient memory management
Answered by AI
Add your answer
Q2. Count the number of repeated words from the given string
Ans. 
Count the number of repeated words in a given string
• Split the string into words using a delimiter like space

• Create a hashmap to store word frequencies

• Iterate through the words and update the hashmap accordingly

• Count the number of words with frequency greater than 1
Answered by AI
Add your answer