AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Splunk Site Reliability Engineer Interview Questions and Answers
Splunk Site Reliability Engineer Interview Experiences
1 interview found
Anonymous
(2 Questions)
- Q1. What is Liveness probe in K8s?
- Ans.
Liveness probe in K8s is used to determine if a container is running properly by checking if it is responsive.
Liveness probes are configured in Kubernetes to periodically check the health of a container.
If the liveness probe fails, Kubernetes will restart the container.
Common liveness probe types include HTTP, TCP, and Exec probes.
Example: A HTTP liveness probe can check if a web server within a container is responding
- Q2. How we handle the infrastructure?
- Ans.
We handle the infrastructure by using automation, monitoring, and scalability.
Utilize automation tools like Terraform or Ansible to provision and manage infrastructure.
Implement monitoring solutions like Prometheus or Grafana to track system performance and health.
Design infrastructure to be scalable and resilient to handle varying workloads.
Regularly review and update infrastructure to ensure security and efficiency.
C...
Skills evaluated in this interview
Interview questions from similar companies
Interview Questionnaire
21 Questions
- Q1. AVL tree balance checking
- Q2. Median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
- Ans.
Find median of 2 sorted arrays in O(log N) time complexity and O(1) space complexity
Use binary search to find the partition point in both arrays
Calculate the median based on the partition point and array sizes
Adjust the partition points based on the median value
Repeat until the partition points are at the median
Handle edge cases such as empty arrays and uneven array sizes
- Q3. Strings Anagram in O(1) space complexity
- Ans.
Anagram of strings in O(1) space complexity
Use a fixed size array of integers to store the frequency of characters in the first string
Iterate through the second string and decrement the frequency of each character in the array
If all the frequencies are zero, then the strings are anagrams
Return true or false accordingly
- Q4. Level order traversal of a tree using Queue
- Ans.
Level order traversal of a tree using Queue
Create a queue and add the root node to it
While the queue is not empty, remove the front node and print its value
Add the left and right child nodes of the removed node to the queue
Repeat until the queue is empty
- Q5. Reverse level order traversal of a tree using Queue
- Ans.
Reverse level order traversal of a tree using Queue
Create a queue and push the root node into it
While the queue is not empty, pop the front node and push its children into the queue
Add the popped node to a stack
Once the queue is empty, pop elements from the stack and print them
- Q6. BFS and DFS Difference
- Ans.
BFS and DFS are graph traversal algorithms. BFS explores nodes level by level while DFS explores nodes depth by depth.
BFS uses a queue while DFS uses a stack or recursion.
BFS is optimal for finding shortest path while DFS is optimal for finding a path between two nodes.
BFS requires more memory as it stores all the nodes at each level while DFS requires less memory.
BFS can be used to find connected components while DFS
- Q7. OS Concepts – Starvation, Demand Paging, Virtual Memory, Deadlocks
- Q8. Parenthesis Balance Checking
- Q9. Three Jars - 1 with apples, 1 with oranges, 1 with apples and oranges. All of them wrongly labelled. Find min no of attempts to find the correct nature of boxes
- Q10. Find product of each element of an array except that element in O(N) time complexity without using / operation
- Ans.
Find product of each element of an array except that element in O(N) time complexity without using / operation
Use prefix and suffix products
Multiply prefix and suffix products for each element to get the final product
Handle edge cases where array has 0 or 1 element separately
- Q11. Recursively deleting linked list
- Ans.
Recursively delete a linked list
Create a recursive function that takes the head of the linked list as input
Base case: if the head is null, return
Recursively call the function with the next node as input
Delete the current node
- Q12. Recursively deleting linked list from end
- Ans.
Recursively delete a linked list from the end.
Start from the head and recursively traverse to the end of the list.
Delete the last node and set the second last node's next pointer to null.
Repeat until the entire list is deleted.
Use a recursive function to implement the deletion process.
- Q13. Recursively deleting tree
- Ans.
Recursively delete a tree by deleting all its child nodes and then the parent node.
Start from the leaf nodes and delete them first.
Then move up to the parent nodes and delete them.
Repeat until the root node is deleted.
Use post-order traversal to ensure child nodes are deleted before parent nodes.
- Q14. Recursively deleting from end
- Ans.
Recursively delete elements from the end of an array.
Create a recursive function that removes the last element of the array.
Call the function recursively until the desired number of elements are removed.
Handle edge cases such as empty arrays and removing more elements than the array contains.
- Q15. Difference between Floyd Warshall and Djikstra
- Ans.
Floyd Warshall finds shortest path between all pairs of vertices while Djikstra finds shortest path from a single source.
Floyd Warshall is used for dense graphs while Djikstra is used for sparse graphs.
Floyd Warshall has a time complexity of O(n^3) while Djikstra has a time complexity of O((n+m)logn).
Floyd Warshall can handle negative edge weights while Djikstra cannot.
Floyd Warshall can detect negative cycles while Dj
- Q16. Shortest path between 2 points in 2-D space in O(log N) time
- Ans.
There is no known algorithm to find shortest path in 2-D space in O(log N) time.
The best known algorithm for finding shortest path in 2-D space is Dijkstra's algorithm which has a time complexity of O(N^2).
Other algorithms like A* and Bellman-Ford have better time complexity but still not O(log N).
If the points are on a grid, Lee algorithm can be used which has a time complexity of O(N).
- Q17. Design a system for putting newspapers using classes and functions taking different aspects into account
- Ans.
Design a system for putting newspapers using classes and functions
Create a Newspaper class with attributes like title, date, and content
Create a Publisher class with methods to publish and distribute newspapers
Create a Subscriber class with methods to subscribe and receive newspapers
Use inheritance to create different types of newspapers like daily, weekly, etc.
Implement a database to store newspaper information and ha
- Q18. SQL commands
- Q19. Career Prospects - Long Term Plans
- Q20. Why not higher studies?
- Ans.
I believe practical experience is more valuable than higher studies.
I have gained valuable experience through internships and projects.
I prefer hands-on learning and problem-solving over theoretical knowledge.
I am constantly learning and improving my skills through online courses and workshops.
- Q21. Machine Learning Concepts - Based on my projects
Interview Preparation Tips
Experience: All Computer Science Topics Covered: Data Structures, Algorithms, Object Oriented Systems, C, C++, Operating Systems, Computer Architectures, Databases, SQL, Basic Quantitative Aptitude
Tips: Solve all of them. Cut off's generally go high.
Duration: 30 minutes
Total Questions: 30
Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.
Round: Interview
Experience: Nice Experience. Interviewer was friendly. He wanted exact solutions.
Tips: Be thorough with everything and your projects.
Round: Interview
Experience: Nice Experience. Interviewer was friendly.
Tips: Do not fake yourself.
General Tips: Be thorough with all CS related concepts and projects.
Skill Tips: ""Be thorough.""
Skills: Algorithms, Data Structures, Operating Systems, Machine Learning, SQL, Operating Systems, Computer Architecture, Data Analytics
College Name: IIT Kharagpur
Motivation: Kind of application oriented work and the rising nature of the company. Obviously money also.
Funny Moments: Many funny questions and answers like did you have lunch, when did you last eat, etc
Skills evaluated in this interview
Interview Preparation Tips
College Name: NIT SURATHKAL
Interview Questionnaire
8 Questions
- Q1. WRITE A GENERIC SWAP FUNCTION
- Ans.
A generic swap function swaps two values of any data type.
The function should take two parameters of any data type.
Use a temporary variable to store the value of one parameter.
Assign the value of the second parameter to the first parameter.
Assign the value of the temporary variable to the second parameter.
- Q2. SEARCH AN ELEMENT IN ROTATED SORTED LINKLIST .
- Ans.
Search for an element in a rotated sorted linked list.
Find the pivot point where the list is rotated.
Divide the list into two sublists based on the pivot point.
Perform binary search on the appropriate sublist.
Handle edge cases such as empty list and list with only one element.
- Q3. SEARCH AN ELEMENT IN ROTATED SORTED ARRAY. WRITED A CODE FOR IT
- Ans.
Search an element in a rotated sorted array
Find the pivot point where the array is rotated
Divide the array into two sub-arrays based on pivot point
Perform binary search on the appropriate sub-array
Repeat until element is found or sub-array size is 1
- Q4. In an Array of size 95 contain numbers in range 1 to 100. each number is at max once in the array. find the 5 missing numbers in array between 1-100
- Ans.
Find 5 missing numbers in an array of size 95 containing numbers in range 1 to 100.
Create a boolean array of size 100 and mark the present numbers
Iterate through the boolean array and find the missing numbers
Alternatively, use a HashSet to store the present numbers and find the missing ones
- Q5. Given sudoku as id array of size . in a given empty cell find the possible numbers that could be possible. Asked me to write code for it
- Ans.
Given a Sudoku board, find possible numbers for an empty cell.
Iterate through empty cells and check possible numbers using row, column, and box constraints.
Use a set to keep track of possible numbers for each empty cell.
Return the set of possible numbers for the given empty cell.
- Q6. Given 4 unsigned integers find their integer average (eg. (2,2,2,3) => (2+2+2+3)/4 = 2) consider integer division ) without typecasting
- Ans.
Find integer average of 4 unsigned integers without typecasting
Add all the integers and divide by 4
Use bit shifting to divide by 4
Handle overflow by using long long data type
Use unsigned int data type for input
- Q7. Write a code to identify wheter given processor is of 32 bit architecture or 64 bit architecture
- Ans.
Code to identify 32 bit or 64 bit architecture of a processor
Check if the operating system is 32 bit or 64 bit
If OS is 32 bit, processor is 32 bit
If OS is 64 bit, check if processor supports 64 bit architecture
Use CPUID instruction to check if processor supports 64 bit architecture
- Q8. Convert a binary number into base 64 integer
- Ans.
Convert binary number to base 64 integer
Divide the binary number into groups of 6 bits
Convert each group of 6 bits to decimal
Map the decimal value to the corresponding base 64 character
Concatenate the base 64 characters to form the final integer
Interview Preparation Tips
Experience: SIMPLE CODING QUESTIONS SPEED MATTERS.
Duration: 60 minutes
Total Questions: 3
Skills: Analytics And Coding
College Name: IIT Guwahati
Skills evaluated in this interview
Interview Questionnaire
6 Questions
- Q1. Solving puzzles(25 horses,ant and sweets,height of a building..) try as many as possible before appearing for interview
- Q2. If experienced , then project details of previous companies a must prepare question
- Q3. Writing test cases for random scenarios
- Q4. Programming in whatsoever language you r comfortable with, basic coding problems of DS,Algos. eg. Zigzag tree traversal algo,random linked list copy
- Q5. Some people asked me questions related to the work i will do if hired in the project
- Q6. Be genuine in ur CV, and be prepared with everything you write there.
Interview Preparation Tips
I appeared for an interview before Mar 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on DSA and OOPS.
- Q1. How do you dynamically allocate a 2D array in C?
- Ans.
Use double pointer to dynamically allocate memory for array of strings in C.
Declare a double pointer to hold the 2D array of strings.
Allocate memory for the rows first using malloc.
Then allocate memory for each string in the row using malloc.
Assign values to the strings in the array.
Example: char **array = malloc(rows * sizeof(char *));
Example: array[i] = malloc(strlen(str) + 1); strcpy(array[i], str);
- Q2. What are virtual functions in C++?
- Ans.
Virtual functions in C++ are functions that can be overridden in derived classes, allowing for polymorphic behavior.
Virtual functions are declared using the 'virtual' keyword in the base class.
They are used to achieve runtime polymorphism in C++.
Derived classes can override the virtual functions defined in the base class.
Example: class Base { public: virtual void display() { cout << 'Base class dis...
- Q3. What are virtual base classes?
- Ans.
Virtual base classes are classes that are inherited virtually to avoid multiple instances of the same base class in a derived class hierarchy.
Virtual base classes are used in multiple inheritance to prevent the Diamond Problem.
They are declared with the 'virtual' keyword in the base class.
When a class inherits a virtual base class, the most derived class is responsible for initializing the virtual base class.
Example: c...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on OS/Networking etc.
- Q1. What is the system call that creates a separate connection?
- Ans.
The system call that creates a separate connection is fork()
fork() is a system call in Unix-like operating systems that creates a new process by duplicating the existing process
The new process created by fork() is called the child process, while the original process is called the parent process
fork() is commonly used in network programming to create separate connections for handling multiple clients
- Q2. What does the epoll_wait() system call do?
- Ans.
epoll_wait() system call waits for events on an epoll instance
Used in Linux for I/O event notification
Blocks until one or more file descriptors become ready
Returns the number of file descriptors ready for I/O operations
- Q3. What are the different protocols used in the transport layer?
- Ans.
Different protocols used in the transport layer include TCP, UDP, SCTP, and DCCP.
TCP (Transmission Control Protocol) - reliable, connection-oriented protocol used for most internet communication
UDP (User Datagram Protocol) - connectionless protocol used for applications where speed is more important than reliability
SCTP (Stream Control Transmission Protocol) - supports multiple streams of data, used for telecommunicati...
- Q4. What is the difference between TCP and UDP?
- Ans.
TCP is a connection-oriented protocol that ensures reliable data delivery, while UDP is a connectionless protocol that focuses on speed.
TCP is reliable and ensures data delivery by establishing a connection before sending data.
UDP is faster but less reliable as it does not establish a connection before sending data.
TCP is used for applications that require high reliability and error correction, such as web browsing and...
(4 Questions)
Round duration - 60 minutes
Round difficulty - Easy
Technical interview round with questions based on Networking etc.
- Q1. What is the purpose of ICMP?
- Ans.
ICMP is a protocol used for error reporting, diagnostics, and network management in IP networks.
ICMP is used to report errors in packet delivery
It is used for network diagnostics and troubleshooting
ICMP messages are encapsulated within IP packets
Examples include ping (echo request/reply) and traceroute
- Q2. What are the types of connection release supported by TCP?
- Ans.
TCP supports four types of connection release: active close, passive close, simultaneous close, and abortive close.
Active close: Client initiates the connection release process by sending a FIN packet.
Passive close: Server initiates the connection release process by sending a FIN packet.
Simultaneous close: Both client and server send FIN packets to each other simultaneously.
Abortive close: Connection is terminated abru...
- Q3. What protocols are used by the MAC layer?
- Ans.
The MAC layer uses protocols like CSMA/CA, CSMA/CD, and TDMA to manage access to the network.
CSMA/CA (Carrier Sense Multiple Access with Collision Avoidance) is used in wireless networks to avoid collisions.
CSMA/CD (Carrier Sense Multiple Access with Collision Detection) is used in wired networks to detect and handle collisions.
TDMA (Time Division Multiple Access) is used in networks where devices are assigned specific
- Q4. What is the ARP protocol?
- Ans.
ARP (Address Resolution Protocol) is a protocol used to map an IP address to a MAC address in a local network.
ARP is used to resolve IP addresses to MAC addresses in a local network.
It operates at the data link layer of the OSI model.
ARP requests are broadcasted to all devices on the network.
Example: When a device wants to communicate with another device on the same network, it uses ARP to find the MAC address correspo
Interview Preparation Tips
Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.
Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.
Skills evaluated in this interview
I applied via Referral
Interview Preparation Tips
Experience: I appeared for Amdocs through Campus Recruitment Process. Section 1,2,3 was not tough, if you have practiced RD Sharma then don't worry about these sections as it was the easiest part of the written test. After that there were two coding questions in which you can choose any language(C/C++/Java) to write your code. The code were easy, I mean it wasn't like Codechef problems. If you have ever made the programming assignments by yourself then you would definitely be able to crack this section. Even if you didn't make it then you can practice coding questions like finding H.C.F, L.C.M, Removing redundant number from array, finding whether the string is palindrome or not, finding whether the number is Armstrong number or not,etc,. Now comes the technical section that was little bit tough for those who haven't studied about UNIX ever. It was consisting of C, DBMS and Unix. C questions can easily be attempt by completing "Test your C Skills by Yashwant Kanedtkar", In DBMS most of the questions were query based, some PL/SQL questions were also there, in Unix most of the questions were from VI editor commands and some linux commands like sed, uniq, fdisk and very few questions were from shell scripting like, what will be the output of echo*. Overall the test was easy, since it is easy for everyone so you need to do lots of practice because out of more than 200 students only 39 cleared the written test in our campus.
Duration: 2:30 minutes
Total Questions: 82
Skills: Implementation Of Code Using OOPS, Coding Skills, Database Management, Ability To Think, Ability To Cope Up With Stress, Ability To Deal Diplomatically, 1)communication
College Name: NIT Sikkim
I appeared for an interview before May 2016.
Interview Preparation Tips
Experience: First section had questions on object oriented programming concepts and some basic questions related to c++
In the second section tables were given and we were asked to write the queries for the given questions.
Duration: 1 hour
Total Questions: 20
College Name: IIITDM Jabalpur
Interview Preparation Tips
Experience: I had a standard resume for this company as per the norms of our institute’s placement cell. For Oracle I laid emphasis on my programming skills and projects related to it.
Round: Test
Experience: The first round was the written test that comprised of 5 sections – vocabulary, aptitude, pattern matching, logical reasoning and programming. The questions in the programming section were asked from data structures and C++. The questions in the programming section were mainly from trees (from data structures). Around 400 students appeared for their written test out of which around 100 were shortlisted.
Round: HR Interview
Experience: The next round was the interview round. They gave me some puzzles to solve and a program to write. One of the puzzles that I remember was that if I were to be given an egg then how would I determine its durability, i.e. how would I determine that from which floor do I need to throw the egg from so that the egg does not break if thrown from any floor below it.
For the coding question I was given a mathematical formula and I was asked to devise a code such that the program uses the formula and gives the output.
Tips: Prepare for Data Structures as well as the commonly asked puzzles for Oracle.
College Name: IIT ROORKEE
Motivation: Oracle is a reputed company in the space of software and ITeS. It had come to our campus with five profiles. The best means to know about all of them is to attend the pre-placement talk of the company.
I applied via Referral and was interviewed before Jan 2020. There were 3 interview rounds.
Interview Questionnaire
1 Question
- Q1. About project
Interview Preparation Tips
2nd round Interview in Company
Just pray you are not last person to be interviewed from your group(if last you are already rejected)
Splunk Interview FAQs
Tell us how to improve this page.
Splunk Interviews By Designations
- Splunk Senior Software Engineer Interview Questions
- Splunk Softwaretest Engineer Interview Questions
- Splunk Software Engineer Interview Questions
- Splunk Site Reliability Engineer Interview Questions
- Splunk Escalation Manager Interview Questions
- Splunk Team Manager Interview Questions
- Splunk Senior Salesforce Developer Interview Questions
- Splunk Summer Intern Interview Questions
- Show more
Interview Questions for Popular Designations
- Senior Site Reliability Engineer Interview Questions
- Site Reliability Engineer 2 Interview Questions
- DevOps Site Reliability Engineer Interview Questions
- Service Reliability Engineer Interview Questions
- System Reliability Engineer Interview Questions
- Site Reliability Engineer Lead Interview Questions
- Reliability and Failure Analysis Engineer Interview Questions
- Software Engineer and Site Reliability Engineer Interview Questions
- Show more
Splunk Site Reliability Engineer Interview Process
based on 1 interview
Interview experience
Site Reliability Engineer Interview Questions from Similar Companies
|
Software Engineer
7
salaries
|  ₹25 L/yr - ₹33 L/yr |
|
Senior Software Engineer
6
salaries
| ₹30 L/yr - ₹98.5 L/yr |
|
Engineering Manager
6
salaries
| ₹40 L/yr - ₹60 L/yr |
|
Data Scientist
5
salaries
| ₹15.5 L/yr - ₹33.5 L/yr |
|
Machine Learning Engineer
4
salaries
| ₹15.5 L/yr - ₹33 L/yr |
Oracle
Amdocs
Automatic Data Processing (ADP)
24/7 Customer
- Home >
- Interviews >
- Splunk Interview Questions >
- Splunk Site Reliability Engineer Interview Questions
