Question 1

What is load balancing?

Accepted Answer

The process of distributing network traffic across multiple servers to ensure no single server bears too much demand.

Question 2

What is the difference between B2B and B2C marketing?

Accepted Answer

'B2B (Business-to-Business) marketing focuses on logical, ROI-driven messaging aimed at decision-makers in companies, often with longer sales cycles. B2C (Business-to-Consumer) marketing is more emotion-driven, focused on individual consumers, and usually has shorter, more impulsive sales cycles.'

Tip: B2B is logical/ROI-focused. B2C is emotional/impulse-focused.

Question 3

Why did you choose your major/degree?

Accepted Answer

'I chose Computer Science because I have always been fascinated by how technology can solve complex, real-world problems. I love the logical thinking and creativity that goes into writing code. Building a software application from scratch and seeing it work perfectly gives me a lot of satisfaction, which is why I knew this was the right field for me.'

Tip: Express genuine passion.

Question 4

What are stacks and queues in data structures? Provide Python implementations for both, including basic operations like push, pop, enqueue, and dequeue.

Accepted Answer

Stacks and queues are fundamental data structures used to store and manage data. A stack follows the Last In First Out (LIFO) principle, while a queue follows the First In First Out (FIFO) principle.

### Stack Implementation:
```python
class Stack:
    def __init__(self):
        self.items = []

def push(self, item):
        self.items.append(item)

def pop(self):
        if not self.is_empty():
            return self.items.pop()
        raise IndexError('pop from empty stack')

def peek(self):
        if not self.is_empty():
            return self.items[-1]
        raise IndexError('peek from empty stack')

def is_empty(self):
        return len(self.items) == 0

def size(self):
        return len(self.items)
```

### Queue Implementation:
```python
class Queue:
    def __init__(self):
        self.items = []

def enqueue(self, item):
        self.items.insert(0, item)

def dequeue(self):
        if not self.is_empty():
            return self.items.pop()
        raise IndexError('dequeue from empty queue')

def is_empty(self):
        return len(self.items) == 0

def size(self):
        return len(self.items)
```

In the `Stack` class, we implement `push`, `pop`, `peek`, `is_empty`, and `size` methods. The `Queue` class includes `enqueue`, `dequeue`, `is_empty`, and `size` methods. Both implementations check for edge cases, such as popping from an empty stack or dequeuing from an empty queue, by raising an `IndexError`. These structures are useful in various algorithms and applications, such as backtracking and scheduling tasks.

Question 5

What comes next in the series: 2, 6, 12, 20, 30, ...?

Accepted Answer

42 (The differences are 4, 6, 8, 10, 12).

SarthiQ

Interview Preparation Guide

Data Analytics Intern
Questions & Answers

Document Details

Need Help?

Top Data Analytics Intern Interview Questions

Data Analytics Intern Interview Questions

A Software Engineer was asked

A Marketing Intern was asked

HR

Software Engineer