SASken - Ques

8/9/2019 SASken - Ques

1/33

SASKEN COMMUNICATION INDIA

There r 10 ques. in three sections each, thus total 30 ques. 4 choices were given. 1 mark foreach ans. no negative marking.

q.1 if phase of different frequency components of signal vary linearly then they all reachdestination with delay1) delay also vary linearly.2) no change in delay,3)

q.2 what is the relation in dbm and db?1) same

2) dbm is 10 times db3) db is 10 times dbm4) db is relative measure and dbm is absolute measure.

q.3 difference in PSK and QPSK

a. slower sample rateb. greater sample ratec. slower bit rated. greater bit rate.

q.4 what is the main problem with power line communicationa. high audio signal generationb. separation of modulating and career signalc. (something) low pass filtering

q.5 a signal is to be transmitted 1000km long distance sending 10 mbps . if signal consists of1000 bits/package and takes 5 microsecs. to transmit then how much data is to be send suchthat line gets fully filled.a. 100

b. 500cd.1000

q.6 if a process is wide sense stationarythena. it's probability density function is also wssb. power spectral density is wssc. it's mean constant and auto correlation function depends only on time diff. t1-t2.d.

q.7 for intelligent sound signal transmissiona. low pass filter of 1.8khz is to be used.b. hpf of 1.8khzc.

d.

q.8 if a 32 bit number in fractional form is to be converted into float then it is multiplied with

a. 2^31b. 1/(2^31 - 1)c. 2^31 -1d.

q.9 if signal is sampled at 8 khz and the signal of 1 khz is transmitted then
http://www.vyomworld.com/placementpapers/sasken-placement-paper-1.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-1.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-1.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-1.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-1.asp


2/33

q.1 char const *p='p' then which of below is truea.**P =(this question u can get from fresher world sample paper)

q.2 recursive functioncount(n){

if count


3/33

q.2 in parallelogram what values of angles r possiblei. 90,90,90,90ii. 70,130,70,130iii. 40,70,150,130a. i and ii onlyb,c,d,e : combinations

q.3 if x+y=z is given what can be inferred from it0i. x


4/33

fl_arr=(float **) arr;print_arr(fl_arr);fl_arr++;print_arr(fl_arr);}

# define putchar(c) printf("%c",c)

void main (){int s='c';clrscr ();putchar (s);printf("%d",printf("ABC\\"));}

void main (){int i;clrscr ();for(i=0;i3;


5/33

printf("%d",i);}*/

void main (){int a[10]; clrscr ();

3[a]=10;printf("%d ",*(a+3));}

PART #2

Sasken Exam 20th Jul 2004

Pattern : C(10 Qs) + Aptitude(10 Qs) + Discpline based[CS/EC](10 Qs)

Duration : 1 Hr

C questions

------------

1.Consider the following declaration:-

char const *p = 'd';

Which of the following is not a permissible operation(a) *p++(b) ++p(c) (*p)++(d) All

2.What is the output of the following code:-

void print_arr(float **p){printf(" 0 %f 1 %f 2 %f\n",p[0][0],p[0][1],p[0][2]);}

void main(){float arr[2][3] = {{0,1,2},{3,4,5}};float **fl_arr;fl_arr = (float *)arr;print_arr(fl_arr);fl_arr++;print_arr(fl_arr);}

(a)(d)segmentation fault


#define putchar (c) printf("%c",c)void main(){


6/33

char s='c';putchar (s);}

(a) c(b) 99(c) Compilation error

(d) Execution error


void main(){printf("%d",printf("ABC\\"));}

(a) ABC\\(b) 1(c) ABC\4(d) ABC\3


int compute(int n){if(n>0){n=compute(n-3)+compute(n-1);return(n);}return(1);}

void main(){

printf("%d",compute(5));}

(a) 6(b) 9(c) 12(d) 13


