Subscribe

RSS Feed (xml)

Powered By

Skin Design:
Free Blogger Skins

Powered by Blogger

search topic

Tuesday, June 17, 2008

CBSE BOARD CLASS X DATE SHEET 2008 interview-questions

DAY & DATETIMECodeSubject Name
Saturday,01st March, 200810:30 AM154
165
254
354
454
ELEM. OF BUSINESS
INTRODUCTORY I T
ELEM BOOK-K & ACCY
TYPEWRITING-ENG
TYPEWRITING-HINDI
Monday,03rd March, 2008 10:30 AM087SOCIAL SCIENCE


003
303
004
006
008
009
010
011
012
013
015
016
017
018
019
020
021
023
024
025
026
095
096
097
098

URDU COURSE-A
URDU COURSE-B
PUNJABI
TAMIL
SINDHI
MARATHI
GUJARATI
MANIPURI
MALAYALAM
ORIYA
KANNADA
ARABIC
TIBETAN
FRENCH
PORTUGUESE
GERMAN
RUSSIAN
PERSIAN
NEPALI
LIMBOO
LEPCHA
BHUTIA
SPANISH
KASHMIRI
MIZO
Friday,07th March, 200810:30 AM005
007
014
064
BENGALI
TELUGU
ASSAMESE
HOME SCIENCE
Tuesday,11th March, 2008 10:30 AM041MATHEMATICS
Friday,14th March, 2008 10:30 AM101
184
ENGLISH COMM.
ENGLISH LNG & LIT.
Monday,17th March, 2008 10:30 AM002
085
HINDI COURSE-A
HINDI COURSE-B
Wednesday,19th March, 2008 10:30 AM122COMM. SANSKRIT
Thursday,20th March, 2008 10:30 AM031
032
033
034
035
036
MUSIC KAR.VOCAL
MUSIC KAR.INS.MEL.
MUSIC KAR.INS.PER.
MUSIC HIND.VOCAL
MUSIC HIND.INS.MEL
MUSIC HIND.INS.PER
Monday,24th March, 2008 10:30 AM049PAINTING
Tuesday,25th March, 2008 10:30 AM086
090
SCIENCE-THEORY
SCIENCE W/O PRAC
Thursday,27th March, 2008 10:30 AM086SCIENCE-PRAC. SKLS

DOWNOAD AND SEE CBSE BOARD CLASS X DATE SHEET 2008 (Right click and select "Save as") - CLICK HERE

DOWNLOAD AND SEE CBSE BOARD CLAS XII DATE SHEET 2008 - CLICK HERE

Keep watching http://www.previouspapers.blogspot.com/ for lots of CBSE Class X and XII previous years question papers - All subjects question papers (science, humanities, commerce, etc. are available for you here) Download and save as many as u want. Book mark this site by (ctrl + d) Keep searching on this site for more papers of every type here. Good luck for your preparation. You can mail me for any info if u wish. Thanks for reading...

CBSE BOARD CLASS XII DATE SHEET 2008 interview-questions

DAY & DATETIMECodeSubject Name
Saturday,01st March, 2008 10:30 AM043
604
613
618
619
625
626
631
637
639
642
654
657
660
663
666
675
686
687
690
693
696
702
705
716
CHEMISTRY
OFFCE PRAC & SECT
MARKETING
STORE ACCOUNTING
CASH MGMT & H-KEEP
APPLIED PHYSICS
MECH. ENGINEERING
FABRICATN.TECH-III
ELECTRICAL ENGG.
MILK & MILK PRODS.
VEGETABLE CULTURE
B THERAPY &H DR-II
BIOLOGY-OPTHALMIC
LAB. MEDICINE
FUND OF NURSING II
RADIATION PHYSICS
ADVANCE FOOD PREP
CLOTHING CONST
BASIC DESIGN
FOOD PREPARATION
INDIA-TOURIST DEST
FOOD SCI.& HYGIENE
LIB. ADMN & MGMT.
PRIN &PRA-LIFE INS
POULTRY NUTR & PHY
Monday,03rd March, 200810:30 AM053FASHION STUDIES
Tuesday,04th March, 2008 10:30 AM054BUSINESS STUDIES
Wednesday,05th March, 2008 10:30 AM027HISTORY
Friday,07th March, 2008 10:30 AM042
608
610
612
614
620
622
635
640
643
655
658
661
664
667
684
691
694
700
703
706
717
PHYSICS
STENOGRAPHY-ENG
STENOGRAPHY-HINDI
ELE.COST A/C & AUD
SALESMANSHIP
LENDING OPERATIONS
ENGINEERING SCI.
RADIO ENG.&AUD.SYS
M PROD TPT &M COOP
FLORICULTURE
COSMETIC CHEMISTRY
OPTICS
CLINICAL BIO-CHEM.
COMM. HEALTH NURII
RADIOGRAPHY-I GENL
TEXTILE SCIENCE
ACCOMODAT. SERVICE
TRAVEL TRADE MGMT
BUSINESS DATA PRO.
CLSFN.& CATLOGUING
COMPUTER& LIFE I A
POULTRY PDTS& TECH
Saturday,08th March, 2008 10:30 AM028POLITICAL SCIENCE
Monday,10th March, 2008 10:30 AM001
101
301
ENGLISH ELECTIVE
FUNCTIONAL ENGLISH
ENGLISH CORE
Tuesday,11th March, 2008 10:30 AM056
057
058
059
060
061
062
067
DANCE-KATHAK
DANCE-BHARATNATYAM
DANCE-KUCHIPUDI
DANCE-ODISSI
DANCE-MANIPURI
DANCE-KATHAKALI
DANCE-MOHINIYATTAM
MULTIMEDIA & WEB T
Wednesday,12th March, 2008 10:30 AM064
109
198
HOME SCIENCE
MARATHI
MIZO
Thursday,13th March, 2008 10:30 AM055
605
617
624
627
629
630
632
634
638
662
668
697
712
ACCOUNTANCY
SECT PRAC & ACCNTG
STORE KEEPING
ELECT APPLIANCES
AUTO ENGINEERING
CIVIL ENGINEERING
FABRICATN.TECH-II
AC & REFRGTN-III
ELN.DEV.& CIRCUITS
D E MICROPROCESSOR
MICROBIOLOGY
RADIOGRAPHY-II SPL
BAKERY SCIENCE
TPT. SYSTEMS &MGMT
Friday,14th March, 2008 10:30 AM040
066
120
607
PHILOSOPHY
ENTREPRENEURSHIP
GERMAN
TYPEWRITING-ENG
Saturday,15th March, 2008 10:30 AM

044
606
609
611
615
621
623
633
636
641
644
656
659
665
677
685
688
692
695
698
701
704
718

BIOLOGY
OFF. COMMUNICATION
TYPEWRITING-HINDI
FINANCIAL ACCNTG
CONS BEHV & PROTCN
MGMT OF BANK OFFCE
ELECTRIC MACHINES
AC & REFRGTN-IV
TV & VIDEO SYSTEMS
DAIRY PLANT INSTRU
POST HARV TECH&PRD
YOGA ANATOMY &PHYS
OPHTHALMIC TECH.
MAT.&CHILD H.NURII
ESTB & MGMT OF FSU
DESG & PAT MAKING
DYEING & PRINTING
FOOD & BEV SERVICE
TOUR MGMT & MP PLN
CONFECTIONERY
DTP CAD & MULTIMED
REFERENCE SERVICE
POULTRY DISE & CNT
Monday,17th March, 2008 10:30 AM039
045
068
SOCIOLOGY
BIOTECHNOLOGY
AGRICULTURE
Tuesday,18th March, 2008 10:30 AM104
111
PUNJABI
MANIPURI
Wednesday,19th March, 2008 10:30 AM

003
031
032
033
034
035
036
303

URDU ELECTIVE
MUSIC CAR.VOCAL
MUSIC CAR.INS.MEL.
MUSIC CAR.INS.PER.
MUSIC HIND.VOCAL
MUSIC HIND.INS.MEL
MUSIC HIND.INS.PER
URDU CORE
Thursday,20th March, 2008 10:30 AM041MATHEMATICS
Monday,24th March, 2008 10:30 AM048PHYSICAL EDUCATION
Tuesday,25th March, 2008 10:30 AM049
050
051
052
PAINTING
GRAPHICS
SCULPTURE
COMMERCIAL ART
Wednesday,26th March, 2008 10:30 AM030ECONOMICS
Thursday,27th March, 2008 10:30 AM022
105
106
107
108
110
112
115
116
118
123
124
322
SANSKRIT ELECTIVE
BENGALI
TAMIL
TELUGU
SINDHI
GUJARATI
MALAYALAM
KANNADA
ARABIC
FRENCH
PERSIAN
NEPALI
SANSKRIT CORE
Friday,28th March, 2008 10:30 AM037
699
PSYCHOLOGY
I T SYSTEMS
Saturday,29th March, 2008 10:30 AM002
113
114
117
119
121
125
126
195
196
197
302
HINDI ELECTIVE
ORIYA
ASSAMESE
TIBETAN
PORTUGUESE
RUSSIAN
LIMBOO
LEPCHA
BHUTIA
SPANISH
KASHMIRI
HINDI CORE
Monday,31th March, 2008 10:30 AM065
083
INFORMATICS PRAC.
COMPUTER SCIENCE
Wednesday,02nd April, 2008 10:30 AM029
046
628
676
GEOGRAPHY
ENGG. DRAWING
AUTOSHOP REP& PRAC
MEAL PLNG & SERVIC

DOWNOAD AND SEE CBSE BOARD CLASS X DATE SHEET 2008 (Right click and select "Save as") - CLICK HERE
DOWNLOAD AND SEE CBSE BOARD CLAS XII DATE SHEET 2008 - CLICK HERE

Keep watching http://www.previouspapers.blogspot.com/ for lots of CBSE Class X and XII previous years question papers - All subjects question papers (science, humanities, commerce, etc. are available for you here) Download and save as many as u want. Book mark this site by (ctrl + d) Keep searching on this site for more papers of every type here. Good luck for your preparation. You can mail me for any info if u wish. Thanks for reading...

HCL PLACEMENT PAPER 1 interview-questions

