Cisco Interview Experience | Set 9 (For Experienced)

Written Test:
1) 15 Aptitude Questions

2) 25 CS Fundamentals & Couple of output questions.

3) Coding Question: A thief trying to escape from a jail has to cross ‘N’ walls each with varying heights. He climbs ‘X’ feet every time. But, due to the slippery nature of those walls, every times he slips back by ‘Y’ feet. Now the input is given as (N, {H1, H2, H3,….Hn}, X, Y}. Calculate the total number of jumps required to cross all walls and escape from the jail.
F2F 1
1) Calculate the number of bits set to 1 in a binary number.

2) Unsorted array and a position ‘P’. Return the element that is likely to come to the given location upon sorting the array. Do it 0(n).
3) Many question regarding UNIX N/W programming. Doesn’t need to worry. If you know already is advantageous.

4) Shared memory, OS concepts, IPC mechanisms. Which among is the fastest IPC
F2F 2
1) Questions related to projects.

2) Given a big C program, point out various storage classes.

3) Explain the DS which is well suited to implement UNIX commands like PWD, LS, MKDIR, CD in an imaginary OS. No code required. Just the DS.
F2F 3
Entire round is dedicated to projects.
F2F 4:
With team manager: Why you want to switch. Explained the work. Which team you want to join.
This article is contributed by Bharat. If you like zambiatek and would like to contribute, you can also write an article and mail your article to review-team@zambiatek.com. See your article appearing on the zambiatek main page and help other Geeks.

Feeling lost in the world of random DSA topics, wasting time without progress? It’s time for a change! Join our DSA course, where we’ll guide you on an exciting journey to master DSA efficiently and on schedule.
Ready to dive in? Explore our Free Demo Content and join our DSA course, trusted by over 100,000 zambiatek!

Related Articles

Leave a Reply

Your email address will not be published. Required fields are marked *

Back to top button