Macquarie Group Data Analyst Intern Interview Questions and Answers for Freshers

Q1. Database questions for Java position
Add your answer
Q2. SQL performance techniques
Ans. 
SQL performance techniques
• Use indexes to speed up queries

• Avoid using SELECT * and only select necessary columns

• Use stored procedures to reduce network traffic

• Avoid using subqueries and instead use JOINs

• Use EXPLAIN to analyze query performance

• Normalize database tables to reduce redundancy

• Use connection pooling to reduce overhead

• Avoid using cursors and use set-based operations instead
Answered by AI
Add your answer

Q1. Linux shell script for reading and parsing the flat file
Ans. 
A Linux shell script can be used to read and parse a flat file.
• Use the 'read' command to read the file line by line

• Use 'cut' command to parse the data based on delimiter

• Use 'awk' command to filter and manipulate data

• Use 'sed' command to search and replace data

• Use 'grep' command to search for specific patterns in the file
Answered by AI
Add your answer

Q1. What are your salary expectations?
Add your answer
Q2. Why are you looking for a change?
Add your answer
Q3. Where do you see yourself in 5 years?
Add your answer
Q4. Minimum salary expectation
Add your answer

Q1. About my career, job experience and introduction round
Add your answer
Q2. About the change management, how I added value to my team being team lead and how I made difference when compared to other team leads in the organisation
Add your answer
Q3. About the implementations and process improvements done in the process
Add your answer

Q1. Tell me about yourself and some basic technical questions
Add your answer

This was totally grilled about your prior experience and what kind of projects you have worked upon. More and more technical questions.

Q1. General HR questions
Add your answer

Easy to Medium DSA questions and Multiple Choice Java questions

Q1. How HashMaps in Java work internally
Ans. 
HashMaps in Java use hashing to store key-value pairs, allowing for fast retrieval and insertion.
• HashMap uses a hash table to store key-value pairs.

• Keys are hashed to determine the index where the value will be stored.

• Collisions are resolved using linked lists or balanced trees.

• HashMap allows null keys and values.

• Example: HashMap<String, Integer> map = new HashMap<>();
Answered by AI
Add your answer
Q2. Array Problem of DSA Medium
Ans. 
The array problem involves manipulating an array of strings.
• Use built-in array methods like map, filter, and reduce for efficient manipulation.

• Consider sorting the array based on specific criteria.

• Think about using regular expressions for string manipulation.

• Handle edge cases like empty arrays or null values appropriately.
Answered by AI
Add your answer

Q1. System design question
Add your answer

Q1. Internal working of HashMap and Concurrency Map
Ans. 
HashMap is a data structure that stores key-value pairs, while Concurrency Map allows for safe concurrent access.
• HashMap internally uses an array of linked lists to store key-value pairs.

• Concurrency Map implementations like ConcurrentHashMap use locks or other mechanisms to allow safe concurrent access.

• HashMap allows for null keys and values, while ConcurrentHashMap does not allow null keys or values.

• Concurrency Map im...read more
Answered by AI
Add your answer
Q2. Multithreading questions
Add your answer
Q3. Questions on PCF, how the deployment works
Add your answer
Q4. One Sorting question to list the count of employees by age
Add your answer