DOWNLOAD HCL TECHNOLOGIES COLLEGE CAMPUS PREVIOUS PLACEMENT QUESTION PAPERS AND HR INTERVIEW QUESTIONS HERE: KEEP WATCHING FOR MORE PAPERS::

HCL TECHNOLOGIES 2002- itbhu .Same as 2001

---------------
SECTION-I


1). Piggy backing is a technique for
a) Flow control b) sequence c) Acknowledgement d) retransmition
ans: c piggy backing

2). The layer in the OSI model handles terminal emulation
a) session b) application c) presentation d) transport
ans: b application

3) ans: a odd numbers of errors

4)Q. In signed magnitude notation what is the minimum value that can be represented with 8 bits

a) -128 b) -255 c) -127 d) 0 Ans c

5) c 20
6) a 120
7) b synchronise the access
8) a system call
9) b the operating system
10) a 177333
11) d used as a network layer protocall in network and
windows system
12) b has to be unique in the sub network
13)

Q. there is an employer table with key feilds as employer no.
data in every n'th row are needed for a simple following queries
will get required results.
a) select A employe no. from employe A , where exists from employe B
where A employe no. >= B employe having (count(*) mod n)=0
b) select employe no. from employe A, employe B where
A employe no.>=B employ no.grouply employe no.having(count(*) mod n=0 )
c) both a& b
d)none of the above

14)Q. type duplicates of a row in a table customer with non uniform key feild customer no. you can see
a) delete from costomer where customer no. exists
( select distinct customer no. from customer having count )
b) delete customer a where customer no. in
b rowid
c) delete customer a where custermor no. in
( select customer no. from customer a, customer b )
d) none of the above

15) c Volatile modifier


Section II - C Programming


1. Which of the following about the following two declaration is true
i ) int *F()
ii) int (*F)()

Choice :
a) Both are identical
b) The first is a correct declaration and the second is wrong
c) The first declaraion is a function returning a pointer to an integer and the second is a pointer to function returning int
d) Both are different ways of declarin pointer to a function
Answer : c

2. What are the values printed by the following program?

#define dprint(expr) printf(#expr "=%d\n",expr)
main()
{
int x=7;
int y=3;
dprintf(x/y);
}
Choice:
a) #2 = 2 b) expr=2 c) x/y=2 d) none
Answer: c

3. Which of the following is true of the following program
main()
{
char *c;
int *p;
c =(char *)malloc(100);
ip=(int *)c;
free(ip);
}
ans: The code functions properly releasing all the memory allocated

4.output of the following.
main()
{
int i;
char *p;
i=0X89;
p=(char *)i;
p++;
printf("%x\n",p);
}
ans:0X8A

5. which of the following is not a ANSI C language keyword?
ans:Function.

6. When an array is passed as parameter to a function, which of the following statement is correct choice:
a) The function can change values in the original array
b) In C parameters are passed by value. The funciton cannot change the original value in the array
c) It results in compilation error when the function tries to access the elements in the array
d) Results in a run time error when the funtion tries to access the elements in the array
Answer: a

7. The type of the controlling statement of a switch statement cannot be of the type

a) int b) char c) short d)float e) none
Answer : d

8.What is the value of the statement (3^6) + (a^a)?
a) 3 b) 5 c) 6 d) a+18 e) None
Answer : b

9. What is the value assigned to the variable X if b is 7 ?
X = b>8 ? b <<3>4 ? b>>1:b;

a) 7 b) 28 c) 3 d) 14 e) None
ans: c

10. Which is the output produced by the following program
main()
{
int n=2;
printf("%d %d\n", ++n, n*n);
}

a) 3,6 b) 3,4 c) 2,4 d) cannot determine
Answer : b

11. What is th output of the following program?
int x= 0x65;
main()
{
char x;
printf("%d\n",x)
}

a) compilation error b) 'A' c) 65 d) unidentified

12. What is the output of the following program

main()
{
int a=10;
int b=6;
if(a=3)
b++;
printf("%d %d\n",a,b++);
}

a) 10,6 b)10,7 c) 3,6 d) 3,7 e) none
Answer : d

13. What can be said of the following program?

main()
{
enum Months {JAN =1,FEB,MAR,APR};
Months X = JAN;
if(X==1)
{
printf("Jan is the first month");
}
}
a) Does not print anything
b) Prints : Jan is the first month
c) Generates compilation error
d) Results in runtime error

Answer: b

14. What is the output of the following program?
main()

{
char *src = "Hello World";
char dst[100];
strcpy(src,dst);
printf("%s",dst);
}

strcpy(char *dst,char *src)
{
while(*src) *dst++ = *src++;
}

a) "Hello World" b)"Hello" c)"World" d) NULL e)

unidentified
Answer: may be d

15. What is the output of the following program?

main()
{
int l=6;
switch(l)
{
default : l+=2;
case 4: l=4;
case 5: l++;
break;
}
printf("%d",l);
}

a)8 b)6 c)5 d)4 e)none
Answer : c

16. What is the output of the following program?

main()
{
int x=20;
int y=10;
swap(x,y);
printf("%d %d",y,x+2);
}

swap(int x,int y)
{
int temp;
temp =x;
x=y;
y=temp;
}
a)10,20 b) 20,12 c) 22,10 d)10,22 e)none
Answer:d

17. What is the output of the following problem ?

#define INC(X) X++
main()
{
int X=4;
printf("%d",INC(X++));
}

a)4 b)5 c)6 d)compilation error e) runtime error

Answer : d

18. what can be said of the following
struct Node {
char *word;
int count;
struct Node left;
Struct Node right;
}
a) Incorrect definition
b) structures cannot refer to other structure
c) Structures can refer to themselves. Hence the statement is OK

d) Structures can refer to maximum of one other structure
Answer :c

19. What is the size of the following union.
Assume that the size of int =2, size of float =4 and size of char =1.
nion Tag{
int a;
flaot b;
char c;
};

a)2 b)4 c)1 d) 7
may be b

20) What is the output of the following program? (. has been used to indicate a space)
main()
{
char s[]="Hello,.world";
printf(%15.10s",s);
}

a)Hello,.World...
b)....Hello,.Wor
c)Hello,.Wor....
d)None of the above
May be b

SECTION III - ANALYSIS PROGRAM SEGMENTS
---------------------------------------

1) Here is the structure declaration of a doubly

linked list
struct dlink {
int nodeid;
struct dlink *next;
struct dlink *prev;
} dlink_t;
A pointer of the head of the linked list is maintained as a global variable,
whose definition is
dlink_t *head;
The funtion remove_element(dlink_t *rp), needs to remove the node pointed to the rp and adjust the head. The first node's prev and the last node's next are

NULL.
remove_element(dlink_t *rp)
{
rp->prev->next = rp->next;
rp->next->prev = rp->prev;
if( head == rp)
head = rp->next;

Which of the following statement is true about the function remove_element

A) It work when head is the same as rp
B) It does not work when rp is the last element on the list
c) It sets the head of the list correctly

D) It works in all cases
Answer :B
2) Consider the following function written in c:
#define NULL 0
char *
index(sp,c)
register char *sp,c;
{
do {
if(*sp == c)
return (sp);
} while (*sp++);
return NULL;
}

The first argument sp, is a pointer to a C string. The second argument, c, is a character. This function scarches for the character c, in the string. If it is found a pointer to that location is returned else NULL is returned.
This function works
) Always
b) Always, but fails when the first byte contais the character c
c) works when c is a non NULL character only
d) Works only when the character c is found in the string
answer: a
03) What is printed when this program is executed

main()
{
printf ("%d\n",f(7));
}
f(X)
{
if (x<= 4) return x; return f(- -x); } a) 4 b) 5 c) 6 d) 7

answer: a

04) On a machine where pointers are 4 bytes long, what happens when the following code is executed.

main()
{
int x=0,*p=0;
x++; p++;
printf ("%d and %d\n",x,p);
}
a) 1 and 1 is printed
b) 1 and 4 is printed
c) 4 and 4 is printed
d) causes an exception
Answer b

05) Which of the following is the correct code for strcpy, that is used to copy the contents from src to dest?

a) strcpy (char *dst,char *src)
{
while (*src)
*dst++ = *src++;
}

b) strcpy (char *dst,char *src)
{
while(*dst++ = *src++)
}

c) strcpy (char *dst,char *src)
{
while(*src)
{ *dst = *src;
dst++; src++;
}
}
d) strcpy(char *dst, char *src)
{
while(*++dst = *++src);
}
answer:b

6) Consider the following program

main()
{
int i=20,*j=&i;
f1(j);
*j+=10;
f2(j);
printf("%d and %d",i,*j);
}
f1(k)
int *k;
{
*k +=15;
}

f2(x)
int *x;
{
int m=*x,*n=&m;
*n += 10;
}

The values printed by the program will be

a) 20 and 55
b) 20 and 45
c) 45 and 45

d) 45 and 55
e) 35 and 35
answer c

7) what is printed when the following program is compiled and executed?

int
func (int x)
{
if (x<=0) return(1); return func(x -1) +x;} main() { printf("%d\n",func(5)); } a) 12 b) 16 c) 15 d) 11 Answer b 08) COnsider the following of c code in two files which will be linked together and executed . a.c ___ int i; main() { i = 30; f1(); printf("%d\n",i) } b.c static int f1() { i+=10; } which of the following is true ? a) a.c will fail in compilation phase because f1() is not declared b) b.c will fail in compilation because the variable i is not declared c) will print 30 d) will print 40 e) a & b answer: e 9) Consider the following prg void funca (int *k) { *k += 20 } void funcb (int *x) { int m=*x,*n = &m; *n+=10; } main() { int var = 25,*varp=&var; funca(varp); *varp += 10; funcb(varp); printf ("%d and %d\n",var,*varp); } The values printed when the above prg is complied and executed are: a) 20 and 55 b) 20 and 45 c) 45 and 55 d) 55 and 55 e) 35 and 35 answer: d Section IV - General Aptitude Section 1) In a murder case there are four suspects P,Q,R,S. Each of them makes a statement. They are p: "I had gone to the theatre with S at the time of the murder". q: "I was playing cards with P at the time of the murder". r: "Q didn't commit the murder". s: "R is not the murderer". Assuming the only one of the above statement is false and that one of them is the murderer, who is the murderer? a) P b) Q c) R

