Parul Khurana_conexant Experience_26 Sept 2006

Conexant Experience: Sept 26,2006 There were two rounds in the software section: 1. Objective 45 min 2. Subjective 45 min It was 1.30 hr exam with no strict time limits in the two papers.U can start with any paper first(objective or subjective) but it is advisable to start with objective first becoz only once u clear the objective, ur subjective answers will be evaluated. Objective Section: had 60 questions: 30 or above from C programming. 10 from OS concepts 10 from networking around 5 questions of aptitude For C programming: 1. Do Test Your C skills by Yahwant Kanetkar 2. Practice C objective questions from internet. They r available on many sites like freshersworld.com,esnips.com etc. OS : there were simple questions from OS concepts. I read Opersting Systems concepts by Silberchtz & Galvin. Tht is enough. Networking basics were asked. Aptitude was simple.Anyone can do. Subjective section: There were 5 questions: Ques 1: 5 parts for 1 mark each Ques 2,3,4,5 to write a code for some problem The questions that I got in my paper were: 1. Implement a circular Queue and mention the use of pointers in it. 5 marks 2. Given a string as a sentence, write an efficient algorithm to reverse the words in the sentence. 5 marks Eg. ‘Welcome to Conexant Systems’ to ‘Systems Conexant to Welcome’ 3. Give the binary tree in its expression form. 5 marks 4.1 write a recursive algorithm to find out a factorial of a number. 1 mark 4.2 Give the output:

Char str[]=”Hello World”; Int i; For(i<0;i<sizeof(str);i++) printf(“%s”,str++);

1 mark

suggestions: for the subjective section, do data structures well, their theory and implementation(preferably in C) mainly do the implementation of: linked lists, types of linked lists, stacks,queues,binary trees etc. Do theory part of B tree, AVL tree etc. Interview: My interview was short. It lasted for about half an hour. Iwas asked 3 questions: 1. Write a function in C or C++ that takes a integer number(32 bit) as an argument and finds out how many bits are ‘1’ in it. (ie find out the number of 1s in a number). 2. Write an algorithm or pseudocode or explain the logic of the follwing operations: Given the 3 functions: 1) create stack(int size) 2) push(int x) 3) pop() implement the following 3 functions without using any local variables and pointers. 1) create queue(size) 2) insert(int x) 3) delete_element() 4. A simple puzzle. I was also asked to optimise my codes once I wrote them correctly. Rest I was asked bout my family background and myself. Wish u all the best for Conexant! Parul Khurana