AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Workspot Interview Questions and Answers
Workspot Interview Experiences
1 interview found
Anonymous
Selected
I applied via Referral and was interviewed before May 2022. There were 4 interview rounds.
Senior Support Analyst Interview Questions asked at other Companies
Top trending discussions
Interview questions from similar companies
Interview Questionnaire
20 Questions
- Q1. He asked me my specialization?
- Q2. Why not further studies? (He had noted that I was third in my batch. He appeared impressed by that
- Q3. He asked me to tell him about my favorite project
- Q4. He then looked at my grades. He commented that my lowest grade – B- was in Digital Image Processing. I just looked at him like a doofus thinking of what to say. But he quickly added, ‘don’t worry, it happe...
- Q5. He then asked me a question that had been asked in Round 4, written test:Describe an optimal algorithm to find the second minimum number in an array of numbers. What is the exact number of comparisons requ...
- Q6. Given a polygon (could be regular, irregular, convex, concave), find out whether a particular point lies inside it or outside it
- Ans.
To determine if a point is inside a polygon, use the ray casting algorithm.
Create a line from the point to a point outside the polygon
Count the number of times the line intersects with the polygon edges
If the count is odd, the point is inside the polygon; otherwise, it is outside
- Q7. He asked me to explain Canny’s algorithm to him. (this was because my DIP project was related to this)
- Q8. Then, he gave me a practical problem to solve: Suppose you are given an image which contains some text and some photos. How do you find the location of the image?
- Q9. Which are the four storage classes in C
- Ans.
The four storage classes in C are auto, register, static, and extern.
Auto: default storage class for all local variables
Register: used to define local variables that should be stored in a register instead of RAM
Static: used to define local variables that retain their value between function calls
Extern: used to declare a global variable that is defined in another file
- Q10. Given a program: int i; int main() { int j; int *k = (int *) malloc (sizeof(int)); … } Where are each of these variables stored?
- Ans.
i is stored in global data segment, j is stored in stack, k is stored in heap.
i is a global variable and is stored in the global data segment
j is a local variable and is stored in the stack
k is a pointer variable and is stored in the stack, while the memory it points to is allocated on the heap using malloc()
- Q11. Question on polymorphisms
- Q12. He again went back to the first question he had asked me. Once again
- Q13. Then he wrote out some code and asked me how the compiler will generate code for it. I gave some answer, but he was clearly not satisfied. I thought it was all over by then. Then, he asked me a DIP quest...
- Q14. Given a set of words one after another, give me a data structure so that you’ll know whether a word has appeared already or not
- Ans.
Use a hash table to store the words and check for existence in constant time.
Create a hash table with the words as keys and a boolean value as the value.
For each new word, check if it exists in the hash table. If it does, it has appeared before. If not, add it to the hash table.
Alternatively, use a set data structure to store only the unique words and check for existence in the set.
- Q15. He asked me some questions on Interprocess Communication: What’s a semaphore? How are they used? He would often pick out words from my answers and ask me what they meant. He wanted to make sure that I rea...
- Q16. He then asked me some DB fundas. Transaction. Serializability, Consistent state, etc
- Q17. Finally, he asked me whether I had any questions
- Q18. There is a clock at the bottom of the hill and a clock at the top of the hill. The clock at the bottom of the hill works fine but the clock at the top doesn’t. How will you synchronize the two clocks. Obv...
- Q19. There was one more puzzle.. I don’t remember it. but I do remember that we started discussing ways of generating large prime numbers
- Q20. We also talked a bit about my phone browser project
Interview Preparation Tips
Duration: 15 minutes
Total Questions: 1
Round: Test
Duration: 30 minutes
Total Questions: 2
Round: Test
Duration: 30 minutes
Total Questions: 3
Round: Test
Total Questions: 4
Round: Technical Interview
Experience: 1.When I told him that I had none as I didn’t want to specialize in this stage, he was a little surprised but appeared satisfied with my reason.2.I told him that my profile clearly indicated that I’ve been trying to get into the industry via internships, industry-funded projects right from second year, second sem. I said that I was fully sure that I didn’t want to do MS anytime soon.3.I told him about the web-browser that I had developed for cell-phones. I thought that was the only project which was closest to what Adobe was working on. He appeared satisfied with my answers.4. So people, be fully prepared to explain any anomalous grades. I was prepared with the explanation of the W in the my grade-sheet but not of the B- in DIP. I know that this is really stupid considering that I was interviewing with Adobe. Don’t make this mistake.5.I screwed up, big time in this question. I had superficially discussed this question with my friend a while ago and he had outlined an algorithm which I thought that I had understood, but I hadn’t. I started off explaining it but got stuck in the middle. He sternly told me to read it up again. One solution that I could tell him, and which I had written in the test was this Use two variables – min and second min. Initialize them by comparing the first two elements of the array. This is (1) comparison. Then, go through the entire array, from index 2 to n-1 comparing each element, first with min and then with second min, updating each variable as necessary. This will involve a worst case of two comparisons for each element. Therefore, total number of comparisons = 2*(n-2) + 1 = 2*n – 3 comparisons.I’ll try to update this with a better solution, sometime soon.6.This is an easy, straight question from graphics. You shoot a ray parallel to the x-axis passing through this point. Start with odd parity. Change parity of ray each time it intersects an edge of the polygon (consider special case of when the line passes through a vertex of the polygon. Change parity only if it passes through a vertex which has one edge above it and one edge below the ray). If the parity of ray is even when it passes through the point, it is inside the polygon, else it is not.7.This is simple. Study DIP8.I gave various alternatives – from searching for RGB components, to using OCR.. he didn’t appear fully satisfied. I think he was looking for edge-detection, but that would fail, if the text contained tables, etc.
Round: Technical Interview
Experience: He was friendly at the start but this interview was my worst. He asked me my favorite subject. I said that it was Programming. (He laughed at that)
1. static, extern, register, auto2.I started off correctly, but he was able to confuse me. He brought in shared libraries, static libraries fundas into the discussion. We had a discussion for about twenty-minutes on this. Finally, he was happy with one of my answers because I had deduced which policy made sense and answered correctly. He said that out of all the people interviewed so far (I was second last), nobody had been able to answer all of these questions correctly.3.this is easy – get it from any C++ book. He tried to confuse me again, but this time I was ready and he was finally satisfied.Then he looked at my grades and said that out of all your grades, you have only two Bs and one of them is in Compilers. Why? (Damn it. three non-A grades and that’s all they ask about. What’s wrong with this world?!)Didn’t you like Compilers? “Not in particular”, I replied. “Fine. Now, I HAVE to ask you questions on compilers”, he said.4.He again went back to the first question he had asked me. Once again5.I first suggested that we capture only a small portion of the board. To locate that portion, we could search for the chalk in the prof’s hand – of course, taking care that it had the blackboard in the background (no point capturing a video of the prof scratching his chin, na?). Further, if the prof was writing only text, we could convert the video into text by OCR and then transmitting. Simple diagrams could also be reduced to a set of vector-graphics instructions (we rarely, see the prof shading stuff). I think he liked my approach, but was not completely satisfied. Anyway, we left it at that and went forward.6.I suggested various alternatives. but he kept helping me and finally, we came up with an array of pointers to 26-trees (each node of the tree has 26 children). Store every word as a path from the root to a leaf with pointers in the correct places. For example, hello would be stored as – pointer from ‘h’ index of the root array to a node which had a pointer from ‘e’ index of it’s array to a node which had a pointer from ‘l’ index of the array.. and so on. This is both time and space efficient.7.I was able to answer all his questions, but I made the mistake of telling him, when we started off that I didn’t know much about this subject as I had done it a long time ago. He was very annoyed at that, apparently because a lot of people before me had said this.8.I was able to answer all of them. I stumbled around a bit in a few questions where I was explaining correctly, but not using the keywords that he was looking for.9.I thought that I should say something to make him realize that I was not completely stupid and so asked him whether there was any logic to the order in which the short-listed candidates were called. This turned out to be a dumb move. The order was alphabetic and he sent me off with a parting shot, saying “You guys do pattern recognition and stuff and still you can’t recognize such a simple pattern” Me and my big mouth! Moral of the story: Don’t ask questions for the sake of asking.
Round: Puzzle Interview
Experience: After the first two interviews, this one was like having a warm batch after being cold and wet for days! I did well in this one.1.You have to go up the hill and come back, with horse, without horse, getting four equations to solve four unknowns – time to go uphill – with horse, without horse, time to go downhill – with horse, without horse. Then you can go up the hill and set the clock to ‘(time when you left) + (time to go uphill with horse)’2. I told him the funda of Mersenee primes (luckily remembered it) and he was decently impressed.
General Tips: Finally hired by Adobe. Special thanks to AmbitionBox team. Really amazing site for sharing experience. That’s all for the Adobe. They are focusing on your approach and your coding skills. All the best.
Skills: Algorithm, Data structure, C++, C, DIP
College Name: BIT Mesra
Skills evaluated in this interview
I appeared for an interview before Jan 2021.
(2 Questions)
Round duration - 60 Minutes
Round difficulty - Medium
The interviewer asked me 2 questions related to DS/Algo in this round . Both the questions were of Easy-Medium difficulty and I was also required to code them in a production ready manner.
- Q1.
Maximum Sum Path in a Binary Tree Problem Statement
You are provided with a binary tree consisting of
Nnodes where each node has an integer value. The task is to determine the maximum sum achievable by a... - Ans.
Find the maximum sum achievable by a simple path between any two nodes in a binary tree.
Traverse the binary tree to find all possible paths and calculate their sums.
Keep track of the maximum sum encountered during traversal.
Consider paths that may include the same node twice.
Implement a recursive function to explore all possible paths.
Handle cases where nodes have negative values.
- Q2.
Intersection of Two Arrays Problem Statement
Given two arrays
AandBwith sizesNandMrespectively, both sorted in non-decreasing order, determine their intersection.The intersection of two arrays in...
- Ans.
The problem involves finding the intersection of two sorted arrays efficiently.
Use two pointers to iterate through both arrays simultaneously.
Compare elements at the pointers and move the pointers accordingly.
Handle cases where elements are equal, and update the intersection array.
Return the intersection array as the result.
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DS/Algo to solve under 50 minutes and one question related to Operating Systems.
- Q1.
Next Greater Element Problem Statement
You are provided with an array or list
ARRcontainingNpositive integers. Your task is to determine the Next Greater Element (NGE) for each element in the array.T...
- Ans.
Find the Next Greater Element for each element in an array.
Iterate through the array from right to left
Use a stack to keep track of elements with no greater element to the right
Pop elements from the stack until finding a greater element or stack is empty
- Q2.
Number In Arithmetic Progression Problem
Given three integers
X,C, andY, whereXis the first term of an arithmetic sequence with a common difference ofC, determine ifYis part of this arithmetic sequ... - Ans.
Check if a given number is part of an arithmetic sequence with a given first term and common difference.
Calculate the arithmetic sequence using the formula: nth term = X + (n-1) * C
Check if Y is equal to any term in the sequence to determine if it belongs to the sequence
Return 'True' if Y belongs to the sequence, otherwise return 'False'
- Q3. Can you define process and threads in operating systems?
- Ans.
Processes are instances of programs in execution, while threads are smaller units within a process that can execute independently.
A process is a program in execution, consisting of code, data, and resources.
Threads are smaller units within a process that can execute independently.
Processes have their own memory space, while threads share the same memory space within a process.
Processes are heavyweight, while threads ar...
(3 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round had 2 questions of DSA of Easy-Medium difficulty and at the end I was asked a Puzzle to check my general problem solving ability.
- Q1.
Max Product Subset Problem Statement
Given an array/list
arrof sizen, determine the maximum product possible by taking any subset of the array/listarr. Return the result modulo10^9+7since the product ... - Ans.
Find the maximum product of a subset of an array modulo 10^9+7.
Iterate through the array and keep track of the maximum positive product and minimum negative product encountered so far.
Handle cases where the array contains zeros separately.
Return the maximum product modulo 10^9+7.
- Q2.
Populating Next Right Pointers in Each Node
Given a complete binary tree with 'N' nodes, your task is to determine the 'next' node immediately to the right in level order for each node in the given tree.
... - Ans.
Implement a function to update 'next' pointers in a complete binary tree.
Iterate level by level using a queue
Connect nodes at each level using 'next' pointers
Handle null nodes appropriately
Ensure the tree is a complete binary tree
- Q3. You have two wires of different lengths that are both capable of burning for exactly one hour when ignited at both ends. How can you measure a time interval of 45 minutes using these two wires?
(2 Questions)
Round duration - 50 Minutes
Round difficulty - Medium
This round consisted of 2 questions from DSA where I was first asked to explain my approach to the interviewer with proper complexity analysis and then code the problems. The interviewer was quite friendly and also provided me some hints when I was stuck.
- Q1.
Stack with getMin Operation
Create a stack data structure that supports not only the usual push and pop operations but also getMin(), which retrieves the minimum element, all in O(1) time complexity witho...
- Ans.
Implement a stack with push, pop, top, isEmpty, and getMin operations in O(1) time complexity without using extra space.
Use two stacks - one to store the actual elements and another to store the minimum element at each level.
When pushing an element, check if it is smaller than the current minimum and update the minimum stack accordingly.
When popping an element, also pop from the minimum stack if the popped element is t...
- Q2.
Split Array Into Maximum Subarrays Problem Statement
You are given an integer array
arrof sizeN. Your task is to split the array into the maximum number of subarrays such that the first and last occurre... - Ans.
Given an array, split it into maximum subarrays with first and last occurrence of each element in a single subarray.
Iterate through the array and keep track of the first and last occurrence of each element.
Use a hashmap to store the indices of each element.
Split the array whenever the last occurrence of an element is found.
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
Interview Questionnaire
12 Questions
- Q1. Given a binary tree and an integer x, return whether the binary tree has a path from root to a leaf whose values sum to x
- Q2. Gievn a binary tree and return all root to leaf node pathss row,col and value
- Ans.
Return all root to leaf node paths in a binary tree with row, col and value.
Traverse the binary tree recursively and keep track of the current path.
When a leaf node is reached, add the path to the result array.
Include row, col and value of each node in the path.
Use an array of strings to store the paths.
- Q3. He then asked me to give test cases for testing this program
- Q4. Given two unsorted arrays of numbers and asked me to find the intersection
- Q5. GetMax() function for a stack in O(1)
- Ans.
To get max value from a stack in O(1), maintain a separate stack to keep track of maximum values.
Create a separate stack to keep track of maximum values
Push the maximum value onto the stack whenever a new maximum is encountered
Pop the maximum value stack whenever the top element of the main stack is popped
Return the top element of the maximum value stack to get the maximum value in O(1)
- Q6. GetMax() function for a queue in O(1)
- Ans.
To get max element from a queue in O(1) time complexity
Maintain a separate variable to keep track of the maximum element in the queue
Update the maximum element variable whenever a new element is added or removed from the queue
Return the maximum element variable when getMax() function is called
- Q7. Given an array in which consecutive elements differ by 1, i.e. a[i] – a[i + 1] = 1 or -1, and an element x, find the element in the array
- Q8. Given an array, find the Next Greatest Element to the right for each element
- Ans.
Find the Next Greatest Element to the right for each element in an array of strings.
Iterate through the array from right to left
Use a stack to keep track of elements
Pop elements from stack until a greater element is found
If no greater element is found, assign -1
Return the result array
- Q9. Given an expression, remove unnecessary parenthesis. For example if (((a + b)) * c) is given make it (a + b) * c, as it evaluates in the same way without those parenthesis also
- Ans.
To remove unnecessary parenthesis from an expression, we need to apply a set of rules to identify and eliminate them.
Identify and remove parenthesis around single variables or constants
Identify and remove parenthesis around expressions with only one operator
Identify and remove parenthesis around expressions with operators of equal precedence
Identify and remove parenthesis around expressions with operators of different ...
- Q10. Given an array of integers, find the maximum product which can be formed by three numbers
- Ans.
Find the maximum product of three integers in an array.
Sort the array in descending order.
Check the product of the first three numbers and the product of the first and last two numbers.
Return the maximum of the two products.
- Q11. Given an array of integers, find the length of the longest consecutive sub array which forms an AP
- Ans.
Find length of longest consecutive sub array forming an AP from given array of integers.
Sort the array in ascending order
Iterate through the array and find the longest consecutive sub array forming an AP
Use a variable to keep track of the length of the current consecutive sub array forming an AP
Use another variable to keep track of the length of the longest consecutive sub array forming an AP seen so far
- Q12. Given a binary tree, connect all the nodes at the same level. Each node will have a next pointer; you have to make it point to the next node to its right in the same level. If there is no such node, make ...
Interview Preparation Tips
College Name: NA
Skills evaluated in this interview
Interview Preparation Tips
Experience: I had sent my resume to the hiring group, Selection through telephonic interviews. I was interviewed by three different research groups (once by each).
Tips: Factors in decreasing order of importance: CGPA each stage. Ability to explain your projects precisely. Ability to solve ''standard" logarithmic problems. The way you think and put down your Answer is the most important. The final answer .s not so I important, and they prod you when you think out aloud anyway.
Round: Technical Interview
Experience: Almost- by default they ask about your previous projects/internships if they are relevant to the group. Ofher questions depend on the group you are interviewed by and your own profile, In my case it was machine learning, text mining etc. I was told about the research problem they were dealing with then and asked f or comments/suggestions/.inputs and a discussion followed.
Tips: Basically these are specialized Interviews so it's good to have sound knowledge of your domain (analytical and application skills are very much required).
Skill Tips: CGPA>9.0, 1f not (like me) relevant work done in the domain and in past internship.A recommendation from the professor is also a good add on.
College Name: IIT Madras
Interview Preparation Tips
Experience: There was an apititude test basically in line with CAT pattern. It was conducted online for about 45 min duration. The questions were rather simple but each question was time bound (around 45 sec or so).
Tips: As such I did not have any structured study plan. I did refresh some of my basics in mechanics and analysis. I was more inclined to get a job in aerospace division. Read as per your interest.
Duration: 45 minutes
Round: Group Discussion
Experience: Initially, we are seated randomly in a circular manner and each one was given two minutes to describe the topic. It was followed by an tense debate where participants converged and diverged on different sets of issue. They were particularly looking for interpersonal skills and out of the box thinking.
Round: Interview
Experience: The interview was purely management type.More questions were thrown at team building, bio-data, why this company? , project, what you Can contribute for the firm?, where you see yourself in next 5 -10 years, ambitions, some amount of optimization tools and techniques, concluding remarks....Interpersonal skills and clarity in answering where mainly
IBM was a more relaxed interview, which basically dealt with management and interpersonal skills. Questions like “if one of our team mate is very stubborn, lazy, adamant, how will you tackle the situation” were asked.
Tips: College (B Tech) curricular activities, NTSC certificate, Math Olympiad certificate, all India quiz competition awards were noted and appreciated. That really was a booster. That helps in implanting an idea that you are not just blah blah blah.
Skill Tips: Be very sure about your mechanics, analysis and design. These three are the fundamentals.
I haven prepared for placements exclusively. Here were combined discussions. However, it really helps if you can revise and make your fundamentals were clear. The basic understanding should be there. An hour every day for two months will do the trick.
Be really choosy of the company you want to be in. Learn a lot more of the company and get an idea of what they are actually looking for. But still don’t freeze your mind to those realms alone.. Be open minded and cheerful. The first few questions will set the mood of the interview. If you are bale to crack that, then things will be really smooth. Really concentrate on your fundamentals, especially analysis and design.
Skills: Mechanics, Analysis , Design
College Name: IIT-Madras
Interview Preparation Tips
Experience: CGPA > 8 is necessary
Round: Test
Experience: Online Test + Written Test
Online Test - Duration 90 minutes + Written Test 30 minutes for Hardware profile
Online Test -Quants, Number Series ; Calculators were not allowed
Written Test - Semiconductor Basics
Round: Interview
Experience: Interview is held in either 1 round for non-core profile or several rounds of technical interviews for Hardware.
Technical round consisted of questions form topics like VLSI, Semiconductors (BJT, MOS), ASIC Design Flow, CMOS Process Flow.
Round: Group Discussion
Experience: Group Discussion is held for non-core profilesDuration varies from 20-30 minutes with 11 members.
General Tips: Never ever mention GRE or MS or any higher studies, for that matter, in any placement interview if you want to get placed in that company
Practicing quant, puzzle solving and GD from early in the semester would definitely help
Core placement: be thorough with the core fundaes
Practice general quant questions without a calculator
Skills: Quants, Puzzle Solving
College Name: IIT MADRAS
Interview Preparation Tips
Experience: It had 3 parts: Data manipulation, number series and calculations.
Round: Test
Experience: Technical test on C. Typical questions on what will be the output of the program.
Round: Technical Interview
Experience: Questions were based on various areas of CSE, especially Programming languages and thesis work. Questions on Database connectivity in Java , CGI, DFA, DMA etc were also asked.
Tips: ISL works 80% in java and 20% in C. Thus, prepare Java well before appearing for the IBM-ISL. Must have basic knowledge in databases, Operating systems.
College Name: IIT KANPUR
Interview Preparation Tips
Experience: Initial shortlisting was based on 1 hour written test.
Questions on Quant,Codingand Algorithms were asked in the test
Tips: Focus on quant,coding and algorithms
Duration: 60 minutes
Round: Technical Interview
Experience: The subject knowledge and skills tested in Technical interview are:
1.Math
2.Coding
Tips: Good math knowledge is required.
Round: HR Interview
Experience: General HR question were asked in this round.
Skills: Data structure, Algorithms, Math, Coding
College Name: IIT MADRAS
Interview Preparation Tips
Experience: Quant, Sequence series, Basic mathematics
Each question was given a specific time after which other question appeared on screen and you cannot go back to the previous question. So this was a bit stressful.
12 people got selected.
Duration: 30 minutes
Round: Group Discussion
Experience: The moderator picked each and every guy and asked him/her to put his/her views, and then time was allocated to debate on the points raised. In total 15 mins GD. No elimination through GD. Basic GD skills were looked for that is ability to speak and to drive the discussion to a positive direction.
Round: HR Interview
Experience: Just 1 round of interview. Mostly HR question were asked. Resume based questions were asked. Basically HR questions were asked.
Round: Resume Shortlist
Tips: Interview was basically the criteria for selection. The internship, project POR everything mattered. Co-curricular activities were also asked.
General Tips: I think i was selected because I was able to justify my skill set properly. I gave valid explanations of my skill sets, I was able to justify my internships. Projecting my confidence level was an added advantage. Decide your future i.e. what is your area of interest and then prepare for it.
Having a good POR always help.
CGPA should be above 8.
Have mock interviews with a wingmates.
During internship work properly.
Skill Tips: Prepare for CAT. Quant, Puzzles, Case studies are important. Mock GDs and Mock PIs with wing-mates are very important. Revised all basic courses. All app-mech courses, solved some questions from unsolved section of any text book. Ensure you have mock GDs and mock PIs with wingmates.
College Name: IIT MADRAS
Workspot Interview FAQs
Recently Viewed
REVIEWS
Grant Thornton
No Reviews
SALARIES
Seco Tools
DESIGNATION
DESIGNATION
REVIEWS
Grant Thornton
No Reviews
SALARIES
Cognizant
SALARIES
CreditVidya
INTERVIEWS
USTAXO
No Interviews
JOBS
Browse jobs
Discover jobs you love
DESIGNATION
Tell us how to improve this page.
Interview Questions for Popular Designations
Workspot Interview Process
based on 1 interview
Interview experience
Interview Questions from Similar Companies
Workspot Reviews and Ratings
based on 12 reviews
Rating in categories
|
Lead Engineer
6
salaries
|  ₹24.2 L/yr - ₹43 L/yr |
|
Software Engineer
5
salaries
| ₹23 L/yr - ₹26 L/yr |
|
Senior Software Engineer
5
salaries
| ₹20 L/yr - ₹28 L/yr |
|
Senior Support Engineer
4
salaries
| ₹15 L/yr - ₹17.9 L/yr |
|
Senior Software Test Engineer
4
salaries
| ₹11 L/yr - ₹17 L/yr |
Citrix
VMware Software
Microsoft Corporation
Cisco
- Home >
- Interviews >
- Workspot Interview Questions