d) Cann't be concluded
e) S
answer: E
2) Mohan earned twice as much as Deep. Yogesh earned rs.3/- more than half as much as deep. If the amounts earned by Mohan,Deep,Yogesh are M,D,Y respectively, Which of the following is the correct ordering of these amounts?

a) M <>
b) M <>
c) D <>
d) It cann't be determined from the information given
e) D <>
Answer d

03) Statistics indicate that men drivers are involved in more accidents than women drivers. Hence it may be concluded that
a) sufficiently information is not there to conclude anything
b) Men are actually better drivers but drive more frequently
c) Women Certainly drive more cautiously than Men
d) Men chauvinists are wrong about women's abilties.
e) Statistics sometimes present a wrong picture of things

Answer...?

04) What does the hex number E78 correspond to in radix 7 ?

a) 12455
b) 14153
c) 14256
d) 13541
e) 13112
answer:d

5)Given that A,B,C,D,E each represent one of the digits between 1 and 9 and that the following multiplication holds:

A B C D E
X 4

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

E D C B A

--------------
what digit does E represent ?

a) 4
b) 6
c) 8
d) 7

Answer: c

6) HCL prototyping machine can make 10 copies every 4 seconds. At this rate, How many copies can the machine make in 6 min.?

a) 900
b) 600
c) 360
d) 240
e) 150
answer: a

7) if a=2,b=4,c=5 then
a+b c

----- - ---- =

c a+b

) 1
b) 11/30
c) 0
d) -11/30
e) -1

answer: b
8) 10^2(10^8+10^8) =

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

10^4
a) 2(10)^4
b) 2(10)^6
c) 10^8
d) 2(10)^8
e) 10^10
answer: b

9) Worker W produces n units in 5 hours. Workers V and W, workers independently but at the same time, produce n units in 2 hours. how long would it take V alone to produce n units?

a) 1 hr 26 min
b) 1 hr 53 min
c) 2 hr 30 min
d) 3 hr 30 min
e) 3 hr 20 min

ans: d
10) if q <> 0 and k = qr -s, then what is r in terms
of k,q,s?
a) 2k+s
---
q
b) 2sk

----

q
c) 2(k-s)

-----

q
d) 2k+sq

-----

q
e) 2(k+s)

------
q

answer: e
11-15 is the reasoning Questions:

Six knights - P,Q,R,S,T and U - assemble for a long journey in two travelling parties. For security, each travelling party consists of at least two knights. The two parties travel by separate routes, northern and southern. After one month, the routes of the northern and southern groups converge for a brief time and at that point the knights can, if they wish, rearrange their travelling parties before continuing, again in two parties along separate northern and southern routes. Throughout the entire trip, the composition of travelling parties must be in accord with the following conditions
P and R are deadly enemies and, although they may meet briefly, can never travel together.
p must travel in the same party with s
Q cann't travel by the southern route
U cann't change routes

16) If one of the two parties of knights consists of P and U and two other knights and travels by the southern route, the other members of this party besides P and U must be

a) Q and S
b) Q and T
c) R and S
d) R and T
e) S and T
answer: e

17) If each of the two parties of knights consists of exactly three members, which of the following is not a possible travelling party and route?

a) P,S,U by the northern route
b) P,S,T by the northern route

c) P,S,T by the southern route
d) P,S,U by the southern route
e) Q,R,T by the southern route
ans: b
18) If one of the two parties of knights consists of U and two other knights and travels by the northern route, the other members of this party besides U must be

a) P and S
b) P and T
c) Q and R
d) Q and T
e) R and T

answer: c
19) If each of the two parties of knights consists of exactly three members of different parties, and R travels by the northern route, then T must travel by the

a) southern route with P and S
b) southern route with Q and R
c) southern route with R and U
d) northern route with Q and R
e) northern route with R and U

answer: a

20) If, when the two parties of knights encounter one another after a month, exactly one knight changes from one travelling party to the other travelling party, that knight must be

a) P
b) Q
c) R
d) S
e) T
answer: e
ALL THE BEST

--
Subject: HCL TECH interview qp
------------------------------------

HCL Technology Interview 2001 in Thiagarajar college
of engineering mku
-------------------------------------------------

Technical interview is held for 30 min to 1 hr 20min depending upon the stuff. Concentrated areas are

1) OS Concepts

2) C Programming skill

3) OOPs concepts

4) Basics of Networking

5) Data structures
Only basic QP like

1) What is fragmentation? How do overcome?

2) What is semaphore?

3) What are the IPC Mechanism available? Illustrate with example

4) What is structure and union in c? write the code and explain how they are storing in the memory?

5) They will ask to write one c program ?

6) Explain the data struture (code) for the data structures
i) Double linklist
ii) Minimum spanning tree
iii) BFS and DFS
iv) AVL tree
v) Reverse the linklist
7) Difference between malloc and calloc?
8) write a prg in macro in c?
9) Write a simple MFC program to create a window?
(They aaked me wite a prg to create a window)
10) Tell about the existing scheduling algorithm?
11) what are all E.F.Codd rule?
12) what is bit slice processor?
13) what is a deadlock? explain it?
14) what is virtual memory?
15) what is circuit switching and packet switching
16) What is the significance of friend keyword in C++?
17) Different types of inheritance?
18) do u want to ask anything from us?


HR interview

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

This ranges from 20 min to 45 min. They expecting ur
i) Focussing towards the technology
ii)Adaptability
iii) Family Background
iv) Team spirit

i) Tell abt yourself?
ii) what are all ur hobbies?
iii)why did u prefer your area of interest?
iv) why did u wanna be in HCL?
v) why did u choose MCA?
vi) howz interview is going on?
vii) Some general technical qp from ur area of interest?
viii) how'll u react if u r assigned in the non area of interest?(adaptability)
ix) how're getting information abt the company?
(weightage is given to communciating with the seniors)
x) In which project do u want to work in HCL?
xi) do u want to ask anything from us?

HCL PLACEMENT PAPER :2 interview-questions

DOWNLOAD HCL TECHNOLOGIES COLLEGE CAMPUS PREVIOUS PLACEMENT QUESTION PAPERS AND HR INTERVIEW QUESTIONS HERE: KEEP WATCHING FOR MORE PAPERS::

HCL SYSTEM SOFTWARE PAPER: 60 qs; 90 min. (4 sections)
******************************

NOTE : Please check answers once again.only this much i got ,which is available here in iit-kgp

section 1.

1.which of the following involves context switch,
a) system call b)priviliged instruction
c)floating poitnt exception
d)all the above
e)none of the above
ans: a

2.In OSI, terminal emulation is done in
a)semion b)appl.. c)presenta... d)transport
ans: b

3....... 25MHz processor , what is the time taken by the instruction which needs 3 clock cycles,
a)120 nano secs b)120 micro secs
c)75 nano secs d)75 micro secs


4. For 1 MBmemory no of address lines required,
a)11 b)16 c)22 d) 24
ans: 16

5. Semafore is used for
a) synchronization b0 dead-lock avoidence
c)box d) none
ans : a


6. class c: public A, public B

a) 2 member in class A,B shouldnot have same name
b) 2 member in class A,C " '' '' ''
c) both
d) none

ans : a


7. question related to java


8. OLE is used in

a)inter connection in unix
b)interconnection in WINDOWS
c)interconnection in WINDOWS NT

9.No given in HEX ---- write it in OCTAL

10.macros and function are related in what aspect?
a)recursion b)varying no of arguments
c)hypochecking d)type declaration

11.preproconia.. does not do one of the following
a)macro ...... b)conditional compliclation
c)in type checking d)including load file

ans: c

SECTION B

__________

1.enum day = { jan = 1 ,feb=4, april, may}
what is the value of may?
a)4 b)5 c)6 d)11
e)none of the above

2.main
{
int x,j,k;
j=k=6;x=2; ans x=1
x=j*k;
printf("%d", x);

3. fn f(x)
{ if(x<=0) return; ans fn(5) ....? else f(x-1)+x; } 5. int i =10 main() { int i =20,n; for(n=0;n<=i;) { int i=10 i++; } printf("%d", i); ans i=20 6. int x=5; y= x&y ( MULTIPLE CHOICE QS) ans : c 7. Y=10; if( Y++>9 && Y++!=10 && Y++>10)
printf("........ Y);
else printf("".... )

ans : 13

8. f=(x>y)?x:y
a) f points to max of x and y
b) f points to min of x and y
c)error
d) ........
ans : a

9. if x is even, then
(x%2)=0
x &1 !=1
x! ( some stuff is there)

a)only two are correct
b) three are correct
c), d) ....
ans : all are correct

10. which of the function operator cannot be over loaded
a) <= b)?: c)== d)* ans: b and d SECTION.C (PRG SKILLS)
--------
(1) STRUCT DOUBLELIST
{ DOUBLE CLINKED
INT DET; LIST VOID
STRUCT PREVIOUS; BE GIVEN AND A PROCEDURE TO DELETE
STRUCT NEW; AN ELEMENT WILL BE GIVEN
}
DELETE(STRUCT NODE)
{
NODE-PREV-NEXT NODE-NEXT;
NODE-NEXT-PREV NODE-PREV;
IF(NODE==HEAD)
NODE
}
IN WHAT CASE THE PREV WAS
(A) ALL CASES
(B) IT DOES NOT WORK FOR LAST ELEMENT
(C) IT DOES NOT WORK FOR-----
(2) SIMILAR TYPE QUESTION
ANS: ALL DON'T WORK FOR NON NULL VALUE

