Palo Alto Networks Associate Interview Questions and Answers

Was asked to understand a project in python and translate it to NodeJS. This had to be done during the interview with you explaining you thought process through every step.

Coding string related programming

Hacker rank data structure linked list

Q1. System design high level
Add your answer

Hacker rank data structure trees

Basics of C, pointer arithmetic, some output prediction mainly focused on pre and post increment operators, write code to print the character with most occurance in a string with count.

Q1. Data structures and algorithms, files, sockets, synchronous/asynchronous operations, multithreading concepts, synchronization primitives, memory management, VoIP basics, SIP callflow, SIP registration, sub...read more
Add your answer

Hacker rank codinv problems level medium

Q1. Coding round again D and S
Add your answer

Q1. System design tech dummies
Add your answer

Q1. Common questions , why we should hire you , achievements
Add your answer

Q1. Reverse linked list using the recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q2. Find max number in the linked list using stack.
Ans. 
To find max number in linked list using stack.
• Create an empty stack.

• Traverse the linked list and push each element onto the stack.

• Pop elements from the stack and compare with max value.

• Return the max value.
Answered by AI
Add your answer

Aptitude relates questions... It was modratley difficult

Q1. Twchnical rouns. Qas easy... Asked questions oc C and some. Projects
Add your answer
Q2. Reverse linked list using recursion
Ans. 
Reverse a linked list using recursion
• Create a recursive function that takes the head of the linked list as input

• Base case: if the head is null or the next node is null, return the head

• Recursively call the function with the next node as input

• Set the next node's next pointer to the current node

• Set the current node's next pointer to null

• Return the new head of the reversed linked list
Answered by AI
Add your answer
Q3. What is difference between mutex semaphore?
Ans. 
Mutex is a locking mechanism to ensure exclusive access to a shared resource, while semaphore is a signaling mechanism to control access to a shared resource.
• Mutex allows only one thread to access the shared resource at a time, while semaphore can allow multiple threads to access the shared resource simultaneously.

• Mutex is binary, meaning it has only two states - locked and unlocked, while semaphore can have multiple s...read more
Answered by AI
Add your answer

Checked general aptitude

Multiple coding rounds each tougher than the last

Q1. Mostly related to Python and Kubernetes
Add your answer

Q1. Mostly related to salaries
Add your answer

Date&time, train, distance

One real world problem was given, i have to prepare a ppt for feasible solution about that given problem

Q1. Tell me about yourself question related to ppt networking quesiton some DBMS question 2 dsa question some scenario based question related to job profile
Add your answer