Upload Button Icon Add office photos

Zscaler Softech

Compare button icon Compare button icon Compare

Filter interviews by

Clear (1)

Zscaler Softech Product Support Engineer Interview Questions and Answers

Updated 13 Dec 2024

Zscaler Softech Product Support Engineer Interview Experiences

1 interview found

Interview experience
5
Excellent
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Campus Placement and was interviewed in Nov 2024. There was 1 interview round.

Round 1 - One-on-one 

(2 Questions)

  • Q1. Tell me about DORA?
  • Ans. 

    DORA stands for DevOps Research and Assessment, a framework for measuring software delivery performance.

    • DORA is a research organization that focuses on improving software delivery performance.

    • They have developed a framework for measuring key metrics in DevOps practices.

    • DORA metrics include deployment frequency, lead time for changes, mean time to recover, and change failure rate.

  • Answered by AI
  • Q2. Explain DHCP and how it works?
  • Ans. 

    DHCP is a network protocol that automatically assigns IP addresses to devices on a network.

    • DHCP stands for Dynamic Host Configuration Protocol.

    • It allows devices to obtain IP addresses and other network configuration information from a DHCP server.

    • DHCP operates on the client-server model, where the client requests an IP address and the server assigns one.

    • DHCP uses a lease mechanism to control the amount of time a device...

  • Answered by AI

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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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.

  • Answered by AI
  • 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

  • Answered by AI
  • 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).

  • Answered by AI
  • 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

  • Answered by AI
  • 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.

  • Answered by AI
  • Q21. Machine Learning Concepts - Based on my projects

Interview Preparation Tips

Round: Test
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 experience
4
Good
Difficulty level
Moderate
Process Duration
-
Result
Selected Selected

I applied via Naukri.com

Round 1 - Technical 

(1 Question)

  • Q1. Technical questions that includes coding as well
Round 2 - Technical 

(1 Question)

  • Q1. Technical and Managerial discussion
Round 3 - HR 

(1 Question)

  • Q1. Salary discussion
Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. What is VTable and VPtr
  • Ans. 

    VTable is a table of function pointers used in object-oriented programming to implement polymorphism. VPtr is a pointer to the VTable.

    • VTable is used to store pointers to virtual functions in a class.

    • VPtr points to the VTable of an object to enable dynamic dispatch of virtual functions.

    • VTable and VPtr are used in C++ to implement polymorphism and dynamic binding.

  • Answered by AI

Skills evaluated in this interview

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. It was more into problem solving using python

I was interviewed before Mar 2021.

Round 1 - Technical 

(3 Questions)

  • Q1. How to check a number is power of 2
  • Ans. 

    To check if a number is a power of 2, we can use bitwise operations.

    • A power of 2 has only one bit set to 1, so we can use the bitwise AND operator to check if the number is a power of 2.

    • If n is a power of 2, then n & (n-1) will be 0.

    • For example, 8 (1000 in binary) is a power of 2, and 8 & 7 (0111 in binary) is 0.

  • Answered by AI
  • Q2. Sort a stack without using another data structure
  • Ans. 

    Sort a stack without using another data structure

    • Use recursion to pop the top element and insert it at the bottom of the remaining stack

    • Repeat until the stack is sorted in ascending order

    • Time complexity: O(n^2), space complexity: O(n) due to recursion

  • Answered by AI
  • Q3. Check weather array have continuous increasing than decreasing value
  • Ans. 

    Check if array has continuous increasing and decreasing values

    • Loop through the array and check if each element is greater than the previous one

    • Once you find the maximum element, check if the remaining elements are in decreasing order

    • If yes, return true else false

  • Answered by AI
Round 2 - Technical 

(1 Question)

  • Q1. Design a cricinfo (LLD)
  • Ans. 

    Design a cricinfo (LLD)

    • Identify the entities: players, teams, matches, scorecards, tournaments, etc.

    • Define the relationships between entities

    • Create a database schema to store the data

    • Implement APIs to fetch and update data

    • Design a UI to display the information

    • Consider scalability and performance

    • Ensure data security and privacy

  • Answered by AI
Round 3 - HR 

(3 Questions)

  • Q1. Share details of your previous job.
  • Q2. Why should we hire you?
  • Q3. What are your strengths and weaknesses?

Interview Preparation Tips

Interview preparation tips for other job seekers - Do study basic Data Structure questions and also prepare for Low level design.
Do work on behavioral questions too.

Skills evaluated in this interview

I applied via Company Website and was interviewed in May 2022. There were 2 interview rounds.

Round 1 - Aptitude Test 

Logical reasoning And aptitude test

Round 2 - Coding Test 

C++, python and Java programming

Interview Preparation Tips

