Placement Papers: Sasken Communication India 2008Tab.Amp

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

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

Question 1 if phase of different frequency components of signal vary linearly then they all reach destination with delay

Question 2 what is the relation in dbm and db?

Question 3 difference in PSK and QPSK

Question 4 what is the main problem with power line communication

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

Question 6 if a process is wide sense stationary then

Question 7 for intelligent sound signal transmission

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

Question 9 if signal is sampled at 8 khz and the signal of 1 khz is transmitted then

Question 1 char const * p = ‘p’ then which of below is true

(this question u can get from jobduniya sample paper)

Question 2 recursive function

count (n) { if count ⇐ 1 then result = 1; else result = count (n − 3) + count (n − 1) }

for count (6) ans is:

Question 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

Question 4 #define putchar (%f, c)

int c = ‘d’

putchar (c).

what is the output?

Question 5 file a

test () { int a; }

file b

void main (void) { int b; b = test (); }

what is the output

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

Question 2 in parallelogram what values of angles r possible

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

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

Question 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

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

Question 7 if a (n) is to be entered following the rule [ a (n) ^2 − 1 ] then what r the next three enteries.

The test comprises of 2 sections:

Technical (C) & Technical Subject-60 mins, 60 questions

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

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.” RS Agrawal LR is sufficient

The questions were like this.

The text consists of two parts

C test

CSE01 Test

Duration: 1hr

#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) ); }