Infosys Digital Specialist Interview Questions and Answers for Freshers

Array, sorting ,tree

Q1. Project reltd ques
Add your answer
Q2. What is the difficulty you faced how u handed
Ans. 
I faced difficulty in managing multiple digital marketing campaigns simultaneously.
• Balancing time and resources for each campaign

• Prioritizing tasks based on campaign performance

• Ensuring consistent messaging and branding across all campaigns
Answered by AI
Add your answer
Q3. What was yr role in the proj
Ans. 
I was responsible for managing the digital marketing strategy and execution for the project.
• Developed and implemented digital marketing campaigns to increase brand awareness and drive traffic to the website

• Managed social media accounts and created engaging content to attract and retain customers

• Utilized analytics tools to track and measure the success of digital marketing efforts

• Collaborated with cross-functional teams...read more
Answered by AI
Add your answer

General coding interview

Q1. Some basic easy leetcode questions
Add your answer
Q2. One puzzle that can be found on gfg
Add your answer

There were 30questions of aptitude and some verbal reasoning

There were 3codes. 1 is easy level and 2 are medium harder

Q1. Self introduction
Add your answer
Q2. Time Complexity of Merge Sort
Ans. 
Merge Sort has a time complexity of O(n log n).
• Merge Sort is a divide-and-conquer algorithm that recursively divides the array into two halves.

• It then merges the sorted halves to produce a sorted array.

• The time complexity of Merge Sort is O(n log n), where n is the number of elements in the array.

• This makes Merge Sort efficient for sorting large arrays.

• Example: Sorting an array of 8 elements would require 3 merge steps...read more
Answered by AI
Add your answer
Q3. Algorithm for tree in Data structures
Ans. 
An algorithm for trees in data structures.
• A tree is a hierarchical data structure with a set of connected nodes.

• Common operations on trees include insertion, deletion, and traversal.

• There are different types of trees such as binary trees, AVL trees, and B-trees.

• Tree algorithms often involve recursion and depth-first or breadth-first traversal.

• Examples of tree algorithms include finding the height of a tree or checking
Answered by AI
Add your answer
Q4. Difference between list and tuple
Ans. 
Lists and tuples are both sequence data types in Python, but they have some key differences.
• Lists are mutable, meaning their elements can be changed, added, or removed.

• Tuples are immutable, meaning their elements cannot be changed once defined.

• Lists are defined using square brackets [], while tuples use parentheses ().

• Lists are typically used for collections of similar items, while tuples are used for heterogeneous dat...read more
Answered by AI
Add your answer
Q5. More questions on Data structures
Add your answer

3 questions easy medium hard. You need to solve only 1 to get shortlisted

Q1. I joined as fresher so they asked about my project and my core questions
Add your answer