Name: Degree: College: Phone: Mobile: Branch: Aggregate: Registration Number: Landline:

Date: Passing Year:

Email:

Complete Postal Address (with city and pin code):

Instructions:

1. Time to answer: 55 minutes (+ 5 minutes to review the question paper and filling up details above before start) 2. Mark all correct answers for a given question. 3. When not sure about a question either skip it or write your assumptions with the answer. 4. Please ensure that you attach your resume at the end with this answer sheet. 5. For every correct answer (+1) is allotted and every wrong answer (-1) will be applicable. 6. Please do not scribble around the questions. Please use rough sheets or the page at the end of this booklet.
About SuccessFactors SuccessFactors is the global leader in Business Execution Software. Our integrated suite of cloud-based applications is relied upon by over 3,200 customers in 168 countries to bridge the gap between business strategy and business results with improved execution. SuccessFactors solutions improve execution by optimizing people performance in three key areas: Aligning the workforce with the business strategy Attracting and retaining top talent Developing that talent to meet the current business challenge

We also deliver a comprehensive view of the workforce through robust analytics, planning and core HR applications. SuccessFactors solutions help companies execute faster and smarter, with greater insight delivering better business results than ever before. SuccessFactors has a unique culture. We are highly innovative and our products are defining new frontiers of software-as-a-service. We have extraordinary leadership and an aggressive, sales-driven culture. Founded in 2001 with offices around the world, the company employs more than 1200 people, all passionately focused on revolutionizing the future of work.
SuccessFactors has just become part of SAP - a company within the company. SuccessFactors will drive all Cloud Business globally, for all SAP - a reverse integration - and maintain our own culture, management, yet leverage all the resources, branding, and history that SAP has to offer. Truly an exciting time. SuccessFactors was acquired for $3.4Bn USD with a premium price of 52% from their then current stock price. SuccessFactors will continue to remain a stand-alone company and will now be responsible and lead the cloud HRMS applications for the SuccessFactors-SAP combined offering.

Aptitude based Questions

Q1. Find k: a/7 = b/3 = (3a-2b)/k Ans: Q2. Find x2+y2 if x-y=5, xy=66 Ans: Q3. A began business with Rs.4200. If profits were divided equally at the end of year, after how many months did B join if his contribution was Rs. 7200? Ans: Q4. At what time after 3 the angle between the hands of a clock will be 30 degrees? Ans: Q5. In an election 261 votes are cast. If there are 5 contestants then find the least number of votes a candidate requires to win?

Ans: Q6. If A gives B Rs.4, B will have twice as much as A. If B gives Rs.15 to A, he will have 10 times as much as B. Find the amounts with each of them. Ans: Q7. An outlet empties a tank which is full in 10 hrs. If inlet is open which lets water in at 8litres/minute, the outlet will take 6hours longer. Find the capacity of the tank. Ans: Q8. Find the proportion in which two kinds of tea costing Rs.3 (A)and Rs.3.30 (B) per kg are mixed up to produce a mixture of cost 3.20 per pound Ans:

Algorithms based Questions (Multiple Choice)

Q9. Give the time complexity for the given code snippet for(i=0;i<n;i++){ for(j=1;j<n;j=j*3){ } } (A) O(n/3) (B) O(n^3) (C) O(n log n) (D) None of these Q10. Suppose we are sorting an array of eight integers using quicksort, and we have just finished the first partitioning with the array looking like this: 2 5 1 7 9 12 11 10 Which statement is correct? (A) The pivot could be either the 7 or the 9. (B) The pivot could be the 7, but it is not the 9. (C) The pivot is not the 7, but it could be the 9. (D) Neither the 7 nor the 9 is the pivot. Q11. The complexity of the average case of an algorithm is (A) Much more complicated to analyze than that of worst case (B) Much more simpler to analyze than that of worst case (C) Sometimes more complicated and some other times simpler than that of worst case (D) None or above Q12. If every node u in G is adjacent to every other node v in G, A graph is said to be (A) isolated (B) complete (C) finite (D) strongly connected Q13. The indirect change of the values of a variable in one module by another module is called (A). internal change (B) inter-module change (C) side effect (D) side-module update Q14. The time factor when determining the efficiency of algorithm is measured by (A) Counting microseconds (B) Counting the number of key operations (C) Counting the number of statements (D) Counting the kilobytes of algorithm Q15. If there are 7 nodes in a binary tree then number of null pointers are? (A)10 (B) 7 (C) 8 (D) 11