void main(){int i;for(i=0;i


7/33

(d)99..99..99..


void main(){int a[]={9,4,1,7,5};

int *p;p=&a[3];printf("%d",p[-1]);}

(a)6(b)1(c)7(d)Error


void main(){

int a[]={10,20,30,40,50};int *p;p= (int*)((char *)a + sizeof(int));printf("%d",*p);}

(a)10(b)20(c)30(d)40

9.Which code will run faster

for(i=0;i


8/33

(c)2(d)1

2. B is 8km East of A. C is 6km North of B. D is 12kmEast of C. E is 16km North of D.What is the distance b/w A and E.(a)20km

(b)22km(c)18km(d)30km

3. x+y = zThen(a)...(b)y


9/33

(c)...(d)None of these

2. A prefix expression can be equal to a postfixexpression reversed only if(a)It is left associative(b)It is commutative

(c)It is right associative

3.How many lines will be printed in the followingPascal pgm[I don't remember the Pascal version,so I am giving Cversion]

void print(int n){

if(n>0){print(n-1);printf("%d",n);//println(n) in Pascal version.print(n-1);

}}(a)3(b)7(c)15(d)31

4.Maximum number of nodes in a tree with n levels.(a)2^(n-1)(b)(2^n)-1(c)2^(n-1) - 1

5.Complete graphwith n nodes have(a)n-1 edges

(b)n(n-1)/2

6.If d is the degree of a node in a graph and n isnumber of vertices then number of edges in that graphis(a)Edi^n(b)0.25Edi(c)0.5Edi

7.A grammar was given and 4 strings was given and theone which was not possible was to be chosen.

8.A problem related to ethernet in which a stationsending a frame is of p probablity.There are m

stations to send pckts.4 option was given.It was amathematical kind of question related to probablity.

9.Which of the following layer in the OSI model doeserror handling(a)Data link(b)Network(c)Transport(d) a & c
http://www.vyomworld.com/placementpapers/sasken-placement-paper-2.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-2.asp


10/33

10.A network problem in which Data rate,Propagationdelay,and distance was given and it was to find howmany packets will be in the line.Choices where(a)5000(b)Not possible to find with given data(c)1000

A

Interview [For CS students]

---------There is Tech as well as HR interview. Tech interviewis the important one.

Tech interview questions------------------------

They will ask about the project.They will ask generalquestions about it and most probably will not go into

the implementation part of it.So one must have ageneral idea about the project done.

Interview is mainly based on Data Structures.Somequestions are as follows:-- What is a tree,its application,order forinsertion,deletion and traversal with worst caseanalysis.- What is a graph,its application.- Height of a tree- Balanced tree and how to balance a tree- Minimum Spanning Tree- Dijikstra's, Prim algorithms- Define a structure for a linked list.

- Binary search and its analysis- Heap sort and its analysis- What is a heap and its application- Cache and its working- Memory(IO mapped)- Recursive fns and types, its adv and disadv.- Compiler(grammar)

*****C debugging questions like

(1)What is the problem with the following code

int * f(int a)

{int i;i=a;

return(&i);}Ans-> We can't return address of auto variable as itis allocation is made in stack which is deallocatedwhen the function returns.

(2)


11/33

a.h b.c c.c d.cint i=0 #include"a.h" #include"a.h" extern inti;void main{.....}| | |b.o c.o d.oCompilation Phase

Linked to get exe.Will there be any problem in any phase.If yes thenwhere and what?In linking phase as there will be multiple declarationof i.

*****You will be told to write some code like

(1)To find string length by using recursive function.

(2)To find fibonaci series by using recursivefunction.(3)To write code for malloc so that allocation may bemade fastly.(4)Write a fn prototype which return a pointer which

points to an array of 10 ints.

HR Interview------------

- Introduce yourself- Why should we take you- What you know about Sasken and etc.

PART #3

Sasken Test

1)C test2)Aptitude3)technical

1)const char *p='c';which not allowed 1)p++ 2)*p++ 3) (*p)++4)all

2)#define putchar(c) printf("%c",c);

int c=69;putchar(c);

3) printf("%d",printf("ABC//"));

