[Updated] Goldman Sachs Aptitude Test Questions and Answers
Practice List of TCS Digital Coding Questions !!!
Take 50+ FREE!! Online Data Interpretation Mock test to crack any Exams.

# Juniper Network Interview Questions and Answers for 3 years Experience

Home > Experience Archives > Juniper Network > Interview Question Set 3
FREE!! class="iround r15 activediscat " id=15 style=background-color:darkgoldenrod >Mock TestFREE!! First Round (F-2-F) Second Round (F-2-F)
FREE!!>

1 / 10

Written test have 10 question

Write a program to divide the given Linked list as below
Given:

Output:

No Discussion on this question yet!
Tags:

No Tags on this question yet!

2 / 10

How you will find the offset of c in given below structure

struct
{
int a;
int *b;
char *c;
char d;
};

No Discussion on this question yet!
Tags:

No Tags on this question yet!

3 / 10

Write logic to find the depth of tree.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

4 / 10

arr = {{1,2}, {3,4};
*ptr = arr;
printf("arr[1][1] %d \n", ________ );

Fill the appropriate to access arr[1][1] in above partial code.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

5 / 10

struct student
{
char abc;
int i;
};

What will be the size of struct student;

No Discussion on this question yet!
Tags:

No Tags on this question yet!

6 / 10

char *str1;
char *str2;
char *str3 = NULL;
char *str4 = NULL;
char str5[10];
char str6[10]="abc";

Mark appropriate for the below operation [Compile time | Run time | Valid Statement]
str1 = "xyz";
strcpy(str2, "xyz");
str3 = "xyz";
strcpy(str4, "xyz");
str5 = "xyz";
strcpy(str6, "xyz");

No Discussion on this question yet!
Tags:

No Tags on this question yet!

7 / 10

What will be the Output/Error for the below pseudo code:

char *str2 = NULL;
char *str1[] = "ab";
char *str = "abcde";

printf("%d", sizeof (str));
printf("%d", strlen(str));
printf("%d", sizeof (str1));
printf("%d", strlen(str1));
printf("%d", sizeof (str2));
printf("%d", strlen(str));

No Discussion on this question yet!
Tags:

No Tags on this question yet!

8 / 10

int print_of_a (int a)
{
printf("in fun %d", a);
return a+1;
}

int print_of_x (int a)
{
printf("in fun %d", a);
return a-1;
}

int main()
{
int x;
printf("in main function \n");
x = print_of_a(3);
printf("%d", x);
printf("in main function \n");
x = print_of_x(3);
printf("%d", x);
}

Write down the output for the above code.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

9 / 10

Will be updated

No Discussion on this question yet!
Tags:

No Tags on this question yet!

10 / 10

Will be updated

No Discussion on this question yet!
Tags:

No Tags on this question yet!

FREE!! class="iround r15 activediscat " id=15 >Mock TestFREE!! First Round (F-2-F) Second Round (F-2-F)

1 / 14

No Discussion on this question yet!
Tags:

No Tags on this question yet!

2 / 14

What is OSPF?

No Discussion on this question yet!
Tags:

No Tags on this question yet!

3 / 14

How may LSA Router and How many N/w LSA in below topology.

[R1] -------1------[Network]------1----[R4]-----------5------[R7]
| |
|----1------[R3]------6-------[R6]----1---|

No Discussion on this question yet!
Tags:

No Tags on this question yet!

4 / 14

What type of network between the above question topology.
1. R1, R4 & R3
2. R4->R7
3. R3->R6

No Discussion on this question yet!
Tags:

No Tags on this question yet!

5 / 14

How routing calculation happen in below topology. The routing information learn on router R1 and R6 are same or not.
[R1] -------1------[Network]------1----[R4]-----------5------[R7]
| |
|----1------[R3]------6-------[R6]----1---|

No Discussion on this question yet!
Tags:

No Tags on this question yet!

6 / 14

How LSA learning happen in below topology, and how routing calculation in happening.

[R1] -------1------[Network]------1----[R4]-----------5------[R7]
| |
|----1------[R3]------6-------[R6]----1---|

No Discussion on this question yet!
Tags:

No Tags on this question yet!

7 / 14

R2 can reach to network an in cost of 5 and R1 can reach in a cost of (1+5) i.e. 6 to network. When this network (N) is not reachable from R2 and R1 sending update that it can reach in cost 6 so R2 will update, So it will become a loop, How will you prevent this issue...?

[R1]------1--------[R2]-------5-----[Network]
|------2-------------|

No Discussion on this question yet!
Tags:

No Tags on this question yet!

8 / 14

What is split horizon and routing poison?

No Discussion on this question yet!
Tags:

No Tags on this question yet!

9 / 14

Why RIP work only for small topology?

No Discussion on this question yet!
Tags:

No Tags on this question yet!

10 / 14

How ping happen / packet forward from source host to destination host.

Source Host ----------------- Destination Host

What if two router and one switch introuduce in topology.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

11 / 14

Diference between RIP and OSPF in terms of distance/Matric

No Discussion on this question yet!
Tags:

No Tags on this question yet!

12 / 14

What is ARP? and What is gratuitous ARP?

No Discussion on this question yet!
Tags:

No Tags on this question yet!

13 / 14

How mac-address learning happen? Explain each steps in details.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

14 / 14

Impliment a linked list using recurssion. How pointer return back to the calling in recuression?

No Discussion on this question yet!
Tags:

No Tags on this question yet!

FREE!! class="iround r15 activediscat " id=15 >Mock TestFREE!! First Round (F-2-F) Second Round (F-2-F)

1 / 9

No Discussion on this question yet!
Tags:

No Tags on this question yet!

2 / 9

Find the number of palindrome of a subtring of given string.

Given String :: Malayalam

No Discussion on this question yet!
Tags:

No Tags on this question yet!

3 / 9

What is process address space, explain all in detail.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

4 / 9

No Discussion on this question yet!
Tags:

No Tags on this question yet!

5 / 9

How heap min and max address get calculated. (Hint: sbrk and brk)

No Discussion on this question yet!
Tags:

No Tags on this question yet!

6 / 9

Write a program to traverse tree in INORDER.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

7 / 9

How you will delete a given node address in single linked list. Write program for same.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

8 / 9

Do you know Heap Sort? If so explain the same and its complexity.

No Discussion on this question yet!
Tags:

No Tags on this question yet!

9 / 9

How you will implement priority scheduling?