(3) VOID FUNCTION(INT KK)
{
KK+=20;
}
VOID FUNCTION (INT K)
INT MM,N=&M
KN = K
KN+-=10;
}
SECTION D
--------
(1) a=2,b=3,c=6 c/(a+b)-(a+b)/c=?
(2) no.rep in hexadecimal, write it in radiv 7
(3) A B C D E
* 4
---------- find E ANS: 13
E D C B A
------------
(4) GRE-MODEL TEST-1, SECTION-6(19-22)
(5) M HAS DOUBLE AMOUNT AS D, Y HAS RS. 3 MORE THAN HALF OF AMOUNT OF D
THE ORDERING A,B,C M C D C Y
ANS:DATA INSUFFICIENT D C M C Y
(6)IN STASTIC MEN CAUSE MORE ACCIDENTS THEN ONE CONCLUSION
(A) MEN DRIVE MORE THAN ONCE
(B) STASTICS GIVE WRONG INFORMATION
(C) WOMEN ARE CAUTION THAN ME ANS; C(VERIFY)
(D)-----ETC
(7) P,Q,R,S,T,U -SECURING GRANT;TWO TOURIST PARTIES AND THEN TWO SECURITY
GAURDS SHOULD GO WITH EACH PARTY
________________________________________________________________________
P AND R-ARE ENEMIES, Q DOES NOT GO SOUTH
P&S-ARE WILLING TO BE TOGETHER
______________________________________________________________________
THE TWO PARTIES MAY GO SOUTH&NORTH RESPECTIVELY
AT ONE POINT EACH MAY PASS EACH OTHER THEN GAURDS CAN EXCHANGE
6 Q BASED ON THIS
(8)pq-r/s =2 what is q inference a,n&d
(a) a can do n units of work in strs,a&b can do n units of work in 2 hrs
in how many hrs n units of work ans:3 hr 30 min p = (2s+r)/q
____________

main()
{
int var=25,varp;
varp=&var;
varp p = 10;
fnc(varp)
printf("%d%d,var,varp);
}
(a) 20,55(b) 35,35(c) 25,25(d)55,55

[ c++,c,dbms interview]
[fundamentals]
this is new paper
___________________________________________________________________________
application -software

____________________
part-1:
28-questions
(5)ingless ans:RDMS
(1)bit program-ans d
(2)c ans
(3)+ 0 ans
(4)00p--ans linking
(5)------
(6)-------
(9)25--45 even no. ans--10
(10) >10 <100 ans="">

HCL PLACEMENT PAPER 3 interview-questions

DOWNLOAD HCL TECHNOLOGIES COLLEGE CAMPUS PREVIOUS PLACEMENT QUESTION PAPERS AND HR INTERVIEW QUESTIONS HERE: KEEP WATCHING FOR MORE PAPERS::

HCL - HP
Written test:
One GRE type anals. section, and two comp Sc. sections. One Comp Sc. section was problem solving type. Quite easy. Only question worth mentioning in it was:
You are given a stack on which you can do the following:
Push X ----push the contents of memory location X on the stack
Pop X ----pop the contents of top of stack into mem. loc X
AND ----pop top two elements of stack, AND them and push theresult onto stack.
NOR ----pop top two elements, NOR them and push the result onto stack.

Given two data elements at memory locations A and B, obtain A XOR B usingthe above.

First Interview:- mostly technical.
a) Asked about my B.E. and why I joined MS.
b) My preference of posting. They asked this initially before launching into any other questions. Remainder of the interview was mostly on OS and C. Nothingon networks. They frame their questions on the basis of what you specify as your preference of posting and depending on what projects are available there.
c) What architectures, apart from 8085, do you know?
d) Give the contents of process stack for the execution of a particular C-program they give.
The C-program as such is not important. You just have to remember the order in which the return address of any function/procedure call, the parameters, and the local variablesare stored on the stack.( I guess, any CO book should have this. Maurice Bach talks about user and kernel stacks)
e) What all are shared by parent and child processes immediatelyafter parent executes a fork system call? Cross questioned about the 'copy on write' facility and 'dup' system call.--- again see MB, and also Stevens' 2nd chapter.
f) What events happen when the following command is given?cat /etc/passwd more---- Describe how the shell forks the two processes and how the pipe gets created between them. Cross question: How does 'cat' know that its output has to be written into the pipe and not into standard o/p?
g) Have you written any TSR's? --- No. What are TSR? ----Terminate but stay resident programs. Then does it mean DOS is a multitasking system?---- No, TSRs are interrupt driven
h) How are Windows programs different from normal C-programs?---- Windows programs are event driven. What can be the various types of events? --- See Primer/API bible.
i) Difference between swapping and paging.---- Swapping is moving entire processes between main memory and hard disk. Paging is moving individual pages of a process.
j) Write a program to list all palindromes in a string.
Hint: use a stack and some extra storage for remembering previous palindromes.
k) What's the outout?
char *cp;
int *ip;
cp=(char *)0x100;
ip=(int *)cp;
ip++;
cp++;
printf("cp = %x ip = %x", cp, ip);
Ans:cp = 0x101 ip = 0x102
l) What are static variables and functions? There are two files,say, file1 and file2. file1 has a global declaration static int x; file2 has a global declarationint y; What is the difference between the two types of declarations when you link file1 and file2?--- x is local to functions in file1 and cannot be seen by functions in file2. y can be seen by functions in both file1 and file2.
m) How does a debugger set breakpoints in a code you are debugging?---- some funda regarding insertion if an interrupt instruction in the code....don't know for sure. This was followed by a shady psychological test. You are given a set of six pictures. Look at each picture and write a story on each.

Second interview:
(fully personal --- more interesting;-)
a) What did you feel about the ppt? --- wasn't very impressive
b) Have you heard of creativity? -- Ya. Have you heard of Bernard Shaw? -- Ya. (Then he rattled off some quote of BS regarding creativity) What do you say? --- I put some shadiest fundaes regarding visionaries and Leonardo da Vinci conceptualising Helicopters in his time!************************************************************************

NOTE: If you have been offered a job previously by any other company after your BTech/BE or if you have even slightest of work experience then make it a point to mention about it. It is a major plus point. The interviewers will be definitely interested in knowing that some other company also found you good enough to be selected.

HCL PLACEMENT PAPER 4 interview-questions

DOWNLOAD HCL TECHNOLOGIES COLLEGE CAMPUS PREVIOUS PLACEMENT QUESTION PAPERS AND HR INTERVIEW QUESTIONS HERE: KEEP WATCHING FOR MORE PAPERS::

HCL TECHNOLOGIES Paper Model:

Section I: computer awareness(i.e general things about computer)
Q.15
-ve marks -1/4
Section II: Simple C- language Q. 15 & -ve marks: -1/4
Section III: On pointers & structures
and C++,JAVA( only 1 on this) Q.10 each quetion ->2 marks

-ve marks: -1
Section IV: Analytical Q.20 each quetion -> 2 marks.

-ve marks: -1/4

SECTION-I

1). Piggy backing is a technique for
a) Flow control b) sequence c) Acknowledgement d) retransmition
ans: c piggy backing

2). The layer in the OST model handles terminal emulation
a) session b) application c) presentation d) transport
ans: b application

3) ans: a odd numbers of errors

4)Q. In signed magnitude notation what is the minimum value that
can be represented with 8 bits
a) -128 b) -255 c) -127 d) 0

5) c 20

6) a 120

7) b synchronise the access

8) a system call

9) b the operating system

10) a 177333

11) d used as a network layer protocall in network and windows system
12) b has to be unique in the sub network

13)Q. there is an employer table with key feilds as employer no. data in every n'th row are needed for a simple following queries will get required results.

a) select A employee no. from employee A , where exists from employee B where A employee no. >= B employee having (count(*) mod n)=0
b) select employee no. from employee A, employee B where A employee no.>=B employee no. grouply employee no. having(count(*) mod n=0 )
c) both a& b
d)none of the above

14)Q. type duplicates of a row in a table customer with non uniform key feild customer no. you can see
a) delete from costomer where customer no. exists ( select distinct customer no. from customer having count )
b) delete customer a where customer no. in b rowid
c) delete customer a where custermor no. in ( select customer no. from customer a, customer b )
d) none of the above

15) c Volatile modifier

---------- Section I over with 15 quetions -------------------


SECTION-II


Section II is not covered completly But it is easy
1) ans: recursion
2) long int size
a) 4 bytes b) 2 bytes c) compiler dependent d) 8 bytes
ans: compiler dependent
note: order of a,b,c,d are doubt but answer is correct.

3) x=2,y=6,z=6
x=y==z;
printf(%d",x) ?

4) if(x>2)?3:4

5)

6)

7) ans: c 6 ( quetion on enum )

8) ----
---
---
--
14) c : class A,B and C can have member functions with same name.

15) ans: d none of the above

SECTION-III

1) ans: b It does not work when rp is the last element in the
linked list

2) ans: a always

3) ans: b 13

4) ans: b 16

5) ans: d 55,55

6) ans: c 5,10,10,3

7) ---

8) ans:d 4

9) ans: c 5

10)ans: c semicolon missing

SECTION-IV

following are not in order:

2. M > D > Y ans: (a)

6. 10 in 4 seconds,
? in 6 minutes = 10x6x60/4 = 900 ans: (a)

7. a=2, b=4, c=5
(a+b)/c - c/(a+b) = 11/30 (ans).

8. 100(100000000+100000000)/10000 = 2x1000000 (ans).

9. what does the hexanumber E78 in radix 7.
(a) 12455 (b) 14153 (c) 14256 (d) 13541 (e) 131112 ans: (d)

10. Q is not equal to zero and k = (Q x n - s)/2 find n?
(a) (2 x k + s)/Q (b) (2 x s x k)/Q (c) (2 x k - s)/Q
(d) (2 x k + s x Q)/Q (e) (k + s)/Q


(from GRE book page no:411)
data:
A causes B or C, but not both
F occurs only if B occurs
D occurs if B or C occurs
E occurs only if C occurs
J occurs only if E or F occurs
D causes G,H or both
H occurs if E occurs
G occurs if F occurs

NOTE: check following answers.

11. If A occurs which of the following must occurs

I. F & G
II. E and H
III. D
(a) I only (b) II only (c) III only (d) I,II, & III
(e) I & II (or) II & III but not both ans: (e)

12. If B occurs which must occur
(a) D (b) D and G (c) G and H (d) F and G (e) J ans: (a)

13. If J occurs which must have occured
a) E (b) either B or C (c) both E & F (d) B (e) both B & C ans: (b)