4) int func(int r){int static result;if(r


12/33

}

5) int i=3;while(i--){int i=100;i--;

printf("%d..",i);}

6) file a.c

void test(){int i=20;printf("%d",i);

}

file b.c

void main()

{int i=10;test();printf("%d",i);}

o/p is----

Technical

Deadlock, graph(2), error detection in which layer of OSI,find no: of packets

SASKEN PAPER------------------------

There were around 85 Info-science, 30 Telecomm.. and 5computer sc freshers.After the test HR announced that the result will be in 3 days i.e by Wednesday. Onlythosecandidates who r shortlisted will be intimated by mail. Rest must assume that they rnotshortlisted. If shortlisted they will have to come for a TECHNICAL INTERVIEW followedby a HRINTERVIEW.There may be further recruitment in SASKEN. I am not sure. Dont send ur CV's bymails. Just goto Sasken Campus and drop in ur resumes.

Address:Sasken Communications Technologies Limited.

# 139/25 Amar Jyoti Layout, Ring Road,Domlur POBanglore 560 071India.

The questions were like this.Sasken New Pattern


13/33

------------------------------Held on 9th August at 2:30 pmThe text consists of two parts1) C test2) CSE01 TestDuration: 1hr---------------------------------------------------------

1) C test -10 questions- Some questions were as followsI remember only a few.a) What is the parameter passing mechanism to Macros Called?b) void func(int x,int y){x=3;y=2;}main()

{int i;func(i,i);print(i);}

If the output must be 2 what is the parameter passing mechanism called?c) which of the following code will swap the two numbers? -3 choices was givend) which of the following is illegal for the program?main(){char const *p='p';}1)p++ 2) *p++ 3)(*p)++ 4) alle) what is the output of the following programvoid print(int ** arr){print("0 %f, 1 %f, 2 %f ",arr[0][0],arr[0][1],arr[0][2]);}main()

{int a[][]={ {1,2,3},{4,5,6}}int ** arr=a;print(arr);arr++;print(arr);}f) which of the following code swapps the two,numbers.- 4 choices were giveng) if the string " this is a " is present in the code of a function such as 'void func(void)'wherewill the variable stored in the memory.

a) in the stack b) heap c) code or text segment as per implementation d) createdwhenfunc is called, stored in function stack space and destroyed as it goes out .

2) CSE01-15 questionsIn this section there was question from LD-gates, JK flip flop, sampling rate and fewotherthen there was a few from OS - i dont remember the questions.


14/33

Part #4

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 binarytree given its inorder and postorder details. Is it neccessary orsufficient 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 - Semaphores12) About Computability (eg:- finding infinite loop), Complexity of algorithms13) 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 holdabout the subject.

They has conducted Two tests.One test isC 10 Q for 10 Marks and Other one is in thiercorresponding B.Tech Subjects 15 Q for 15 Marks.ForCSE Students the subjects are Automata Theory FormalLanguages,Data stcures,Discrete Mathematics,OperatingSystem,Digital Logic Design,Computer Organisation,

Micro Processer and Computer Networks.

C Test------10 Q-10 M

Electives---15 Q-15 MDuration of these two exams is 1Hr.C Test------1.What is the output of the Program?
http://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asphttp://www.vyomworld.com/placementpapers/sasken-placement-paper-4.asp


15/33

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: 102.main(){int i=6;int *p=&i;free(p);printf("%d",i);}

Options:a. No Error.b. Free can't be used for p,c. Compiler Error.d. In printf we should use *p instead of i.

Ans: A3.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 toa 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";