Topics to prepare for Gen Software Engineer interview:
  • C++
  • Python
Interview preparation tips for other job seekers - I am interested for this company opportunity for giving me and I am so happy and giving me for work from home job
Interview experience
4
Good
Difficulty level
Moderate
Process Duration
2-4 weeks
Result
Selected Selected

I applied via Recruitment Consulltant

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Don’t add your photo or details such as gender, age, and address in your resume. These details do not add any value.
View all Resume tips
Round 2 - Technical 

(2 Questions)

  • Q1. Threading: Write and use a mutex?
  • Ans. 

    A mutex is a synchronization primitive that ensures only one thread can access a resource at a time.

    • Create a mutex object using the appropriate library or language-specific function.

    • Lock the mutex before accessing the shared resource to prevent other threads from accessing it.

    • Unlock the mutex after finishing the operation on the shared resource to allow other threads to access it.

    • Example: pthread_mutex_t mutex; pthread...

  • Answered by AI
  • Q2. Find the memory leak in a given set of code.
  • Ans. 

    Identify memory leak in code

    • Check for any dynamically allocated memory that is not being freed

    • Look for any infinite loops or recursive functions that consume memory

    • Use memory profiling tools like Valgrind to detect leaks

    • Check for any global variables that are not properly managed

  • Answered by AI

Skills evaluated in this interview

I applied via LinkedIn and was interviewed in Sep 2020. There was 1 interview round.

Interview Questionnaire 

6 Questions

  • Q1. Data structure and C++
  • Q2. Reverse Linked list
  • Q3. Multi threaded queue
  • Q4. Design pattern
  • Q5. Basic C++ concepts
  • Q6. Puzzles

Interview Preparation Tips

Interview preparation tips for other job seekers - Solve data structure problems
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all Resume tips
Round 2 - Coding Test 

Easy problem on java

Round 3 - One-on-one 

(1 Question)

  • Q1. Technical discussion

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare well on the CV details
Contribute & help others!
anonymous
You can choose to be anonymous

Zscaler Softech Interview FAQs

How many rounds are there in Zscaler Softech Product Support Engineer interview?
Zscaler Softech interview process usually has 1 rounds. The most common rounds in the Zscaler Softech interview process are One-on-one Round.
How to prepare for Zscaler Softech Product Support Engineer interview?
Go through your CV in detail and study all the technologies mentioned in your CV. Prepare at least two technologies or languages in depth if you are appearing for a technical interview at Zscaler Softech. The most common topics and skills that interviewers at Zscaler Softech expect are Technical Support, Networking, Linux, Python and DNS.

Recently Viewed

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Zscaler Softech

No Interviews

INTERVIEWS

Bluebird Corp

No Interviews

LIST OF COMPANIES

Discover companies

Find best workplace

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Grant Thornton Bharat

No Interviews

INTERVIEWS

Zscaler Softech

No Interviews

Tell us how to improve this page.

Zscaler Softech Product Support Engineer Interview Process

based on 1 interview

Interview experience

5
  
Excellent
View more

Interview Questions from Similar Companies

Globant Interview Questions
3.8
 • 172 Interviews
Chetu Interview Questions
3.3
 • 172 Interviews
Oracle Cerner Interview Questions
3.7
 • 157 Interviews
AVASOFT Interview Questions
3.6
 • 146 Interviews
ServiceNow Interview Questions
4.1
 • 120 Interviews
Thomson Reuters Interview Questions
4.1
 • 112 Interviews
Amadeus Interview Questions
3.9
 • 107 Interviews
EbixCash Limited Interview Questions
4.0
 • 101 Interviews
SPRINKLR Interview Questions
3.0
 • 100 Interviews
View all
Zscaler Softech Product Support Engineer Salary
based on 18 salaries
₹6.7 L/yr - ₹24.9 L/yr
127% more than the average Product Support Engineer Salary in India
View more details

Zscaler Softech Product Support Engineer Reviews and Ratings

based on 4 reviews

4.5/5

Rating in categories

5.0

Skill development

4.4

Work-life balance

5.0

Salary

5.0

Job security

5.0

Company culture

4.4

Promotions

4.4

Work satisfaction

Explore 4 Reviews and Ratings
Technical Account Manager
108 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Senior Software Engineer
86 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Software Engineer
83 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Associate Software Engineer
71 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Customer Success Manager
46 salaries
unlock blur

₹0 L/yr - ₹0 L/yr

Explore more salaries
Compare Zscaler Softech with

Palo Alto Networks

3.9
Compare

Gen

4.0
Compare

FireEye

4.3
Compare

Check Point Software Technologies

3.7
Compare
Did you find this page helpful?
Yes No
write
Share an Interview