Note 1

Take Note:

Take a note while surfing.





Note With Ink

Give your Note a Colorful Tag.




Easy to Access

Stay on same information and in Sync wherever you are.

Note 2

Take Note:

Organize your information,It may take Shape.





Think With Ink

Differ your Content by Color.




Easy to Access

Easy to pull up your content from anywhere anytime.

Note 3

Take Note:

Don't Let information to miss,Because it take shape





Note With Ink

Simple an Easy Way to take a note.




Easy to Access

Get the same in next visit.


Please wait...

Interview Questions and Answers :: Juniper Network

Home > Experience Archives > Juniper Network > Interview Question Set 4
First Round (F-2-F) Second Round (F-2-F)
    Question :: 1
    Can you walk me through your resume.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 2
    What is deadlocking?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 3
    How to manage memory in linux kernel?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 4
    What happens, when you type www.google.com in all the 7 layers of OSI model? What do these layers do? Explain each layer functionality in detail.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 5
    Explain about Memory Fragmentation.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 6
    What should a bridge and router device do upon receiving a frame?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 7
    How can you catch corruption of a structure member using GDB?

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 8
    Write a program to insert a node in a binary tree.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 9
    Explain C programming stack in detail.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 10
    What is segmentation fault. What is core dump. How you debug from core dump files

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 11
    Write a program to Count number of set bits in a binary number.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 12
    Have you used TOP command.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 13
    What does keyword volatile in C do.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 14
    Explain your recent project on the resume

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

    Question :: 15
    There are 100 closed lockers in a hall, and 100 students. Student 1 walks down the hall and opens all 100 lockers. Student 2 closes all even-numbered lockers. Student 3 looks at every third locker (a multiple of 3), and if it is open closes it, or vice-versa (this student changes the condition of the locker). Student 4 repeats the action of student 3, but only changes the condition of lockers that are a multiple of 4. This goes on with every student doing the same routine for his or her number.

    Answer:
    No Discussion on this question yet!
    Please Login First :
    Tags:

    No Tags on this question yet!

First Round (F-2-F) Second Round (F-2-F)