16/33

};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*xmain(){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: 1010.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


17/33

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 C10 ques of aptitude10 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 childoccurs at:

ans (a) 2i and 2i+12. 1 prog is given n scope is askedans (b) static scope (probably)

3. complete graph hasans (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 asystem.probability that the first frame to b recieved with an error is afterthe first N frame is

(a) (1-P)*(p raised to power N)(b) [(1-P) raised to power (N-1)](c) p raised to power N(d) combination of N taken P at a time

6. statistical time division multiplexing provides:(a) statistics of tdm signal(b) provision to multiplex analog signal(c) improved time sharing efficiency(d) static routing b/w nodes

ans (b) check

7. main advantage of AMI coding is

(a) easy clock recovery(b) easy carrier recovery(c) reduced bandwidth req

(d) reduced error rate

8. recursive-descent parser is a(a) top-down parser(b) bottom-up parser(c) shift-reduce parser(d) LR parser


18/33

9. min. no. of NAND gates reqd to implement a 2 i/p x-nor gate(a) 2(b) 3(c) 4(d) 5

10. mandatory feature of a real time OS is:(a) priority based preemptive scheduling(b) high time slicing granularity(c) run to completion(d) none of the above

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

The Question paper is of three sectionsi ) c (most of the questions) and c++;

ii) Apptitude (R.S agarwal)iii)basic commputer

Each section has 10 questions and the way they aorganised was good and timely.

c and c++;--------------------------------------1. char buffer[]="susan";

a) individual characters can be changed.b) buffer[7] is not accesible.c)none of the above.

which of the above is TRUE;

ans : a)

2.#include#includevoid main(){int ctr=0;clrscr();switch(ctr){case 0:ctr++;

case 1:ctr++;

default :ctr++;};printf("%d",ctr);getch();}


19/33

What is the output of the code.i) ctr=2;ii) ctr=3;iii) ctr=1;iv) compiler error;

Ans : iii)

3.#include#includevoid main(){

void fun(int,int);int i ,j;i=2,j=3;fun(i++,j++);printf("%d%d",i,j);

getch();}void fun(int i,int j){i++,j++;}

Question : what is the output ?

i)i=2,j=3;ii)i=3,j=4;iii)i=5,j=6;iv) compiler error.

Ans : ii)

4)#include#includevoid main(){int a[20];clrscr();*a=(int*)malloc(sizeof(a));printf("%d",sizeof(a));

getch();}

5)#include#includevoid main(){


20/33

char *s="susan";clrscr();printf(s);getch();}

i) compiler error;

ii) s;iii) susan;iv) 5;

Ans: iii)

6)

i) const * int p;ii) int const *p;iii) const int *p;

Question : which of the following is same.

a)i) and ii)b)i),ii) and iii)c)ii) and iii)d)none of the above.

7)

i) (*ptr)++;ii) *ptr+=1;iii) *ptr++;

Question: which of the folowing is same.

a)i) and ii)b)i),ii) and iii)c)ii) and iii)d)none of the above.

8)a)for(int i=0; i


21/33

9)

fun( int x, int y){x =3;

y =2;}

main(){int i;fun( i,i);printf("%d",i);}

Question :if the value is 2 then the calling mechanism is

a. Call by nameb. Call by refernce

c. Call by value

ans : call by reference

sorry my memory last a question...(10th)

"The question paper is a easy one but i think they are expecting a higher cut-off".

In apptidute they ask train,socks(probability),work..

In computer Basic's data structure (tree,queue) like best search method ..

In technical round they will ask why we answered that option as the

PART #5

SASKEN June 2004

The test comprises of 2 sections

:1. Technical ( C ) & Technical Subject- 60 mins, 60 questions2. Logical Reasoning.. - 30 mins,17 questions....

==> Questions in C were mostly from "pointers in c" and "test ur C skills" by Yeshwant


22/33

Kanetkar... C questions based on command line arguments, data structure ( BST, treetraversals). All the questions were like " what is the output of the following program segment"and in many questions 3rd and 4th choices were (c) compilation error and (d) compilation,warning, runtime error.... Heard they are asking abt- ptr, string, arr, preprocessor, datastructures etc.. C test was pretty ok pass by value, pass by reference etc. questions wereasked The general test was pretty tough, they ask u fourier transforms,harmonics,Barkhuasencriterion,virtual memory,Whether FIFO is better than LRU etc. 4 questions were from fourier

transforms the duration was 60 mins and no negative marking