Q16. Suppose we are sorting an array of eight integers using a some quadratic sorting algorithm. After four iterations of the algorithm's main loop, the array elements are ordered as shown here: 24578136 Which statement is correct? (A) The algorithm might be either selectionsort or insertionsort. (B) The algorithm might be selectionsort, but it is not insertionsort. (C) The algorithm is not selectionsort, but it might be insertionsort. (D) The algorithm is neither selectionsort nor insertionsort. Q17. Suppose that we have a set of unique numbers between 1 and 1000 in a binary search tree and want to search for the number 363. Which of the following sequences could not be the sequence of nodes examined? (A) 925, 202, 911, 240, 912, 245, 363 (B) 924, 220, 911, 244, 898, 258, 362, 363 (C) 2, 399, 387, 219, 266, 382, 381, 278, 363 (D) 935, 278, 347, 621, 299, 392, 358, 363 Q18. For the given code snippet, calculate the time complexity x=0; for(i=1;i< pow(2,N); i = 2*i + 2){ for(j=1;j<N ; j++){ x=x+j; } } (A) O(N*2^N) (B) O(N^2* log N) (C) O(N^2) (D) O(N* log N) Q19. A max-heap is a heap where the value of each parent is greater than or equal to the value of its children. Which of the following is a max-heap? (A) (B)

7 5 6
(C)

7 6 5
(D)

4 3 7

4 2

7 4 6 5 3 2 4 9

6 5 3

Q20. What is the worst case time complexity of the following algorithm: function bucket-sort(array, n) is buckets new array of n empty lists for i = 0 to (k-1) do insert array[i] into buckets[msbits(array[i], n)] for i = 0 to n - 1 do mergeSort(buckets[i]) return the concatenation of buckets[0], ..., buckets[n-1] assume worst case time complexity of msbits(a, b) function is (n^2 log n), mergeSort(n) is is the merge sort algorithm and length(n) returns the length of n. Length of array is k. Assume each bucket has equal no. of elements and n << k (A) kn^2 log n (B) k log k (C) k^2 log k (D) kn^2log n + k log k Q21. Which of the following is not an In-place algorithm (an in-place algorithm is an algorithm which transforms input using a data structure with a small, constant amount of extra storage space): (A) Quick sort (B) Heap sort (C) Insertion sort (D) Selection sort Q22. Bogosort (also random sort, shotgun sort or monkey sort) is a particularly ineffective sorting algorithm. If bogosort were used to sort a deck of cards, it would consist of checking if the deck were in order, and if it were not, throwing the deck into the air, picking the cards up at random, and repeating the process until the deck is sorted. What would be the worst case complexity of such an algorithm (n is the no. of times cards are picked)? (A) O(n!) (B) O(n^n) (C) O() (D) O(e^n) Q23. An algorithm to find the length of the longest monotonically increasing sequence of numbers in an array A [0 : n 1] is given below. Let Li denote the length of the longest monotonically increasing sequence starting at index i in the array Initialize Ln-1 =1 For all i such that 0 i n 2 Li = 1 + L i + 1, if A [i] < A [i + 1] 1, otherwise Finally the length of the longest monotonically increasing sequence is Max (L 0 ,L1 ,...,Ln1 ). Which of the following statements is TRUE? (A) The algorithm uses dynamic programming paradigm (B) The algorithm has a linear complexity and uses branch and bound paradigm (C) The algorithm has a non-linear polynomial complexity and uses branch and bound paradigm (D) The algorithm uses divide and conquer paradigm.

