EDCIL Digital Forensics Analyst Interview Questions and Answers

Developing databases, optimizing statistical efficiency, and interpreting complex data sets.

Q1. The aptitude test was final round of interviews
Add your answer

Q1. Can you tell me about yourself?
Ans. 
I am a dedicated and detail-oriented analyst with a strong background in data analysis and problem-solving.
• I have a Bachelor's degree in Statistics and have completed multiple data analysis projects during my studies.

• I am proficient in using statistical software such as R and Python for data analysis.

• I have experience in conducting market research and creating detailed reports for stakeholders.

• I am a quick learner and ...read more
Answered by AI
Add your answer

Q1. SQL round consisting of joins, window functions
Add your answer

Q1. Managerial round mostly HR questions
Add your answer

Q1. Previous work exp, projects, mix of HR questions as well.
Add your answer

Q1. What is DAX and its use in power bi
Ans. 
DAX (Data Analysis Expressions) is a formula language used in Power BI for data modeling and analysis.
• DAX is used to create calculated columns and measures in Power BI.

• It allows for advanced data analysis, such as time intelligence functions (e.g., YEAR, MONTH).

• Example: A measure to calculate total sales could be defined as: Total Sales = SUM(Sales[Amount]).

• DAX supports filtering and context manipulation, enabling dyna...read more
Answered by AI
Add your answer
Q2. Role of power query in power bi
Add your answer

Q1. Queston on SQL queries and data aggregation
Add your answer
Q2. Question on python numpy and pandas
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. 
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
• Use Dijkstra's algorithm to find the shortest path between the given vertices.

• Create a graph data structure to represent the weighted, undirected graph.

• Handle cases where no path exists between the given vertices by returning -1.

• Optimize the algorithm to handle multiple queries efficiently.

• Consider edge cases such as...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively

• Sort the two halves separately

• Merge the sorted halves to produce a fully sorted array

• Time complexity of Merge Sort is O(n log n)

• Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
• Use backtracking to explore all possible paths from the starting cell to the destination cell.

• At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

• Keep track of the path taken so far and mark the cells accordingly.

• Once the destination cell i...read more
Answered by AI
Add your answer

Q1. Question doesn't matter
Add your answer
Q2. Question doesn't really care
Add your answer

Q1. All normal questions
Add your answer