C basics 10 questions ,very easy.Given a program and asked the output-type questons.frompointers 3-4 questions are there. 2)reg subject:very very easy:some from digital(on nandgates. Jk flip flop),from Information theory and coding,some from Micro processors.

In Logical Reasoning all the 17 questions were paragraphs (argument) of 5 to 6sentences...five sentences (choices) will be given below and questions were asked like " whichof the five if true will weaken or supports the argument above .." :- R. S. Agrawal LR is

sufficient

SASKEN PAPER 9th AUG--------------------------------------------------------------

The questions were like this.------------------------------

The text consists of two parts

1) C test2) CSE01 TestDuration: 1hr---------------------------------------------------------------1) C test -10 questions- Some questions were as follows, remember only a few.a) What is the parameter passing mechanism to Macros Called?b) void func(int x,int y){x=3;

y=2;}main(){int i;func(i,i);print(i);}If the output must be 2 what is the parameter passing mechanism called?c) which of the following code will swap the two numbers? -3 choices was givend) which of the following is illegal for the program?main(){char const *p='p';

} 1)p++ 2) *p++ 3)(*p)++ 4) alle) what is the output of the following programvoid print(int ** arr)

{print("0 %f, 1 %f, 2 %f ",arr[0][0],arr[0][1],arr[0][2]);}main(){int a[][]={ {1,2,3},{4,5,6}


23/33

} int ** arr=a;print(arr);arr++;print(arr);}f) which of the following code swaps the two numbers.- 4 choices were given

g) if the string " this is a " is present in the code of a function such as 'void func(void)' wherewill the variable stored in the memory.a) in the stack b) heap c) code or text segment as per implementation d) created when func iscalled, stored in function stack space and destroyed as it goes out .

2) CSE01-15 questionsIn this section there was question from LD-gates, JK flip flop, sampling rate and few otherthen there was a few from OS - don't remember the questions.

INTERVIEW

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 binarytree given its inorder and postorder details. Is it neccessary orsufficient 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.


24/33

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 holdabout the subject.

InterviewIn 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 orsufficient 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 - Semaphores12) About Computability (eg:- finding infinite loop), Complexity of algorithms13) 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 holdabout the subject.


25/33

Sasken at rect in July

THE PATTERN IS LIKE APPTI 10 QUES AND OS conspects 10 and C 10 ques total 30ques......time 60 min..

all of them are objectivethe apti paper goes like this....they r in serial order at my level best i have noted for u , andremaining i am not sure.

in apti the answers having five choices, just work out and all the best.i am not providing my answers ... solve them..

1. how many 2 digit number satisfy the following... that last digit of the square of the 2 digitnumber is 8A. none B. 1 C. 2 D. 3 E more than three2. city B is 8 miles east of A,city C is 6 miles north ofBcity B is 16 miles east of Ccity E is 12 miles north of Dwhich of the distance from city A to EA. 10 B. 20 C . 24 D .30 E .423 if X+Y=Z and X and Y are +ve , which of the follwing statement can be truei) x < yii) x


26/33

( a base (n-1) and )square.

computer science - questionsjust iam giveng the question find the answers ,as their was provided, idint find time to copy itsorry for that1. dead lock is an os occurs when2 the string got by reversing the postfix form of a _expression (binary operator only) willbe

given ti the prefix form of the same number onlu it is3.this is a pascal programeprocedure p(y:int);beginif y>0p(y-1)write ln("xyz" )p(y-1)

endendhow many time will p(4)writeA .4 ,B 15, C . 8 D. 34. MAX NO OF NODES IN A BINARY tree of depth (k>=1)

A . 2 raised to power kB. 2 raised to power (k-1)C . (2 raised power k)-1D . 2 raised power (k-2)5 A complete graph hasa. n vertices and (n-1)edgesb. " n(n-1)/2c. " 2n(n-1)/3d. n vertices and n edges6 . If d is degree of the vertex i in a graph G with n vertices and e edges then(E : is sigma in the answer)a . E(dpower n -1); b . 0.5(Ed power n ) ; c. 0.5 (E d base i) d . 0.25 (Edi)7.8. what is the error handling in the OSI model