14. which may occurs as a result of cause not mentioned
(1) D (2) A (3) F
(a) 1 only (b) 2 only (c) 1 & 2 (d) 2 & 3 (e) 1,2,3 ans: (c)

15. E occurs which one cannot occurs
(a) A (b) F (c) D (d) C (e) J ans: (b)

11 to 15:- ----------- e , a , b , c , b ---------------

Below are in order:
16. to 20. answers:
e
a
c
a

BEST OF LUCK FOR YOUR PLACEMENT PAPER AND HR INTERVIEW !

In written test in each section you have to get minimum marks i.e you have to pass in each section. There will be questions from C, C++, JAVA. about 10 questions in C++ in the written test. Keep Watching for hundreds of more previous papers of entrance exams, school board exam question papers, news and info, and IT and other companies placement papers and HR interview questions.

HCL PLACEMENT PAPER 5 interview-questions

DOWNLOAD HCL TECHNOLOGIES COLLEGE CAMPUS PREVIOUS PLACEMENT QUESTION PAPERS AND HR INTERVIEW QUESTIONS HERE: KEEP WATCHING FOR MORE PAPERS:: PRESS CTRL + D TO BOOKMARK THIS SITE

HCL 1995 PLACEMENT PAPER -
HCL-HP

This is a very good question bank for written test of some software companies.
Optimize the below 1,2,3,4 questions for time:

1)
int i;
if i=0 then i:=1;
if i=1 then i:=0;

2)
int i;
if i=0 then i:=1;
if i=1 then i:=0;
(given that i can take only two values (1,0))

3)
int i;
if i=0 then i:=1;
else if i=1 then i:=0;
(given that i can take only two values (1,0))

4)
int m,j,i,n;
for i:=1 to n do
m:=m+j*n

5) Expand the following
a) ISDN
b) CASE
c) CSMA/CD
d) OOPS
e) MIMD

6) In the following questions, answer A,B,C,D depending on when the errors are detected?
A if no error is detected
B if semantic and syntactic checking
C if during Code genration & Symbol allocation
D run time

a) Array overbound
b) Undeclared identifier
c) stack underflow
d) Accessing an illegal memory location

7) How many page faults will occur for below sequence of pages when LRU page replacement algorithm is used ( The memory can only have 3pages):
1,2,3,4,2,1,5,2,4 (something like that)

8) If a CPU has 20 address lines but MMU does'nt use two of them. OS occupies 20K. No virtual memory is supported. What is the maximum memory available for a user program?

9) For a binary tree with n nodes, How many nodes are there which
has got both a parent and a child?

10) Understand the funda of incrementing a variable using val++ and ++val . Some programs are given for error correction.

11) Learn datagram . (Computer networks)

12) Which of the following can be zero? (only one)
a) swap space
b) physical memory
c) virtual memory

13) What is a must for multitasking?
a) Process preemption
b) Paging
c) Virtual memory
d) None of the above

14) A question on call by value,
call by name,
call by reference.

f(x,y,z)
{
y := y+1;
z := z+x;
}
main()
{
int a,b;
a := 2
b := 2;
f(a+b,a,a);
print a;
}

what is the value of a printed for three different calls in main.

15) Using the following instructions and two registers , A&B. find out A XOR B and put the result in A
PUSH
POP
NOR These instructions operates with A & B and puts the result in
AND A

(question basically to get XOR in terms of NOR and AND)

16) True/False questions:
1) The page size should be the power of 2.
2)

17)
int i=0;
int j=0;
loop:
if(i = 0)
i++;
i++;
j++;
if(j<= 25) goto loop xxx: question1 : how many times is the loop entered A few questions of that sort. some count fundaes. Easy ones 18) Who handles page faults? a) OS b) MMU c) Hardware logic d) etc etc.... 19) For which of following is it not possible to write an algorithm. a) To find out 1026th prime number b) To write program for NP-complete problem c) To write program which generates true Random numbers. etc... 20) what is the essential requirement for an real-time systems a) pre-emption b) virtual memory c) paging etc... Keep watching http://www.previouspapers.blogspot.com/ for more placement papers of lots of companies and previous years question papers of entrance exams like cat, mat, medical entrance exams, school board previous years solved and unsolved question papers of cbse, icse, and lots of other papers.. PRESS CTRL + D TO BOOKMARK THIS SITE Keep watching for hundreds of more previous placement papers of various it and other companeis..

MICROSOFT PLACEMENT PAPER 1 interview-questions

MICROSOFT Placement and HR interview previous question papers :

MICROSOFT INTERVIEW AT HYDERABAD

These are some of the questions asked in Microsoft Hyd Interview

X 1)reverse the given n-bit unsigned integer?
I mean if 1011 is the i/p then o/p=1101
Time copmlexity should be as small as possible...

X 2)Given 10 points, Asked me to arrange those 10 points so that
I have to draw five straight lines and each straight line should
have 4-points

X 3) write Open Hashing code with doubly linked list

X 4)To see my coding style asked me to write linked list reversal program

5)Asked About My Project...(about 1hour)

6)Given an Array of integers as the input asked me to find out
smallest subset of the array such that the sum of the all the elements
of that subset array should be maximum...in all the subsets...

X7)To Give design aspects of writting a software for a car which will
be driven by the blind people.

X 8)Given a character array which has one word asked me to reverse that word.

X 9)Given a character array which has "x" no of words, asked me to reverse them

10)Asked me to write all the test cases for the above.

X 11)A Desert has 1000KM legnth, A Camel and 3000 bananas are there at one end
problem is you have to get as many bananas as possible to the other end
by that camel.
camel constraints...
1) It will eat 1 banana for each kilometer even if it
is not carrying any bananas(i.e it needs on banana
for just to walk 1km)
2) It cannot carry more than 1000 bananas.

12) Given a two dimensional array of size mxn, Problem is to take each
and every cell, as there are 8 directions to travel from that cell
one right, two left, three up, four down, other four are through
four diagnols. except at the boundaries(<> print all ths words.

13) write all the different test cases for the above....

14) One function which was written by somebody else? that function spec
says the following.

takes a two dimensional array as the input which has "N" no of words
and "M" no of non-words...
that function returns the no of words.

given two cases of inputs...
1) array has 32words and 32 non words]
2) array has 30 wrods and 34 non words
out of these two which case is better and why?

15) Given the Robo which has PC interface via the following 3 functions

1) bool is_ther_any_step(bool);
sees any step above if the argument is true and returns true
if step exists above ti it.
sees any step below to it if the argument is false and returns
appropriately..

2) goto_next_step(bool )
Goes to next upper step if the argument is true
if the argument is true and no above step then robo gets damaged

Goes to down step if the argument is false...

3) Clean_floor()...
cleans that step by pouring water,cleaning and drying..

write the program to clean a stair case in any building...

tricky problem
-------------------------------------------------------------------------------

Keep watching www.previouspapers.blogspot.com for more entrance, school boards, companies and hr interview placement questions previous papers. Good Luck!!

PLACEMENT PAPER 2 Interview Questions

Microsoft Interview Questions
The following are actual questions from actual interviews conducted by Microsoft employees on the main campus.
Microsoft Consultants are sometimes allowed to have a life, so questions asked of them during interviews don't really count and aren't listed. The questions tend to follow some basic themes: Riddles
Algorithms
Applications
Thinkers
Riddles
Why is a manhole cover round?
How many cars are there in the USA? (A popular variant is "How many gas stations are there in the USA?")
How many manhole covers are there in the USA?
You've got someone working for you for seven days and a gold bar to pay them. The gold bar is segmented into seven connected pieces. You must give them a piece of gold at the end of every day. If you are only allowed to make two breaks in the gold bar, how do you pay your worker? One train leaves Los Angeles at 15mph heading for New York. Another train leaves from New York at 20mph heading for Los Angeles on the same track. If a bird, flying at 25mph, leaves from Los Angeles at the same time as the train and flies back and forth between the two trains until they collide, how far will the bird have traveled?
Imagine a disk spinning like a record player turn table. Half of the disk is black and the other is white. Assume you have an unlimited number of color sensors. How many sensors would you have to place around the disk to determine the direction the disk is spinning? Where would they be placed?
Imagine an analog clock set to 12 o'clock. Note that the hour and minute hands overlap. How many times each day do both the hour and minute hands overlap? How would you determine the exact times of the day that this occurs?
You have two jars, 50 red marbles and 50 blue marbles. A jar will be picked at random, and then a marble will be picked from the jar. Placing all of the marbles in the jars, how can you maximize the chances of a red marble being picked? What are the exact odds of getting a red marble using your scheme?
Pairs of primes separated by a single number are called prime pairs.
Examples are 17 and 19.
Prove that the number between a prime pair is always divisible by 6 (assuming both numbers in the pair are greater than 6). Now prove that there are no 'prime triples.'
There is a room with a door (closed) and three light bulbs. Outside the room there are three switches, connected to the bulbs. You may manipulate the switches as you wish, but once you open the door you can't change them. Identify each switch with its bulb.
Suppose you had 8 billiard balls, and one of them was slightly heavier, but the only way to tell was by putting it on a scale against another. What's the fewest number of times you'd have to use the scale to find the heavier ball?
Imagine you are standing in front of a mirror, facing it. Raise your left hand. Raise your right hand. Look at your reflection. When you raise your left hand your reflection raises what appears to be his right hand. But when you tilt your head up, your reflection does too, and does not appear to tilt his/her head down. Why is it that the mirror appears to reverse left and right, but not up and down?
You have 4 jars of pills. Each pill is a certain weight, except for contaminated pills contained in one jar, where each pill is weight + 1. How could you tell which jar had the contaminated pills in just one measurement?
The SF Chronicle has a word game where all the letters are scrambled up and you have to figure out what the word is. Imagine that a scrambled word is 5 characters long: How many possible solutions are there? What if we know which 5 letters are being used? Develop an algorithm to solve the word.
There are 4 women who want to cross a bridge. They all begin on the same side. You have 17 minutes to get all of them across to the other side. It is night. There is one flashlight. A maximum of two people can cross at one time. Any party who crosses, either 1 or 2 people, must have the flashlight with them. The flashlight must be walked back and forth, it cannot be thrown, etc. Each woman walks at a different speed. A pair must walk together at the rate of the slower woman's pace.
Woman 1: 1 minute to cross
Woman 2: 2 minutes to cross
Woman 3: 5 minutes to cross
Woman 4: 10 minutes to cross
For example if Woman 1 and Woman 4 walk across first, 10 minutes have elapsed when they get to the other side of the bridge. If Woman 4 then returns with the flashlight, a total of 20 minutes have passed and you have failed the mission. What is the order required to get all women across in 17 minutes? Now, what's the other way?
If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts?
You have a bucket of jelly beans. Some are red, some are blue, and some green. With your eyes closed, pick out 2 of a like color. How many do you have to grab to be sure you have 2 of the same?
If you have two buckets, one with red paint and the other with blue paint, and you take one cup from the blue bucket and poor it into the red bucket. Then you take one cup from the red bucket and poor it into the blue bucket. Which bucket has the highest ratio between red and blue? Prove it mathematically.

