SanDisk India Device Design Centre Software Developer Interview Questions and Answers

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions on OOPS and OS mainly.

Q1. What are Little Endian and Big Endian in the context of computer architecture?
Ans. 
Little Endian and Big Endian refer to the order in which bytes are stored in computer memory.
• Little Endian stores the least significant byte first, while Big Endian stores the most significant byte first.

• Little Endian is commonly used in x86 architecture, while Big Endian is used in architectures like SPARC and PowerPC.

• Endianness can affect data transmission between systems with different byte orders.
Answered by AI
Add your answer
Q2. Write a program to determine if your system is little-endian or big-endian.
Ans. 
Program to determine system's endianness
• Check the endianness by storing a multi-byte integer and checking the byte order

• Use bitwise operations to extract the least significant byte

• If the least significant byte is at the lowest memory address, it's little-endian

• If the least significant byte is at the highest memory address, it's big-endian
Answered by AI
Add your answer
Q3. What is the volatile keyword in programming?
Ans. 
The volatile keyword in programming is used to indicate that a variable's value can be changed unexpectedly.
• Volatile keyword is used in multithreaded programming to prevent compiler optimizations on variables that can be changed by other threads.

• It tells the compiler not to cache the variable's value in a register, ensuring that every access is made to the variable's memory location.

• Commonly used in embedded systems pr...read more
Answered by AI
Add your answer
Q4. What is the use of a function pointer in C?
Ans. 
Function pointers in C are used to store the address of functions, allowing for dynamic function calls and callbacks.
• Function pointers can be used to implement callbacks in event-driven programming.

• They can be used to switch between different functions at runtime.

• Function pointers are commonly used in implementing data structures like function pointers in an array of function pointers.

• Example: void (*funcPtr)(int) = &a...read more
Answered by AI
View 1 more answer
Q5. Design a data structure to implement multi-threading.
Ans. 
Design a data structure for multi-threading
• Use a thread-safe queue to manage tasks for each thread

• Implement a lock or semaphore to control access to shared resources

• Consider using condition variables for synchronization

• Use atomic operations for shared variables to prevent race conditions
Answered by AI
Add your answer
Q6. What does a kernel do?
Ans. 
The kernel is the core component of an operating system that manages system resources and provides a bridge between software and hardware.
• Manages system resources such as CPU, memory, and I/O devices

• Provides a bridge between software applications and hardware components

• Handles tasks such as process scheduling, memory management, and device drivers

• Controls communication between hardware and software layers
Answered by AI
Add your answer
Q7. What is a storage class in programming?
Ans. 
A storage class in programming defines the scope and lifetime of variables.
• Storage classes include auto, register, static, and extern.

• Auto variables are created when a function is called and destroyed when the function ends.

• Register variables are stored in CPU registers for faster access.

• Static variables retain their value between function calls.

• Extern variables are declared outside of any function and can be accessed ...read more
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

HR round with typical behavioral problems.

Round duration - 60 minutes
Round difficulty - Medium

The test was in the evening which was not too late. It was conducted on Hackerrank which is a very common platform and was hence familiar. There were 26 questions:
Q1: Coding Question
3 languages were allowed: c, java8, python3
Q2 - Q26: Multiple Choice Questions

Q1. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. 
Find the node where two linked lists merge, return -1 if no merging occurs.
• Traverse both lists to find the lengths and the last nodes

• Align the starting points of both lists by moving the longer list's pointer ahead by the difference in lengths

• Traverse both lists simultaneously until a common node is found, which is the merging point
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was the initial round consisting of some aptitude questions,technical multiple choice questions and one coding question.
The Multiple Choice Questions were pretty straight forward.

Q1. 
Snake and Ladder Problem Statement
Given a 'Snake and Ladder' board with N rows and N columns, where positions are numbered from 1 to (N*N) starting from the bottom left, alternating direction each row, f...read more
Ans. 
Find the minimum number of dice throws required to reach the last cell on a 'Snake and Ladder' board.
• Start from the bottom left cell and move according to dice outcomes (1-6).

• Utilize snakes and ladders to reach the last cell faster.

• Keep track of the minimum number of throws required to reach the last cell.

• If unreachable, return -1 as output.
Answered by AI
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

I had two interviewers in this round.Some Problem solving questions were asked in this round.

Q1. 
Anagram Pairs Verification Problem
Your task is to determine if two given strings are anagrams of each other. Two strings are considered anagrams if you can rearrange the letters of one string to form the...read more
Ans. 
Check if two strings are anagrams of each other by comparing their sorted characters.
• Sort the characters of both strings and compare them.

• Use a dictionary to count the frequency of characters in each string and compare the dictionaries.

• Ensure both strings have the same length before proceeding with comparison.

• Example: For input 'spar' and 'rasp', after sorting both strings, they become 'aprs' which are equal, so return...read more
Answered by AI
Add your answer
Q2. Can you explain all the main Object Oriented Programming concepts?
Ans. 
Object Oriented Programming concepts include encapsulation, inheritance, polymorphism, and abstraction.
• Encapsulation: Bundling data and methods that operate on the data into a single unit (class). Example: Class Car with properties like color and methods like drive().

• Inheritance: Creating new classes based on existing classes, inheriting their attributes and methods. Example: Class SUV inheriting from class Car.

• Polymor...read more
Answered by AI
Add your answer
Q3. Can you explain one of your projects?
Add your answer

Round duration - 45 Minutes
Round difficulty - Easy

Number Of Interviewers : 2
I was asked two problem solving questions and I was asked to explain my projects.

Round duration - 60 Minutes
Round difficulty - Easy

It was in the morning. Because of covid test was from home. We had 50 MCQ and 1 coding question. The coding question was pretty easy. MCQ were mixed, we even had questions from machine learning.

Q1. 
Maximum Path Sum Between Two Leaves
Given a non-empty binary tree where each node has a non-negative integer value, determine the maximum possible sum of the path between any two leaves of the given tree.
...read more
Ans. 
Find the maximum path sum between two leaf nodes in a binary tree.
• Traverse the tree to find the maximum path sum between two leaf nodes

• Consider both cases where the path passes through the root and where it doesn't

• Keep track of the maximum sum while traversing the tree
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Interview round. Questions were based on projects, database and one coding question

Q1. 
Longest Subarray Zero Sum Problem Statement
Given an array of integers arr, determine the length of the longest contiguous subarray that sums to zero.
Input:
N (an integer, the length of the array)
arr (...read more
Ans. 
Find the length of the longest contiguous subarray that sums to zero in an array of integers.
• Use a hashmap to store the cumulative sum and its corresponding index.

• Iterate through the array, updating the sum and checking if the current sum exists in the hashmap.

• If the sum exists in the hashmap, update the maximum length of subarray with sum zero.

• Return the maximum length of subarray with sum zero.
Answered by AI
Add your answer

Round duration - 40 minutes
Round difficulty - Easy

Managerial round. Was asked questions on projects and management

Round duration - 10 minutes
Round difficulty - Easy

HR just asked about basic stuffs and all. Nothing technical