CPM FAQs

CPM FAQs
Topic : CPM FAQs
Venue: Newtons College of Engg. macharla
Audience: Final year engg. Students facing campus
placement interviews
Objectives: Make them aware of all the interview rounds,
concepts of C, C++, DBMS, Networking
Date: 24-08-2006
Resources used: Downloads from chetanas, vyoms, schaum's
series for C and Data structures
1. A TEST ON C was conducted. The pattern was 30 questions 30 min
2. SOME PLACEMENT SCENARIOS WERE EXPLAINED LIKE
A. CPM B. IN CAMPUS C. COMPANIES
3. C BASICS were covered.
4. C++ BASICS by MY collegue Mr. radhesham
5. CN BASICS by me
6. WEBSITES like chetanas, vyoms etc were mentioned
2. SOME SCENARIOS of placements!!!
2A. CPM 2B. IN CAMPUS 2C. COMPANIES
2A. CPM 2A.1. Written Examination 2A.2. Technical Round
2A.3. H R Round 2A.4. GD 2A.1. Written Examination 2A.1.1. Analytical/Aptitude Test 2A.1. 2.Verbal Test 2A.1. 3.Technical Test
2A.1.1. Analytical/Aptitude Test Blood Relation Problems
Percentage Problem
Train Problems
Distance Problems
Maths and Probability Problems
9) Worker W produces n units in 5 hours. Workers V and W, worker 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 (e)
Profit and loss
Pick the odd man out
Data interpretation
Data sufficiency
A if only (1) is sufficent. B if only (2) is sufficient. C if either is sufficient. D if both are sufficient. E data insufficient. 11. What fraction of his salary did Mr. Johnson put into savings last week ? 1) Last week Mr.Johnson put Rs 17 into savings. 2) Last week Mr.Johnson put 5% of his salary into savings. (A) (B) (C) (D) (E) ans. B.) only 2nd.
2A.1. 2.Verbal Test Basic vocabulary Missing Spellings,Synonyms,Antonyms,
Meanings of words like Plethora, Elude
Resources !!!
AGARWALS VERBAL AND NON-VERBAL
REASONING
www.mathsworld.com
2A.1. 3.Technical Test i. for(i=0;;i++) /* for is entry controlled loop*/ { printf(“hello”);}/* for(empty;empty;empty) true*/ a. hello… b. infinite loop c. hello d. error c constructs :- sequence, selection, Iteration(for known iterations,while,do while), Jump loops, stmt:-expr, compound, control stmts(sentinel control vs counter control)
Which of the following is true of the following program main() { char *c; int *ip; c =(char *)malloc(100);/*dynamic memory allocation malloc(),calloc()*/ ip=(int *)c; /*instead of a[200] malloc(0 reserves a block of free(ip); /* memory*/ } ans: The code functions properly releasing all the memory allocated

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) Prints : Jan..
enum is a data type
Storage class enum tag var1, var2, …,var n;
Storage class enum tag {member1, member2, …, membern;
Variables can be characterized by their data types and storage classes.storage classes refer to permanence of a variableand its scope within the program
Auto, extern, static, register
Auto is declare within a function and its scope is within the function
Extern suitable to transfer data betn two functions,global variables,f1 int I, j, f2 extern int I, j
Static permanent var within a function
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 65 65
Main(){incre();incre();incre();}incre(){char var=65; print var++ is 65 66 66
Register faster operations, like auto but dynamic
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)5
ii. IEEE standards cn session by rajesh kulkarni
iii. Ethernet Standards
iv. 8086 microprocessor
v. Pointers

2A.2. Technical Round
Virtual functions session by radhesham
Loop
Tree traversal techniques
It is a nonlinear data structure
Tree is finite set of one or more data items(nodes) such that there is a special data
item called root of the tree and its remaining data items are partitioned into number
of mutually exclusive subsets each of which is called as a subtree
Terminology :- root, node, degree of a node is the number of subtrees of a node in a
given tree,degree of a tree is the maximum degree of nodes in a given tree, nodes with
zero degree are called as ,levels,edge is connecting line,depth is the maximum level
of a tree ,Binary tree is either empty or consist of root and two disjoint binary trees
called left subtree and right subtree,maximum degree of any node in a binary tree is at
most two preorder traversal :- root, left, right
Inorder traversal :- left, root, right
postorder traversal :- left, right, root
Search techniques
Searching refers to the operation of finding the location of an item from a list.
The method which traverses the item sequentially is called linear search.
LINEAR(DATA,N,ITEM,LOC):- COMPARE DATA WITH ITEM, IF
ITEM=DATA[N+1]
BINARY SEARCH:- synonymous to telephone directory
DATA[BEG], DATA[BEG+1], … DATA[END],
MID=(INT(BEG+END)/2)
IF DATA[MID]= ITEM SEARCH IS SUCCESSFUL
IF ITEM < DATA[MID] THEN END:=MID-1 AND REPEAT
IF ITEM > DATA[MID] THEN BEG:=MID+1 AND REPEAT
HASHING :- NO COMPARISONS,LOCATION OF A DESIRED RECORD IS
COMPUTED IN ORDER TO RETRIEVE IT IN A SINGLE ACCESS FOR
EXAMPLE SUDENT RECORDS ROLL NO IS KEY WHICH CAN ACT AS AN
INDEX, HASH TABLEàBUCKETSàRECORDS HASH FUNCTION
Complexity of Algorithms
Analysis, comparison, measuring the efficiency of algorithms. M is an algorithm and
N is the size of the input data. The time and space used by the algorithm M are the
two main measures for the efficiency of M.The time is measured by counting the
number of key operations-in searching and sorting algorithms, for example, the
number of comparisons. The space is measured by counting the maximum of memory
needed by the algorithm. The complexity of an algorithm M is the function f(n) which
gives the running time and/or storage space requirement of the algorithm in terms of
the size n of the input data.
Worst case, average case, best case
Rate of growth of complexity. Logn, n, nlog n, n2,n3…,2n
Difference between structures and unions
Functions call by value and call by reference
Oops concepts
WAP to find whether a number is prime or not Sorting techniques
Quick sort, Insertion sort, Selection sort, Bubble sort,Stacks,Queues,Circular Queue, DBMS queries, Primary key, super key, candidate key, normalization
What is an Entity? It is a 'thing' in the real world with an independent existence.
What is an Entity type?
It is a collection (set) of entities that have same attributes.
What is an Entity set?
It is a collection of all entities of particular entity type in the database
What is the use o UML
2A.3. H R Round
Talk about CHICKEN GUNIYA
Why you want to join this job? why u want to do job than studiesHow many days will you work with our organisation
Why you should be considered for this job
What will be your contribution to the organisation
If the company says your team has done excellent work what will be your reaction
Why your percentage is decreasing?
Your hobbies and extracurricular activities
What are your weaknesses, strengths?
Tell about your family background
Tell the story of a movie in exactly twenty minutes, again same story in 3 minutes
2A.4. Group discussion
feedback…