MICROSOFT PLACEMENT PAPER INTERVIEW QUESTIONS
NEXT PAGE>>

MICROSOFT PLACEMENT PAPER 3 interview-questions

MICROSOFT COLLEGE CAMPUS PLACEMENT PAPERS AND HR INTERVIEW QUESTIONS

Algorithms

What's the difference between a linked list and an array? Implement a linked list. Why did you pick the method you did? Implement an algorithm to sort a linked list. Why did you pick the method you did? Now do it in O(n) time.

Describe advantages and disadvantages of the various stock sorting algorithms.

Implement an algorithm to reverse a linked list. Now do it without recursion.

Implement an algorithm to insert a node into a circular linked list without traversing it.

Implement an algorithm to sort an array. Why did you pick the method you did?

Implement an algorithm to do wild card string matching.

Implement strstr() (or some other string library function). Reverse a string. Optimize for speed. Optimize for space.

Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris is name My." Optimize for speed. Optimize for space.Find a substring. Optimize for speed. Optimize for space.

Compare two strings using O(n) time with constant space.

Suppose you have an array of 1001 integers. The integers are in random order, but you know each of the integers is between 1 and 1000 (inclusive). In addition, each number appears only once in the array, except for one number, which occurs twice. Assume that you can access each element of the array only once. Describe an algorithm to find the repeated number. If you used auxiliary storage in your algorithm, can you find an algorithm that does not require it?

Count the number of set bits in a number. Now optimize for speed. Now optimize for size. Multiple by 8 without using multiplication or addition. Now do the same with 7. Add numbers in base n (not any of the popular ones like 10, 16, 8 or 2 -- I hear that Charles Simonyi, the inventor of Hungarian Notation, favors -2 when asking this question).

Write routines to read and write a bounded buffer. Write routines to manage a heap using an existing array.

Implement an algorithm to take an array and return one with only unique elements in it.

Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Now speed it up. Now test it.

Implement an algorithm to print out all files below a given root node. Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date. How would you find a cycle in a linked list?

Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints.

The following asm block performs a common math function, what is it? cwd xor ax, dxsub ax, dx

Imagine this scenario: I/O completion ports are communictaions ports which take handles to files, sockets, or any other I/O. When a Read or Write is submitted to them, they cache the data (if necessary), and attempt to take the request to completion. Upon error or completion, they call a user-supplied function to let the users application know that that particular request has completed. They work asynchronously, and can process an unlimited number of simultaneous requests. Design the implementation and thread models for I/O completion ports. Remember to take into account multi-processor machines.

Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value.

Write a function to print all of the permutations of a string. Implement malloc.

Write a function to print the Fibonacci numbers.

Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B. How would you write qsort? How would you print out the data in a binary tree, level by level, starting at the top?

Applications

How can computer technology be integrated in an elevator system for a hundred story office building? How do you optimize for availability?

How would variation of traffic over a typical work week or floor or time of day affect this?

How would you implement copy-protection on a control which can be embedded in a document and duplicated readily via the Internet?

Define a user interface for indenting selected text in a Word document. Consider selections ranging from a single sentence up through selections of several pages. Consider selections not currently visible or only partially visible.

What are the states of the new UI controls? How will the user know what the controls are for and when to use them?

How would you redesign an ATM?

Suppose we wanted to run a microwave oven from the computer. What kind of software would you write to do this?

What is the difference between an Ethernet Address and an IP address?

How would you design a coffee-machine for an automobile.

If you could add any feature to Microsoft Word, what would it be?

How would you go about building a keyboard for 1-handed users?

How would you build an alarm clock for deaf people?

Thinkers How are M&Ms made?

If you had a clock with lots of moving mechanical parts, you took it apart piece by piece without keeping track of the method of how it was disassembled, then you put it back together and discovered that 3 important parts were not included; how would you go about reassembling the clock?

If you had to learn a new computer language, how would you go about doing it?

You have been assigned to design Bill Gates bathroom. Naturally, cost is not a consideration. You may not speak to Bill. What was the hardest question asked of you so far today?

If MS told you we were willing to invest $5 million in a start up of your choice, what business would you start? Why?

If you could gather all of the computer manufacturers in the world together into one room and then tell them one thing that they would be compelled to do, what would it be?

Explain a scenario for testing a salt shaker.

If you are going to receive an award in 5 years, what is it for and who is the audience?

How would you explain how to use Microsoft Excel to your grandma?

Why is it that when you turn on the hot water in any hotel, for example, the hot water comes pouring out almost instantaneously?

Why do you want to work at Microsoft?

Suppose you go home, enter your house/apartment, hit the light switch, and nothing happens - no light floods the room. What exactly, in order, are the steps you would take in determining what the problem was?

Interviewer hands you a black pen and says nothing but "This pen is red."

MICROSOFT PLACEMENT PAPER 4 interview-questions

MICROSOFT PREVIOUS COLLEGE CAMPUS PLACEMENT PAPERS AND HR INTERVIEW QUESTIONS:

ANALYTICAL QUES
(Avg. of 343 ) :
If you had an infinite supply of water and a 5 quart and 3 quart pail, how would you measure exactly 4 quarts?
(Avg. of 122 ) : If you could remove any of the 50 states, which state would it be and why?
(Avg. of 78 ) : If you are on a boat and you throw out a suitcase, will the level of water increase? (Avg. of 87 ) : There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner. What is the probability that they don't collide?
(Avg. of 50 ) : Three men were renting a motel figuring the room cost 30 dollars they would pitch in ten a piece.The room was only 25 so they each gave the bell boy ten,(tip)the bellboy didn"t think that would be fair so he gave them each back 1 dollar and kept 2 for himself.What happened to the other dollar?++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++++==C++ QUES :(Avg. of 1423 ) : What is Operator, Operand, Expression, Statement in 'C'?
(Avg. of 364 ) : What is polymorphism? Rate it: View Answers (Avg. of 84 ) : What is operator overloading?
(Avg. of 55 ) : What are templates?
(Avg. of 72 ) : Declare a void pointer.
(Avg. of 50 ) : Declare a function pointer which takes a pointer to char as an argument and returns a void pointer.
(Avg. of 31 ) : Type-define a function pointer which takes a int and float as parameter and returns a float *.
(Avg. of 94 ) : What does the following C statement do? while(*c++ = *d++); assuming c and d are pointers to characters.
(Avg. of 52 ) : How do you call a C module within a C++ module.
(Avg. of 54 ) : What is the difference between run time binding and compile time binding? Discuss.
(Avg. of 20 ) : Compare and contrast C++ and Java.
(Avg. of 23 ) : Why does C/C++ give better run-time performance then Java?
(Avg. of 14 ) : Does C++ come with in-built threading support.
(Avg. of 19 ) : Class A derives B derives C. All have foo(). I cast C to A and call foo(). What happens?
(Avg. of 27 ) : All classes A, B, C have default constructor, foo() that calls parent foo() and allocates 100 bytes to their own private local variable, and a destructor that frees the 100 bytes. I create a C object and then destroy it. What's the problem? Did all the memory get freed? What if I create C, cast to A, and then destroy it. How would I make sure memory is freed? (destructor must be "virtual" and each destructor must call parent destructor)
(Avg. of 26 ) : What errors are caught at compile time vs link time?
(Avg. of 30 ) : What is the value of "a" after this?int (*a) [10];a++;
(Avg. of 45 ) : What is wrong with this?main(){int *ptr;*ptr=10;}
(Avg. of 39 ) : Given int n, i=10, j=20, x=3, y = 100; What is the value of n and y at the end of each of the following expressions?a) n = (i > j) && (x < ++y);b) n = (j - i) && (x < y++);c) n = (i < j) (y+=i);
(Avg. of 34 ) : int x = 5; int y = 7; What is the value of x and y after the expression y+=x++;
(Avg. of 58 ) : What's the difference between C and C++?
(Avg. of 21 ) : What does Public and Private mean in C++
(Avg. of 59 ) : Is it possible to keep 2 stacks in a single array, if one grows from position one of the array, and the other grows from the last position. Write a procedure PUSH(x,s) that pushes element x onto stack S, where S is one or the other of these two stacks. Include all necessary error

MICROSOFT PLACEMENT PAPER 5 interview-questions

DOWNLOAD MICROSOFT PREVIOUS YEARS COLLEGE CAMPUS PLACEMENT PAPES AND HR INTERVIEW QUESTIONS

JAVA QUESTIONS N ANSWERS
Java Questions & Answers
(Avg. of 487 ) : What is the difference between an Applet and an Application?
(Avg. of 133 ) : What are java beans? Rate it: View Answers (Avg. of 57 ) : What is RMI?
(Avg. of 28 ) : What gives java it's "write once and run anywhere" nature?
(Avg. of 33 ) : What are native methods? How do you use them?
(Avg. of 26 ) : How does Java inheritance wor?k
(Avg. of 58 ) : How many different types of JDBC drivers are present? Discuss them.
(Avg. of 36 ) : What does the "static" keyword mean in front of a variable? A method? A class? Curly braces {}?
(Avg. of 34 ) : Class A subclass B subclass C. All override foo(). I cast C to A and call foo(). What happens? Can C call A->foo()?
(Avg. of 19 ) : Access specifiers: "public", "protected", "private", nothing?
(Avg. of 18 ) : What does the "final" keyword mean in front of a variable? A method? A class?
(Avg. of 28 ) : Does Java have "goto"?
(Avg. of 34 ) : Why "bytecode"? Can you reverse-engineer the code from bytecode?
(Avg. of 31 ) : How does exception handling work in Java?
(Avg. of 64 ) : Does Java have destructors?