Q24. Consider the following sorting algorithm: procedure gnomeSort(a[]) pos := 1 while pos < length(a) if (a[pos] >= a[pos-1]) pos := pos + 1

else swap a[pos] and a[pos-1] if (pos > 1) pos := pos - 1 else pos := pos + 1 end if end if end while end procedure What is the worst case complexity of this algorithm? (A) n (B) n(log n) (C) n^2 (D) Cannot be determined

DBMS based Questions (Multiple Choice)

Q25. A CASE SQL statement is which of the following? (A) A way to establish an IF-THEN-ELSE in SQL. (B) A way to establish a loop in SQL. (C) A way to establish a data definition in SQL. (D) All of the above. Q26. Which of the following is one of the basic approaches for joining tables? (A) Subqueries (B) Union Join (C) Natural join (D) All of the above Q27. The following SQL is which type of join: SELECT CUSTOMER_T. CUSTOMER_ID, ORDER_T. CUSTOMER_ID, NAME, ORDER_ID FROM CUSTOMER_T,ORDER_T WHERE CUSTOMER_T. CUSTOMER_ID = ORDER_T. CUSTOMER_ID (A) Equi-join (B) Natural join (C) Outer join (D) Cartesian join Q28. Embedded SQL is which of the following? (A) Hard-coded SQL statements in a program language such as Java. (B) The process of making an application capable of generating specific SQL code on the fly. (C) Hard-coded SQL statements in a procedure. (D) Hard-coded SQL statements in a trigger. Q29. A UNION query is which of the following? (A) Combines the output from no more than two queries and must include the same number of columns. (B) Combines the output from no more than two queries and does not include the same number of columns. (C) Combines the output from multiple queries and must include the same number of columns. (D) Combines the output from multiple queries and does not include the same number of columns.

Q30. One approach to standardization storing of data? (A) MIS (B) structured programming (C) CODASYL specification (D) none of the above Q31. Assume transaction A holds a shared lock R. if transaction B also requests for a shared lock on R (A) It will result in deadlock situation (B) It will immediately be granted (C) It will immediately be rejected (D) It will be granted as soon as it is released by A Q32. Relations produced from an E-R model will always be in (A) First normal form (B) Second normal form (C) Third normal form (D) Fourth normal form (E) None of the above Q33. Which normal form is considered adequate for normal relational database design? (A) 2NF (B) 5NF (C) 4NF (D) 3NF (E) None of these