a. data layer b.network layer c. transport layer d. both

9. consider the grammars->iCtSs-> iCtSess->aC-> b

A .ibtaea B . ibtitbtaeaea C. ibteaeaea D. ibta10. consider 1000 km round turn route with a teransmission rate of 100 mbps. assume apropagation time of 5m/s . consider a packet size of 1000 bits how many packets are neddedto fill up the lines along the rate.a. 5000 b.1000 c . cannot estimated the data d. 1000

and finally the c ques1. given the folloeing definationchar const *p='p'

A.p++ B.*p++ C. (*p)++ d.all

2. What is the out put of the following programvoid printarr(float **arr){printf("o,%f1,%f2,%f\n"arr[0][0],arr[0][1],arr[0][2])


27/33

}void main(){float **arr,otr[2][3] = {{1,2,3} , {2,1,0}}arr= (float**)otr;printarr(arr);arr++;

printarr(arr);return;}

A. 0,2 1,11,2,0B .0,1 1,2,2,3C. 0,1 1,2,2,2D. defalut value

3. what does the following code fragmanted to#define putchar(c) printf("%c",c)

int c='d'putchar(c);A.prints d B. prints n C.compile error d. ----6.int compute(int n){static int result ;if(n


28/33

int *bb=( int*) maloc(10* size of int))*b =&a[3];for(i=0;i


29/33

local variables stored in runtime

all the above

9. which of the foll data structures can be randomly accessed givin loc

1.linked kist implemented using array

2.singly linked list

3.double linked list

4.both single and double linked list

10. Find output .

Int *ptr=&const;

ans:error

11. Find output ..

Function(i=10);

ans:error

12. #define SWAP(x,y) t=x;x=y;y=t;

main()

{

int x=5,y=6;

if (x>y)

SWAP(x,y);

printf(x=%d y=%d\n,x,y);

}note that the function SWAPis not within braces

13. sum(int x)

{int t;

if(x


30/33

ptr=a;

printf(%d, *((char *) ptr+4));

}

find output

8 2 4 6

ANS= 4

16. which takes the same memory space regardless of the type of operating system?

Char* char int float

17. main()

{ int I=3;

while(I--)

{int I=100;

I--;

Printf(%d, I);

}

}

find output.

100 99 98 99 98 97 99 99 99 error ANS= 99 99 99

18. main()

{char ch;

for(ch=0;ch


31/33

1) C test2) CSE01 TestDuration: 1hr---------------------------------------------------------------1) C test -10 questions- Some questions were as follows, remember only a few.a) What is the parameter passing mechanism to Macros Called?

b) void func(int x,int y){x=3;y=2;}main(){int i;func(i,i);

print(i);}If the output must be 2 what is the parameter passing mechanism called?c) which of the following code will swap the two numbers? -3 choices was givend) which of the following is illegal for the program?

main(){char const *p='p';} 1)p++ 2) *p++ 3)(*p)++ 4) alle) what is the output of the following programvoid print(int ** arr){print("0 %f, 1 %f, 2 %f ",arr[0][0],arr[0][1],arr[0][2]);}main(){int a[][]={ {1,2,3},{4,5,6}} int ** arr=a;

print(arr);arr++;print(arr);}f) which of the following code swaps the two numbers.- 4 choices were giveng) if the string " this is a " is present in the code of a function such as'void func(void)' where will the variable stored in the memory.a) in the stack b) heap c) code or text segment as per implementationd)created when func is called, stored in function stack space and destroyed asit goes out .

2) CSE01-15 questions

In this section there was question from LD-gates, JK flip flop, sampling rateand few other then there was a few from OS - don't remember the questions.

INTERVIEW

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

Few questions I remember are:


32/33

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. Isit 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 ofalgorithms

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 spoketo them sincerely.


33/33

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

Documents

SASken - Ques