MICROSOFT PLACEMENT PAPER 6 interview-questions

DOWNLOAD MICROSOFT COLLEGE CAMPUS PREVIOUS YEARS QUESTION PAPERS AND HR INTERVIEW QUESTIONS

DATABASES QUES N ANS
What are two methods of retrieving SQL?
(Avg. of 588 ) : What cursor type do you use to retrieve multiple recordsets?
(Avg. of 35 ) : What action do you have to perform before retrieving data from the next result set of a stored procedure?
(Avg. of 36 ) : What is the basic form of a SQL statement to read data out of a table?
(Avg. of 29 ) : What structure can you have the database make to speed up table reads?
(Avg. of 16 ) : What is a "join"?
(Avg. of 17 ) : What is a "constraint"?
(Avg. of 11 ) : What is a "primary key"?
(Avg. of 11 ) : What is a "functional dependency"? How does it relate to database table design?
(Avg. of 15 ) : What is a "trigger"?
(Avg. of 7 ) : What is "index covering" of a query?
(Avg. of 42 ) : What is a SQL view?

MICROSOFT PLACEMENT PAPER 7 interview-questions

Algorithms and Programming
1. Given a rectangular (cuboidal for the puritans) cake with a rectangular piece removed (any size or orientation), how would you cut the remainder of the cake into two equal halves with one straight cut of a knife ?
2. You're given an array containing both positive and negative integers and required to find the sub-array with the largest sum (O(N) a la KBL). Write a routine in C for the above.
3. Given an array of size N in which every number is between 1 and N, determine if there are any duplicates in it. You are allowed to destroy the array if you like. [ I ended up giving about 4 or 5 different solutions for this, each supposedly better than the others ].
4. Write a routine to draw a circle (x ** 2 + y ** 2 = r ** 2) without making use of any floating point computations at all. [ This one had me stuck for quite some time and I first gave a solution that did have floating point computations ].
5. Given only putchar (no sprintf, itoa, etc.) write a routine putlong that prints out an unsigned long in decimal. [ I gave the obvious solution of taking % 10 and / 10, which gives us the decimal value in reverse order. This requires an array since we need to print it out in the correct order. The interviewer wasn't too pleased and asked me to give a solution which didn't need the array ]. 6. Give a one-line C expression to test whether a number is a power of 2. [No loops allowed - it's a simple test.]
7. Given an array of characters which form a sentence of words, give an efficient algorithm to reverse the order of the words (not characters) in it.
8. How many points are there on the globe where by walking one mile south, one mile east and one mile north you reach the place where you started.
9. Give a very good method to count the number of ones in a "n" (e.g. 32) bit number. ANS. Given below are simple solutions, find a solution that does it in log (n) steps.

MICROSOFT PLACEMENT PAPER 8 interview-questions

Iterative
function iterativecount (unsigned int n)
begin
int count=0;
while (n)
begin
count += n & 0x1 ;
n >>= 1;
end
return count;
end

Sparse Count

function sparsecount (unsigned int n)
begin
int count=0;
while (n)
begin
count++;
n &= (n-1);
end
return count ;
end

10. What are the different ways to implement a condition where the value of x can be either a 0 or a 1. Apparently the if then else solution has a jump when written out in assembly. if (x == 0) y=a else y=b There is a logical, arithmetic and a data structure solution to the above problem.

11. Reverse a linked list.

12. Insert in a sorted list

13. In a X's and 0's game (i.e. TIC TAC TOE) if you write a program for this give a fast way to generate the moves by the computer. I mean this should be the fastest way possible.
The answer is that you need to store all possible configurations of the board and the move that is associated with that. Then it boils down to just accessing the right element and getting the corresponding move for it. Do some analysis and do some more optimization in storage since otherwise it becomes infeasible to get the required storage in a DOS machine.

14. I was given two lines of assembly code which found the absolute value of a number stored in two's complement form. I had to recognize what the code was doing. Pretty simple if you know some assembly and some fundaes on number representation.

15. Give a fast way to multiply a number by 7.

16. How would go about finding out where to find a book in a library. (You don't know how exactly the books are organized beforehand).

17. Linked list manipulation.

18. Tradeoff between time spent in testing a product and getting into the market first.

19. What to test for given that there isn't enough time to test everything you want to.

20. First some definitions for this problem: a) An ASCII character is one byte long and the most significant bit in the byte is always '0'. b) A Kanji character is two bytes long. The only characteristic of a Kanji character is that in its first byte the most significant bit is '1'. Now you are given an array of a characters (both ASCII and Kanji) and, an index into the array. The index points to the start of some character. Now you need to write a function to do a backspace (i.e. delete the character before the given index).

21. Delete an element from a doubly linked list.

22. Write a function to find the depth of a binary tree.

23. Given two strings S1 and S2. Delete from S2 all those characters which occur in S1 also and finally create a clean S2 with the relevant characters deleted.

24. Assuming that locks are the only reason due to which deadlocks can occur in a system. What would be a foolproof method of avoiding deadlocks in the system.

25. Reverse a linked list.
Ans: Possible answers -
iterative loop
curr->next = prev;
prev = curr;
curr = next;
next = curr->next
endloop

recursive reverse(ptr)
if (ptr->next == NULL)
return ptr;
temp = reverse(ptr->next);
temp->next = ptr;
return ptr;
end

26. Write a small lexical analyzer - interviewer gave tokens. expressions like "a*b" etc.

27. Besides communication cost, what is the other source of inefficiency in RPC? (answer : context switches, excessive buffer copying). How can you optimize the communication? (ans : communicate through shared memory on same machine, bypassing the kernel _ A Univ. of Wash. thesis)

28. Write a routine that prints out a 2-D array in spiral order!

29. How is the readers-writers problem solved? - using semaphores/ada .. etc.

30. Ways of optimizing symbol table storage in compilers.

31. A walk-through through the symbol table functions, lookup() implementation etc. - The interviewer was on the Microsoft C team.

32. A version of the "There are three persons X Y Z, one of which always lies".. etc..

33. There are 3 ants at 3 corners of a triangle, they randomly start moving towards another corner.. what is the probability that they don't collide.

34. Write an efficient algorithm and C code to shuffle a pack of cards.. this one was a feedback process until we came up with one with no extra storage.

35. The if (x == 0) y = 0 etc..

36. Some more bitwise optimization at assembly level

37. Some general questions on Lex, Yacc etc.

38. Given an array t[100] which contains numbers between 1..99. Return the duplicated value. Try both O(n) and O(n-square).

39. Given an array of characters. How would you reverse it. ? How would you reverse it without using indexing in the array.

40. Given a sequence of characters. How will you convert the lower case characters to upper case characters. ( Try using bit vector - solutions given in the C lib -typec.h)

41. Fundamentals of RPC.

42. Given a linked list which is sorted. How will u insert in sorted way.

43. Given a linked list How will you reverse it.

44. Give a good data structure for having n queues ( n not fixed) in a finite memory segment. You can have some data-structure separate for each queue. Try to use at least 90% of the memory space.

45. Do a breadth first traversal of a tree.

46. Write code for reversing a linked list.

47. Write, efficient code for extracting unique elements from a sorted list of array. e.g. (1, 1, 3, 3, 3, 5, 5, 5, 9, 9, 9, 9) -> (1, 3, 5, 9).

48. Given an array of integers, find the contiguous sub-array with the largest sum. ANS. Can be done in O(n) time and O(1) extra space. Scan array from 1 to n. Remember the best sub-array seen so far and the best sub-array ending in i.

49. Given an array of length N containing integers between 1 and N, determine if it contains any duplicates. ANS. [Is there an O(n) time solution that uses only O(1) extra space and does not destroy the original array?]

50. Sort an array of size n containing integers between 1 and K, given a temporary scratch integer array of size K. ANS. Compute cumulative counts of integers in the auxiliary array. Now scan the original array, rotating cycles! [Can someone word this more nicely?] *

51. An array of size k contains integers between 1 and n. You are given an additional scratch array of size n. Compress the original array by removing duplicates in it. What if k << n? ANS. Can be done in O(k) time i.e. without initializing the auxiliary array!

52. An array of integers. The sum of the array is known not to overflow an integer. Compute the sum. What if we know that integers are in 2's complement form? ANS. If numbers are in 2's complement, an ordinary looking loop like for(i=total=0;i< n;total+=array[i++]); will do. No need to check for overflows!

53. An array of characters. Reverse the order of words in it. ANS. Write a routine to reverse a character array. Now call it for the given array and for each word in it. *

54. An array of integers of size n. Generate a random permutation of the array, given a function rand_n() that returns an integer between 1 and n, both inclusive, with equal probability. What is the expected time of your algorithm? ANS. "Expected time" should ring a bell. To compute a random permutation, use the standard algorithm of scanning array from n downto 1, swapping i-th element with a uniformly random element <= i-th. To compute a uniformly random integer between 1 and k (k < n), call rand_n() repeatedly until it returns a value in the desired range.

55. An array of pointers to (very long) strings. Find pointers to the (lexicographically) smallest and largest strings. ANS. Scan array in pairs. Remember largest-so-far and smallest-so-far. Compare the larger of the two strings in the current pair with largest-so-far to update it. And the smaller of the current pair with the smallest-so-far to update it. For a total of <= 3n/2 strcmp() calls. That's also the lower bound.

56. Write a program to remove duplicates from a sorted array. ANS. int remove_duplicates(int * p, int size) { int current, insert = 1; for (current=1; current < size; current++) if (p[current] != p[insert-1]) { p[insert] = p[current]; current++; insert++; } else current++; return insert; }

