SASKEN COMMUNICATION INDIA

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

q.1 if phase of different frequency components of signal vary linearly then they all reach
destination with delay
1) 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 db
3) db is 10 times dbm
4) db is relative measure and dbm is absolute measure.

q.3 difference in PSK and QPSK

a. slower sample rate
b. greater sample rate
c. slower bit rate
d. greater bit rate.

q.4 what is the main problem with power line communication

a. high audio signal generation
b. separation of modulating and career signal
c. (something) low pass filtering

q.5 a signal is to be transmitted 1000km long distance sending 10 mbps . if signal consists of
1000 bits/package and takes 5 microsecs. to transmit then how much data is to be send such
that line gets fully filled.
a. 100
b. 500
c
d.1000

q.6 if a process is wide sense stationary then

a. it's probability density function is also wss
b. power spectral density is wss
c. it's mean constant and auto correlation function depends only on time diff. t1-t2.
d.

q.7 for intelligent sound signal transmission

a. low pass filter of 1.8khz is to be used.
b. hpf of 1.8khz
c.
d.

q.8 if a 32 bit number in fractional form is to be converted into float then it is multiplied with
a. 2^31
b. 1/(2^31 - 1)
c. 2^31 -1
d.

q.9 if signal is sampled at 8 khz and the signal of 1 khz is transmitted then
q.1 char const *p='p' then which of below is true
a.**P =
(this question u can get from fresher world sample paper)

q.2 recursive function

count(n){
if count<=1
then result = 1;
else
result = count(n-3) + count(n-1)
}
for count(6) ans is:
a. 3
b. 6
c. 9
d. 12

q.3 for(i=0;i<=50;i++)
for(j=0;j<=100;j++)

for(j=0;j<=100;j++)
for(i=0;i<=50;i++) for this type of loop which one is faster
a. same
b. first
c. second
d. depends on s/w and h/w

q.4 #define putchar(%f,c)

int c='d';
putchar(c);
what is the output?
a. ,b. some numbers
c. compiler error
d. segmentation error

q.5 file a
test()
{ int a; }

file b
void main(void)
{ int b;
b= test();
}
what is the output
a. a
b. b
c. not compiled,error
d. compiles sucessfully,but give linker error

q.1 if 2<x<3 and 7<y<8 then which is greatest

a. (x^2)*y
b. y^2)x
c. 5xy
d.
e.
q.2 in parallelogram what values of angles r possible
i. 90,90,90,90
ii. 70,130,70,130
iii. 40,70,150,130
a. i and ii only
b,c,d,e : combinations

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

i. x<z
ii. x<y
iii. x<2z
a. i only
b. i and ii only n ohter combi

q.4 if B is 8 miles in east from city A, c at 16 in north from B, D 16 miles in east of C, E at 12

in north of D then what is the distance b/t a and e.
a. 10
b. 20
c. 30
d. 40
e. 50

q.5 in a library for each single novell there r 2 science book and for each science book there r
7 economics books then the ratio of economics to science to novell is
a. 1:2:14
b. 2:1:7
c. 14:2:1
d.e.

q.6 ira is taller than sam, harold is shorter than gene, elliot is taller than harold
sam and harold is of same height. thenwhich one is true.
a.sam is shorter than harold
b. elliot is taller than gene
c. ira is taller than elliot
d. elliot is shorter than gene
e. harold is shorter than ira

q.7 if a(n) is to be entered following the rule [ a(n)^2 - 1 ] then what r the next three
enteries.
a. 0,-1,0
b. 2,3,4
c. 1,2,3
d. 0,-1,2
e. 0,-1,1

#include<stdio.h>
#include<conio.h>

