Cisco Senior Python 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
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
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

Timing: Morning
How was the environment? It happened in the Computer Lab of my institution
All students were assigned a computer and we had to solve questions on hackerrank

Q1. 
Order of People Heights Problem Statement
Consider 'N' individuals numbered from 0 to N-1 standing in a queue. You are provided with two arrays: Height and Infront, each consisting of 'N' non-negative int...read more
Ans. 
The task is to find the actual order of people in a queue based on their heights and the number of taller people in front of them.
• Iterate through the given arrays and create a list of tuples containing the height and number of taller people for each person.

• Sort the list of tuples in descending order of height and ascending order of the number of taller people.

• Create an empty result list and insert each tuple into the r...read more
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Round was a mix of concepts from OOPS, OS and Problem Solving

Q1. 
Binary Search Tree Value Finder
Given a Binary Search Tree (BST) and a key value 'X', determine if there exists a node within the BST containing the value 'X'.
Example:
Input:
Consider the tree represe...read more
Ans. 
The task is to find if a given value is present in a Binary Search Tree (BST).
• Start from the root node and compare the value with the target value.

• If the value matches, return true.

• If the target value is less than the current node value, move to the left child.

• If the target value is greater than the current node value, move to the right child.

• Repeat the process until a match is found or a leaf node is reached.

• If a leaf...read more
Answered by AI
Add your answer

Round duration - 45 minutes
Round difficulty - Medium

Timing was 12 PM. Interviewer was nice.

Q1. 
Reverse the String Problem Statement
You are given a string STR which contains alphabets, numbers, and special characters. Your task is to reverse the string.
Example:
Input:
STR = "abcde"
Output:
"e...read more
Ans. 
Reverse a given string containing alphabets, numbers, and special characters.
• Iterate through the string from end to start and append each character to a new string.

• Alternatively, use built-in functions like reverse() or slicing to reverse the string.

• Handle special characters and numbers while reversing the string.

• Ensure to consider the constraints on the length of the string and number of test cases.
Answered by AI
Add your answer
Q2. 
Move Zeros to Left Problem Statement
Your task is to rearrange a given array ARR such that all zero elements appear at the beginning, followed by non-zero elements, while maintaining the relative order of...read more
Ans. 
Rearrange an array such that all zero elements appear at the beginning, followed by non-zero elements, maintaining relative order of non-zero elements.
• Iterate through the array and maintain two pointers - one for the next position to place a zero and one for the next non-zero element.

• Swap the elements at these pointers until all zeros are moved to the left and non-zero elements are in their relative order.

• Time complexi...read more
Answered by AI
Add your answer
Q3. Write an SQL query to find the second highest salary from a table.
Ans. 
SQL query to find the second highest salary from a table
• Use the MAX() function to find the highest salary

• Use the NOT IN operator to exclude the highest salary from the results

• Order the salaries in descending order and limit the result to 1
Answered by AI
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Online test

Q1. MCQ Questions
Based on c++,c and java basics
Ans. 
MCQ questions based on C++, C, and Java basics.
• Understand the differences between C++, C, and Java syntax and features.

• Be familiar with basic concepts like data types, control structures, and functions.

• Practice solving MCQs to improve your understanding of the languages.
Answered by AI
Add your answer

Round duration - 150 Minutes
Round difficulty - Medium

Technical interview

Q1. 
Distinct Elements in K-Sized Windows
The task is to determine the number of distinct elements in every sliding window of size 'K' across an array 'ARR' of size 'N'. A 'K' sized window is a contiguous sequ...read more
Ans. 
Calculate the count of distinct elements in each sliding window of size 'K' across an array 'ARR'.
• Use a sliding window approach to iterate through the array and keep track of distinct elements using a hashmap or set.

• Update the count of distinct elements in each window as it slides across the array.

• Return the array detailing the count of distinct elements in each 'K' sized window for each test case.
Answered by AI
Add your answer
Q2. 
MergeSort Linked List Problem Statement
You are given a Singly Linked List of integers. Your task is to sort the list using the 'Merge Sort' algorithm.
Input:
The input consists of a single line contain...read more
Ans. 
Sort a Singly Linked List using Merge Sort algorithm.
• Implement the Merge Sort algorithm for linked lists.

• Divide the list into two halves, sort each half recursively, and then merge them.

• Use a fast and slow pointer to find the middle of the list for splitting.

• Handle the base cases of empty list or single node list.

• Example: Input: 4 3 2 1 -1, Output: 1 2 3 4
Answered by AI
Add your answer

Round duration - 20 minutes
Round difficulty - Hard

Hr interview

2 data struture question advancevds i cpp

Q1. 5 dsa array string
Ans. 
Implement a data structure for storing and manipulating an array of strings.
• Use a dynamic array to store the strings.

• Implement functions for adding, removing, and accessing strings in the array.

• Consider memory management and resizing the array as needed.
Answered by AI
Add your answer
Q2. Data sturucture
Add your answer

Q1. Resume based question
Add your answer

Q1. Check if the linked list is palindrome or not
Ans. 
To check if a linked list is a palindrome, compare the first half of the list with the reversed second half.
• Traverse the linked list to find the middle node

• Reverse the second half of the linked list

• Compare the first half with the reversed second half to check for palindrome
Answered by AI
Add your answer
Q2. C string questions
Add your answer

Q1. Operating systems questions
Add your answer
Q2. Linked list and system design question
Add your answer