57. C++ ( what is virtual function ? what happens if an error occurs in constructor or destructor. Discussion on error handling, templates, unique features of C++. What is different in C++, ( compare with unix).

58. Given a list of numbers ( fixed list) Now given any other list, how can you efficiently find out if there is any element in the second list that is an element of the first list (fixed list).

59. Given 3 lines of assembly code : find it is doing. IT was to find absolute value.

60. If you are on a boat and you throw out a suitcase, Will the level of water increase.

61. Print an integer using only putchar. Try doing it without using extra storage.

62. Write C code for (a) deleting an element from a linked list (b) traversing a linked list

63. What are various problems unique to distributed databases

64. Declare a void pointer ANS. void *ptr;

65. Make the pointer aligned to a 4 byte boundary in a efficient manner ANS. Assign the pointer to a long number and the number with 11...1100 add 4 to the number

66. What is a far pointer (in DOS)

67. What is a balanced tree

68. Given a linked list with the following property node2 is left child of node1, if node2 < node1 else, it is the right child. O PO AO BO CHow do you convert the above linked list to the form without disturbing the property. Write C code for that. O PO B/ \/ \/ \O ? O ?determine where do A and C go

69. Describe the file system layout in the UNIX OS ANS. describe boot block, super block, inodes and data layout

70. In UNIX, are the files allocated contiguous blocks of data ANS. no, they might be fragmented How is the fragmented data kept track of ANS. Describe the direct blocks and indirect blocks in UNIX file system

71. Write an efficient C code for 'tr' program. 'tr' has two command line arguments. They both are strings of same length. tr reads an input file, replaces each character in the first string with the corresponding character in the second string. eg. 'tr abc xyz' replaces all 'a's by 'x's, 'b's by 'y's and so on. ANS. a) have an array of length 26. put 'x' in array element corr to 'a' put 'y' in array element corr to 'b' put 'z' in array element corr to 'c' put 'd' in array element corr to 'd' put 'e' in array element corr to 'e' and so on. the code while (!eof) { c = getc(); putc(array[c - 'a']); }

72. what is disk interleaving

73. why is disk interleaving adopted

74. given a new disk, how do you determine which interleaving is the best a) give 1000 read operations with each kind of interleaving determine the best interleaving from the statistics

75. draw the graph with performance on one axis and 'n' on another, where 'n' in the 'n' in n-way disk interleaving. (a tricky question, should be answered carefully)

76. I was a c++ code and was asked to find out the bug in that. The bug was that he declared an object locally in a function and tried to return the pointer to that object. Since the object is local to the function, it no more exists after returning from the function. The pointer, therefore, is invalid outside.

77. A real life problem - A square picture is cut into 16 squares and they are shuffled. Write a program to rearrange the 16 squares to get the original big square.

78. int *a; char *c; *(a) = 20; *c = *a; printf("%c",*c); what is the output?

79. Write a program to find whether a given m/c is big-endian or little-endian!

80. What is a volatile variable?

81. What is the scope of a static function in C ?

82. What is the difference between "malloc" and "calloc"?

83. struct n { int data; struct n* next}node; node *c,*t; c->data = 10; t->next = null; *c = *t; what is the effect of the last statement?

84. If you're familiar with the ? operator x ? y : z you want to implement that in a function: int cond(int x, int y, int z); using only ~, !, ^, &, +, , <<, >> no if statements, or loops or anything else, just those operators, and the function should correctly return y or z based on the value of x. You may use constants, but only 8 bit constants. You can cast all you want. You're not supposed to use extra variables, but in the end, it won't really matter, using vars just makes things cleaner. You should be able to reduce your solution to a single line in the end though that requires no extra vars.

85. You have an abstract computer, so just forget everything you know about computers, this one only does what I'm about to tell you it does. You can use as many variables as you need, there are no negative numbers, all numbers are integers. You do not know the size of the integers, they could be infinitely large, so you can't count on truncating at any point. There are NO comparisons allowed, no if statements or anything like that. There are only four operations you can do on a variable. 1) You can set a variable to 0. 2) You can set a variable = another variable. 3) You can increment a variable (only by 1), and it's a post increment. 4) You can loop. So, if you were to say loop(v1) and v1 = 10, your loop would execute 10 times, but the value in v1 wouldn't change so the first line in the loop can change value of v1 without changing the number of times you loop. You need to do 3 things. 1) Write a function that decrements by 1. 2) Write a function that subtracts one variable from another. 3) Write a function that divides one variable by another. 4) See if you can implement all 3 using at most 4 variables. Meaning, you're not making function calls now, you're making macros. And at most you can have 4 variables. The restriction really only applies to divide, the other 2 are easy to do with 4 vars or less. Division on the other hand is dependent on the other 2 functions, so, if subtract requires 3 variables, then divide only has 1 variable left unchanged after a call to subtract. Basically, just make your function calls to decrement and subtract so you pass your vars in by reference, and you can't declare any new variables in a function, what you pass in is all it gets. Linked lists*

86. Under what circumstances can one delete an element from a singly linked list in constant time? ANS. If the list is circular and there are no references to the nodes in the list from anywhere else! Just copy the contents of the next node and delete the next node. If the list is not circular, we can delete any but the last node using this idea. In that case, mark the last node as dummy! *

87. Given a singly linked list, determine whether it contains a loop or not. ANS. (a) Start reversing the list. If you reach the head, gotcha! there is a loop! But this changes the list. So, reverse the list again. (b) Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. If the latter overtakes the former at any time, there is a loop! p1 = p2 = head;do {p1 = p1->next;p2 = p2->next->next;} while (p1 != p2);

88. Given a singly linked list, print out its contents in reverse order. Can you do it without using any extra space? ANS. Start reversing the list. Do this again, printing the contents.

89. Given a binary tree with nodes, print out the values in pre-order/in-order/post-order without using any extra space.

90. Reverse a singly linked list recursively. The function prototype is node * reverse (node *) ; ANS. node * reverse (node * n){node * m ;if (! (n && n -> next))return n ;m = reverse (n -> next) ;n -> next -> next = n ;n -> next = NULL ;return m ;}

91. Given a singly linked list, find the middle of the list. HINT. Use the single and double pointer jumping. Maintain two pointers, initially pointing to the head. Advance one of them one node at a time. And the other one, two nodes at a time. When the double reaches the end, the single is in the middle. This is not asymptotically faster but seems to take less steps than going through the list twice. Bit-manipulation

92. Reverse the bits of an unsigned integer. ANS. #define reverse(x) \(x=x>>16(0x0000ffff&x)<<16, x="(0xff00ff00&x)">>8(0x00ff00ff&x)<<8, x="(0xf0f0f0f0&x)">>4(0x0f0f0f0f&x)<<4, x="(0xcccccccc&x)">>2(0x33333333&x)<<2, x="(0xaaaaaaaa&x)">>1(0x55555555&x)<<1)*

93. Compute the number of ones in an unsigned integer. ANS. #define count_ones(x) \(x=(0xaaaaaaaa&x)>>1+(0x55555555&x), \x=(0xcccccccc&x)>>2+(0x33333333&x), \x=(0xf0f0f0f0&x)>>4+(0x0f0f0f0f&x), \x=(0xff00ff00&x)>>8+(0x00ff00ff&x), \x=x>>16+(0x0000ffff&x))

94. Compute the discrete log of an unsigned integer. ANS. #define discrete_log(h) \(h=(h>>1)(h>>2), \h=(h>>2), \h=(h>>4), \h=(h>>8), \h=(h>>16), \h=(0xaaaaaaaa&h)>>1+(0x55555555&h), \h=(0xcccccccc&h)>>2+(0x33333333&h), \h=(0xf0f0f0f0&h)>>4+(0x0f0f0f0f&h), \h=(0xff00ff00&h)>>8+(0x00ff00ff&h), \h=(h>>16)+(0x0000ffff&h))If I understand it right, log2(2) =1, log2(3)=1, log2(4)=2..... But this macro does not work out log2(0) which does not exist! How do you think it should be handled? *

95. How do we test most simply if an unsigned integer is a power of two? ANS. #define power_of_two(x) \ ((x)&&(~(x&(x-1))))

96. Set the highest significant bit of an unsigned integer to zero. ANS. (from Denis Zabavchik) Set the highest significant bit of an unsigned integer to zero #define zero_most_significant(h) \ (h&=(h>>1)(h>>2), \ h=(h>>2), \ h=(h>>4), \ h=(h>>8), \ h=(h>>16))

97. Let f(k) = y where k is the y-th number in the increasing sequence of non-negative integers with the same number of ones in its binary representation as y, e.g. f(0) = 1, f(1) = 1, f(2) = 2, f(3) = 1, f(4) = 3, f(5) = 2, f(6) = 3 and so on. Given k >= 0, compute f(k). Others

98. A character set has 1 and 2 byte characters. One byte characters have 0 as the first bit. You just keep accumulating the characters in a buffer. Suppose at some point the user types a backspace, how can you remove the character efficiently. (Note: You cant store the last character typed because the user can type in arbitrarily many backspaces)

99. What is the simples way to check if the sum of two unsigned integers has resulted in an overflow.

100. How do you represent an n-ary tree? Write a program to print the nodes of such a tree in breadth first order.

101. Write the 'tr' program of UNIX. Invoked as tr -str1 -str2. It reads stdin and prints it out to stdout, replacing every occurance of str1[i] with str2[i]. e.g. tr -abc -xyz to be and not to be <- input to ye xnd not to ye <- output

ABOUT IELTS interview-questions

WHAT IS THE IELTS

THE INTERNATIONAL ENGLISH LANGUAGE TESTING SYSTEM

The IELTS provides a test that grades a person's proficiency in the English language. There are 2 versions of the test: the Academic Module and the General Training Module. The Academic Module is usually for people wanting to follow an Academic Course in English and the General Training Module is usually for people wanting to follow a non-academic course or for immigration. Both modules are in four parts: listening, reading, writing and speaking.

IELTS is administered by 4 organisations:

University of Cambridge ESOL Exams
The British Council
IDP Education Australia
IELTS Australia


IELTS has been accepted as the standard international test system for English language proficiency by a whole range of institutions. These include the majority of all education establishments operating in English in Australia, Canada, the UK and New Zealand. US educational institutions are also now starting to use it. Many international immigration services also use the IELTS as well as various professional organisations including the British and Australian Medical Councils and the UK Ministry of Defence.