/*void print_arr(float **p)

{
printf("%f %f %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;
clrscr ();
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;i<3;i++)
{
int i=100;
i--;
printf("%d..",i);
}
}

void main ()
{
int a[]={9,4,1,7,5};
int *p;clrscr ();
p=&a[3];
printf("%d",p[-1]);
}

void main ()
{
int a[]={101,201,301,401,501,601,701,801,901,001};
int *p; clrscr ();
printf("%d",a);
printf("arthi");
printf("%d", ((char *)-a + sizeof(int)));
p=(int *) ((char *) a +sizeof (int));
printf("%d",*p);
}

main ()
{
int a[10]={10,9,8,7,6,5,4,3,2,1}; clrscr ();
int *p=a;
int *q=&a[7];
printf("%d%d%d",q,p,(q-p+1));
}

main ()
{
int i=5; clrscr ();
i= !i >3;
 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

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

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

void main()
{
char s='c';
putchar (s);
}

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

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

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

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

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

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

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

void main()
{
int i;
for(i=0;i<3;i++)
{
int i=100;
i--;
printf("%d..",i);
}
}

(a0..1..2..
(b)99..98..97..
(c)100..100..100..
(d)99..99..99..

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

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

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

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<100;i++)
for(j=0;j<10;j++)
a[i][j]=0;

OR

for(j=0;j<10;j++)
for(i=0;i<100;i++)
a[i][j]=0;

(a)First code
(b)Second code
(c)Same
(d)Compiler and hardware dependent

Aptitude
--------

1.How many 2 digit numbers are there which have 8 as

the unit number in it's square.
(a)3
(b)None
(c)2
(d)1

2. B is 8km East of A. C is 6km North of B. D is 12km

East 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 = z
Then
(a)...
(b)y<z
(c)...

4. 2<x<3 , 7<y<8
Then which is the greatest
(a) (x^2)y
(b) 5xy
(c) x(y^2)
(d) 5(x^2)y/12

5. A is taller than B, D is taller than D, D is

shorter than E.Then which of the following is correct.
(a) C is taller than E
(b) A is taller than C
(c) D is shorter than A
(d) B is shorter than C

6.A small passage was given and 4 options which

summarizes it was given.The best was to be chosen.

7.Another passage was given and 4 inference was given

and correct was to be chosen.This one is very easy.

8.Which of the following is a parellogram:-

(a)130,50,130,50(angle in deg)
(b)120,30,130,20
(c)90,90,90,90
(d)a & c

9. In the following series (an - 1)^2, 1 is the first

term.Which are the next three
(a)1,3,4
(b)0,3,6
(c)0,1,2
(d)0,1,0

Computer science
----------------

1.Deadlock occur when

(a)Some resources are held up by some process.
(b)...
(c)...
(d)None of these

2. A prefix expression can be equal to a postfix

expression 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 following

Pascal pgm
[I don't remember the Pascal version,so I am giving C
version]

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 is

number of vertices then number of edges in that graph
is
(a)Edi^n
(b)0.25Edi
(c)0.5Edi

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

8.A problem related to ethernet in which a station

sending a frame is of p probablity.There are m
stations to send pckts.4 option was given.It was a
mathematical kind of question related to probablity.

9.Which of the following layer in the OSI model does

error handling
(a)Data link
(b)Network
(c)Transport
(d) a & c
10.A network problem in which Data rate,Propagation
delay,and distance was given and it was to find how
many packets will be in the line.
Choices where
(a)5000
(b)Not possible to find with given data
(c)1000

Interview [For CS students]

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

Tech interview questions

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

They will ask about the project.They will ask general

questions about it and most probably will not go into
the implementation part of it.So one must have a
general idea about the project done.

Interview is mainly based on Data Structures.Some

questions are as follows:-
- What is a tree,its application,order for
insertion,deletion and traversal with worst case
analysis.
- 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 it
is allocation is made in stack which is deallocated
when the function returns.

(2)
a.h b.c c.c d.c
int i=0 #include"a.h" #include"a.h" extern int
i;void main{.....}
|||
b.o c.o d.o
Compilation Phase

Linked to get exe.

Will there be any problem in any phase.If yes then
where and what?
In linking phase as there will be multiple declaration
of 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 recursive
function.
(3)To write code for malloc so that allocation may be
made 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 test
2)Aptitude
3)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<=0) result=1;
else
result=func(r-3)+func(r-1);
return result;
}

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 5 computer sc freshers.

After the test HR announced that the result will be in 3 days i.e by Wednesday. Only
those
candidates who r shortlisted will be intimated by mail. Rest must assume that they r
not
shortlisted. If shortlisted they will have to come for a TECHNICAL INTERVIEW followed
by a HR
INTERVIEW.
There may be further recruitment in SASKEN. I am not sure. Dont send ur CV's by
mails. Just go
to Sasken Campus and drop in ur resumes.

Address:
Sasken Communications Technologies Limited.
# 139/25 Amar Jyoti Layout, Ring Road,
Domlur PO
Banglore 560 071
India.

The questions were like this.

Sasken New Pattern
------------------------------
Held on 9th August at 2:30 pm
The text consists of two parts
1) C test
2) CSE01 Test
Duration: 1hr
---------------------------------------------------------
1) C test -10 questions- Some questions were as follows
I 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 given
d) which of the following is illegal for the program?
main()
{
char const *p='p';
}
1)p++ 2) *p++ 3)(*p)++ 4) all
e) what is the output of the following program
void 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 given
g) 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 implementation d) created
when
func is called, stored in function stack space and destroyed as it goes out .

2) CSE01-15 questions
In this section there was question from LD-gates, JK flip flop, sampling rate and few
other
then there was a few from OS - i dont remember the questions.
 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 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:
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: 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
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
(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
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 sections

i ) 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<stdio.h>
#include<conio.h>
void main()
{
int ctr=0;
clrscr();
switch(ctr)
{
case 0:
ctr++;
case 1:
ctr++;

default :
ctr++;
};
printf("%d",ctr);
getch();
}
What is the output of the code.
i) ctr=2;
ii) ctr=3;
iii) ctr=1;
iv) compiler error;

Ans : iii)

3.#include<stdio.h>
#include<conio.h>
void 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<stdio.h>
#include<conio.h>
void main()
{
int a[20];
clrscr();
*a=(int*)malloc(sizeof(a));
printf("%d",sizeof(a));
getch();
}

5)
#include<stdio.h>
#include<conio.h>
void main()
{
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<50 ;i++)
for( int j=0; j<100; j++)
a[i][j]=100;

b)for(int i=0; i<100 ;i++)

for( int j=0; j<50; j++)
a[j][i]=100;

Question : Which of the above 2 codes executes quickly.

i) a) is faster than b)
ii) b) is fater than a)
iii) both a) and b) executes for same time.
iv) depends upon the compiler and the hardware used.

Ans: " I think iii)" (check it out)

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 name
b. 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 questions
2. Logical Reasoning.. - 30 mins,17 questions....

==> Questions in C were mostly from "pointers in c" and "test ur C skills" by Yeshwant
Kanetkar... C questions based on command line arguments, data structure ( BST, tree
traversals). 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, data
structures etc.. C test was pretty ok pass by value, pass by reference etc. questions were
asked The general test was pretty tough, they ask u fourier transforms,harmonics,Barkhuasen
criterion,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.from
pointers 3-4 questions are there. 2)reg subject:very very easy:some from digital(on nand
gates. 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 6

sentences...five sentences (choices) will be given below and questions were asked like " which
of 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 test
2) CSE01 Test
Duration: 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 given
d) which of the following is illegal for the program?
main()
{
char const *p='p';
} 1)p++ 2) *p++ 3)(*p)++ 4) all
e) what is the output of the following program
void 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 given
g) 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 implementation d) created when func is
called, stored in function stack space and destroyed as it goes out .

2) CSE01-15 questions
In this section there was question from LD-gates, JK flip flop, sampling rate and 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:

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.

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 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.
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 objective

the apti paper goes like this....they r in serial order at my level best i have noted for u , and
remaining 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 digit
number is 8
A. none B. 1 C. 2 D. 3 E more than three
2. city B is 8 miles east of A,
city C is 6 miles north ofB
city B is 16 miles east of C
city E is 12 miles north of D
which of the distance from city A to E
A. 10 B. 20 C . 24 D .30 E .42
3 if X+Y=Z and X and Y are +ve , which of the follwing statement can be true
i) x < y
ii) x <2
iii) x <2z

A . only (i ) B. only( ii) C . both 1 &2 D . 2&3 E .1,2,3

4. if Xis a number satisying 2< X <3 y is a number not satisying 7<Y<8 which of hte following
expressions will have the largest value
a. x square y
b. x ysuare
c.5 xy
d (4 x square y) /3
e. ( x square )/y
5. IRA is taler than SAM , ELLIOT is taller than HAROLD ,HAROLD is shoter thanGENE , SAM
and GENE are of the same height
ANS : a. IRA is tall than SAM , b. ELLIOT is taller than ERA, c. SAM is shoter than ELLIOT .,d.
IRA is taller than HAROLD , e. SAM is shoter than HAROLD
6.. some what big ...
7.
8 . which of hte following are possible values for the angle of a parrelogram

90 ,90,90,90 all in degress

40,70,50,140 "
50,130,50,130 "
a 1 b2, c. 1,2 d 2,3 e. 1,2,3
9. for every novel in the school library there are 2 science books there 7 economics books .
express the ratio of the economics books to science books to novels in hte school library as
triple ratio
a.7:2:1 b.7:1:2 c. 14:7:2 d. 14:2:1 e . 14:2:7

2
10.The entry an in a followng secequence is deterimined by the rule(a ) if 1 is entry in the
sequence the next five enteries are.
n-1
A.0,1,2 B0,-1,1 C. 0,1,2 D.2,3,4 E. 0,1,0
( a base (n-1) and )square.

computer science - questions

just iam giveng the question find the answers ,as their was provided, idint find time to copy it
sorry for that
1. dead lock is an os occurs when
2 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 is
3.
this is a pascal programe
procedure p(y:int);
begin
if y>0
p(y-1)
write ln("xyz" )
p(y-1)
end
end
how many time will p(4)write
A .4 ,B 15, C . 8 D. 3
4. MAX NO OF NODES IN A BINARY tree of depth (k>=1)
A . 2 raised to power k
B. 2 raised to power (k-1)
C . (2 raised power k)-1
D . 2 raised power (k-2)
5 A complete graph has
a. n vertices and (n-1)edges
b. " n(n-1)/2
c. " 2n(n-1)/3
d. n vertices and n edges
6 . 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 grammar

s->iCtS
s-> iCtSes
s->a
C-> b

A .ibtaea B . ibtitbtaeaea C. ibteaeaea D. ibta

10. consider 1000 km round turn route with a teransmission rate of 100 mbps. assume a
propagation time of 5m/s . consider a packet size of 1000 bits how many packets are nedded
to fill up the lines along the rate.
a. 5000 b.1000 c . cannot estimated the data d. 1000

and finally the c ques

1. given the folloeing defination
char const *p='p'
A.p++ B.*p++ C. (*p)++ d.all

2. What is the out put of the following program

void printarr(float **arr)
{
printf("o,%f1,%f2,%f\n"arr[0][0],arr[0][1],arr[0][2])
}
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,0
B .0,1 1,2,2,3
C. 0,1 1,2,2,2
D. 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<=1)
result=1
else
result =compute(n-3)+compute(n-1);
return result;
}
A. 8 B. - 9 C. - 6 D. - 12
7. out put of the programme
main()
{
int i=3
while(i - -)
{
int i=100;
i--;
printf("%d",i)
}
}
A. infinite loop B . 3... 2... 1 C . 99... 99.. 99 D. 2... 1... 0

8. #include <stdio.h>
void mainvoid()
{
printf("%d", printf("ABC\\"));
}
a. ABC\ b.\ c.ABC\4 d.ABC\\\

9. #include <stdio.h>
void main(void)
{
int a[10], i;
int *b
b=( int*) maloc(10* size of int))
*b =&a[3];
for(i=0;i<10;i++)
a[i] =i+10
printf("%d",b[-1]);
}

PART #6

1. which of these checks for structural errors of a language

a)lexical analyser
b)parser
c)intermediate code
d)code optimisation

2. threads in the same process share the same

a)data section
b)stack
c)registers
d) thread id

3. the depth of a binary tree...

a)nlogn(base 2)
b) n*n
c)n

4. a program computing log(n) accepts 1000 inputs its execution time is 110 ms...when
it doubles n to 2000 inputs..it becomes 120.....and what will be for 4000
a)130
b)140
c)150

5. algorithm to find the balancing of paranthesis was given and output had to be
obtaines...using stacks...easy yaar....

6. which of the followin is non preemptive

fcfs
round robin
shortest job first

7. problem to find the avg waitin time of sjf..given the burst times of each process

8. which of the follwing may be implemented using a stack

parenthesis matchin
parsing
 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<=1) return (1);
t=sum(x-3)+sum(x-1);
return (t);
}
if 6 is passed to the function, what is the value returned to the calling function.
ANS= 9
[ans:don’t remember the actual _expression.if the _expression is the same the ans
was nine]

14. what is int (*ptr)[]()?

15. Main()
{int a[]={0,2,4,6,8};
int *ptr;
 ptr=a;
printf(“%d”, *((char *) ptr+4));
}
find output
8246
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<=255;ch++)
printf(“%c”, ch);
}
[ans : infinite loop

19. some program using variable b which was not initialized so

ans error

Part #7

SASKEN COMMUNICATION INDIA

The questions were like this.

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

The text consists of two parts

1) C test
2) CSE01 Test
Duration: 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 given
d) which of the following is illegal for the program?
main()
{
char const *p='p';
} 1)p++ 2) *p++ 3)(*p)++ 4) all
e) what is the output of the following program
void 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 given
g) 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 implementation
d)
created when func is called, stored in function stack space and destroyed as
it goes out .

2) CSE01-15 questions
In this section there was question from LD-gates, JK flip flop, sampling rate
and 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:

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.