Q34. A relational schema for a train reservation database is given below Passenger (pid, pname, age) Reservation (pid, cass, ti(D) Table : Passenger Pid 0 1 2 3 pname 'Sachin 'Rahul' 'Sourav' 'Anil' Age 65 66 67 69

Table : Reservation Pid 0 1 2 5 1 3 class AC AC SC AC SC AC tid 8200 8201 8201 8203 8204 8202

What pids are returned by the following SQL query for the above instance of the tables?

SELECT pid FROM Reservation WHERE class = 'AC' AND EXISTS (SELECT * FROM Passenger WHERE age>65 AND Passenger.pid = Reservation.pi(D) (A) 1, 0 (B) 1, 2 (C) 1, 3 (D) 1, 5 Q35. Choose the correct remark (A) An alternate key is a candidate key, that is not a primary key. (B) An alternate key is primary key, that is not a candidate key. (C) An alternate key is a candidate key, that is also a primary key. (D) None of the above Q36. If we move or delete a record to which another record contains a pointer, then that pointer is called as (A) Pinned pointer (B) Dangling pointer (C)Pointless pointer (D) Meaningless pointer Q37. Consider the following set of functional dependencies on the schema(A, B, (C) A -> BC B -> C A -> B AB -> C The canonical cover for this set is (A) A -> BC and B -> C (B) A -> BC and AB -> C (C) A -> BC and A -> B (D) A -> B and B -> C (E) None of the above.

Programming Questions (Multiple Choice)

Q38.What will be the output of the program #include<stdio.h> void fun(int*, int*); int main() { int i=5, j=2; fun(&i, &j); printf("%d, %d", i, j); return 0; } void fun(int *i, int *j) { *i = *i**i; *j = *j**j;

} (A) (B) (C) (D) 5, 2 10, 4 2, 5 25, 4

Q39. What will be the output of the program #include<stdio.h> int reverse(int); int main() { int no=5; reverse(no); return 0; } int reverse(int no) { if(no == 0) return 0; else printf("%d,", no); reverse (no--); } (A) (B) (C) (D) Print 5, 4, 3, 2, 1 Print 1, 2, 3, 4, 5 Print 5, 4, 3, 2, 1, 0 Infinite loop

Q40. What will be the output of the program #include<stdio.h> int main() { int i=3, j=4, k, l; k = addmult(i, j); l = addmult(i, j); printf("%d %d\n", k, l); return 0; } int addmult(int ii, int jj); { int kk, ll; kk = ii + jj; ll = ii * jj; return (kk, ll); } (A) (B) (C) (D) 12, 12 7, 7 7, 12 12, 7

Q41. What will be the output of the program #include<stdio.h> void fun(int); typedef int (*pf) (int, int); int proc(pf, int, int); int main() { int a=3; fun(a); return 0; } void fun(int n) { if(n > 0) { fun(--n); printf("%d,", n); fun(--n); } } (A) (B) (C) (D) 0, 2, 1, 0 1, 1, 2, 0 0, 1, 0, 2 0, 1, 2, 0

Q42. If int is 2 bytes wide. What will be the output of the program? #include <stdio.h> void fun(char**); int main() { char *argv[] = {"ab", "cd", "ef", "gh"}; fun(argv); return 0; } void fun(char **p) { char *t; t = (p+= sizeof(int))[-1]; printf("%s\n", t); } (A) ab (B) cd (C) ef (D) gh

10

Q43. In a Stack the command to access nth element from the top of the stack s will be (A) S[Top-n] (B) S [Top+n] (C) S [top-n-1] (D) None of the above Q44. The result of evaluating prefix expression */b+-dacd, where a = 3, b = 6, c = 1, d = 5 is (A) 0 (B) 5 (C) 10 (D) 15 Q45. In an array representation of binary tree the right child of root will be at location of (A) 2 (B) 5 (C) 3 (D) 0

Operating System Based Questions (Multiple Choice)

Q46. Number of CPU registers in a system depends on ____________. (A) Operating system (B) Computer Architecture (C) Computer Organization (D) None of the above Q47. ___________ begins at the root and follows a path down to the specified file (A) Relative path name (B) Absolute path name (C) Standalone name (D) None of the above Q48. Consider a logical address space of 64 pages of 2048 words each. How many bits are there in logical address? (A) 14 bits (B) 15 bits (C) 16 bits (D) 17 bits Q49. _________ is a high speed cache used to hold recently referenced page table entries a part of paged virtual memory (A) Translation Lookaside buffer (B) Inverse page table (C) Segmented page table (D) All the above Q50. When does the process enters the zombie state___________ (A) If the process is waiting for some special I/O event. (B) If the process is dead but have not been removed from the process table. (C) Both (A) & (B) (D) None of these.

11

Q51. _______ OS pays more attention on the meeting of the time limits. (A) Distributed (B) Network (C) Real time (D) Online Q52. Which of the following statements (one or more) are true in the context of Bankers algorithm: (A) It detects deadlock (B) It prevents deadlock (C) It detects deadlock but cannot prevent deadlock from happening (D) It requires prior knowledge of the requirements of all the currently executing processes. (E) Bankers algorithm caters to dynamic needs of executing processes

******* Thank you***** Rough Work Section:

12