Placement Papers: Sasken Interview

Examrace Placement Series prepares you for the toughest placement exams to top companies.

In the interview, they asked about Stacks, Queues, Linked lists, Binary Trees.

Few questions I remember are:

  1. If u have a linked list library, how do u design stack and queue using it; write pseudocode.

  2. What are static variables and functions?

  3. Write code in C to count the number of 1s in a character (1byte).

  4. What is pre-order, post-order, in-order; write code to print post-order.

  5. Can u construct a binary tree given its inorder and postorder details. Is it neccessary or sufficient to construct tree. Asked an example to do in both ways.

  6. If recursion is not used to print post order, what other data structure u use (ans: Stack).

  7. Can u use stack always in place of recursion (ans: Yes)?

  8. What are meta characters?

  9. Write a piece of code to insert a node in a linked list.

  10. About malloc.

  11. About Operating System-Semaphores

  12. About Computability (eg: finding infinite loop), Complexity of algorithms

  13. What does compiler and assembler do?

They asked grep command in Linux. How do u search ‘\n’ using grep, in a file.

They may ask some other commands if u say u r familiar and recently been using linux.

About Networks? OSI reference model.

what does transport layer do?

TCP belongs to which layer?

IP belongs to which layer?

Where is error correction done?

What is a connection oriented/connection less transmission?

What is meant by reliable transmission protocol? why is it called so?

What is flow control and where it is done?

About ur project?

Asked me expalin about the project in brief.

If u don't know anything, say it sincerely. U cannot bluff them. I too spoke to them sincerely.

They were cool. U need not get tensed. They won't attack you. Just they want to know ur hold about the subject.

They has conducted Two tests. One test is

C 10 Q for 10 Marks and Other one is in thier

corresponding B. Tech Subjects 15 Q for 15 Marks. For

CSE Students the subjects are Automata Theory Formal

Languages, Data stcures, Discrete Mathematics, Operating

System, Digital Logic Design, Computer Organisation.

Micro Processer and Computer Networks.

C Test____10 Q − 10 M

Electives____15 Q − 15 M

Duration of these two exams is 1Hr.

C Test

  1. What is the output of the Program? main () { int a[10] = { 1, 2, 3, 4, 5, 6, 7, 8, 9, 10}; int * p = a; int * q = &a[9]; printf ( “%d” q-p + 1); } Ans: 10

  2. main () { int i = 6; int * p = &i; free (p); printf ( “%d” i); } Options:

    1. No Error.

    2. Free can't be used for p

    3. Compiler Error.

    4. In printf we should use * p instead of i.

    Ans: A

  3. What is the output of the Program? main () { int i = 5; i =! i>3; printf ( “%d” i); } Ans: 0

  4. What is the output of the Program? main () { int a[10]; 3[a] = 10; printf ( “%d” * (a + 3) ); } Ans: 10

  5. int ( * p[10]) (); In above declaration what type of variable is P? Ans: P is array of pointers that each points to a function that takes no arguments and returns an int.

  6. What is the output of the Program? struct emp { int a = 25; char b[20] = “tgk” }; main { emp e; e. a = 2; strcpy (e. b, “tellapalli” ); printf ( “%d %s” e. a, e. b); } Ans: Compile Error.

  7. What is the output of the Program? main () { int a = 5; const int * p = &a; * p = 200; printf ( “%d” * p); } Ans: Compile Error.

  8. What is the output of the Program? #define SQ (x) x * x main () { int a = SQ (2 + 1); printf ( “%d” a); } Ans: 5.

  9. What is the output of the Program? main () { struct t { int i; } a, * p = &a; p → i = 10; printf ( “%d” ( * p), i); } Ans: 10

This program will be Compiled? [Yes/No]

zzz. c file

/* This is zzz. c file */

/* printf ( “tellapalli” ); */

abc. c file

main () { #include “zzz. c” printf ( “Tellapalli” ); }

Ans: Yes

CSEA01 Test

I haven't remembered the Qs. I has forgotten Qs.

They has given 5Q in OS, 3Q in DM, 2Q in ATFL, 1Q in DLD.

1Q in CO, 1Q in MP 1Q in DS, 1Q in CN.

10 ques of C

10 ques of aptitude

10 ques of comp sc.

i m sendin the ques of comp sc whch might help u

COMP SC.

  1. IN BINARY TREE IF PARENT HAS INDEX i then its left and right child occurs at: Ans (a) 2i and 2i + 1

  2. 1 prog is given n scope is asked ans (b) static scope (probably)

  3. complete graph has ans (b) n vertices and n (n − 1)/2 edges

  4. page fault is said 2 occur when: 4 choices r given probably (c)

  5. probability that a frame is recieved with an error is P in a system. Probability that the first frame to b recieved with an error is after the first N frame is

    1. (1 − P) * (p raised to power N)

    2. [ (1 − P) raised to power (N − 1) ]

    3. p raised to power N

    4. combination of N taken P at a time

  6. statistical time division multiplexing provides:

    1. statistics of tdm signal

    2. provision to multiplex analog signal

    3. improved time sharing efficiency

    4. static routing b/w nodes

    ans (b) check

  7. main advantage of AMI coding is

    1. easy clock recovery

    2. easy carrier recovery

    3. reduced bandwidth req

    4. reduced error rate

  8. recursive-descent parser is a

    1. top-down parser

    2. bottom-up parser

    3. shift-reduce parser

    4. LR parser

  9. min. No. Of NAND gates reqd to implement a 2 i/p x-nor gate

    1. 2

    2. 3

    3. 4

    4. 5

  10. mandatory feature of a real time OS is:

    1. priority based preemptive scheduling

    2. high time slicing granularity

    3. run to completion

    4. none of the above

These are the Queston asked in the sasken wirtten held on 19th at 3.00 p. m batch.

Sign In