Company Name Starts with ...
#  A  B  C  D  E   F  G  H  I  J   K  L  M  N  O   P  Q  R  S  T   U  V  W  X  Y  Z

  • Cap Gemini aptitute test questions (31)
  • Cap Gemini interview questions (1106)
  • Cap Gemini placement papers (1)
  • Cap Gemini technical test questions (47)



Cap Gemini SAP MM Interview Questions
Questions Answers Views Company eMail

Without filling this fields we can not create material in material master record(in views only) ?

2 2231

What controls the order in which the approval must take place?

1 348

What is Stock Type for RTP (Returnable Transport Packaging?

2 462

The customer has a requirement to cancel the release of the PO in case of price change in the PO after the approval. Which one of the indicator plays an important role?

1 386

What can be triggered by a GR?

1 406

Post New Cap Gemini SAP MM Interview Questions



Un-Answered Questions

which is the best ineptitude for MSBI in hyderabad?

1764


What happened if C.T mount at any cable or Bus bar in wrong direction . C.T going on proper work or not . C,T direction is essential thing to properly work.

366


DATA STRUCTURE QUESTIONS What is a data structure? What does abstract data type means? Evaluate the following prefix expression " ++ 26 + - 1324" (Similar types can be asked) Convert the following infix expression to post fix notation ((a+2)*(b+4)) -1 (Similar types can be asked) How is it possible to insert different type of elements in stack? Stack can be described as a pointer. Explain. Write a Binary Search program Write programs for Bubble Sort, Quick sort Explain about the types of linked lists How would you sort a linked list? Write the programs for Linked List (Insertion and Deletion) operations What data structure would you mostly likely see in a non recursive implementation of a recursive algorithm? What do you mean by Base case, Recursive case, Binding Time, Run-Time Stack and Tail Recursion? Explain quick sort and merge sort algorithms and derive the time-constraint relation for these. Explain binary searching, Fibinocci search. What is the maximum total number of nodes in a tree that has N levels? Note that the root is level (zero) How many different binary trees and binary search trees can be made from three nodes that contain the key values 1, 2 & 3? A list is ordered from smaller to largest when a sort is called. Which sort would take the longest time to execute? A list is ordered from smaller to largest when a sort is called. Which sort would take the shortest time to execute? When will you sort an array of pointers to list elements, rather than sorting the elements themselves? The element being searched for is not found in an array of 100 elements. What is the average number of comparisons needed in a sequential search to determine that the element is not there, if the elements are completely unordered? What is the average number of comparisons needed in a sequential search to determine the position of an element in an array of 100 elements, if the elements are ordered from largest to smallest? Which sort show the best average behavior? What is the average number of comparisons in a sequential search? Which data structure is needed to convert infix notations to post fix notations? What do you mean by: • Syntax Error • Logical Error • Runtime Error How can you correct these errors? In which data structure, elements can be added or removed at either end, but not in the middle? How will inorder, preorder and postorder traversals print the elements of a tree? Parenthesis are never needed in prefix or postfix expressions. Why? Which one is faster? A binary search of an orderd set of elements in an array or a sequential search of the elements. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX. Data Structure Questions 1. What is data structure? 2. List out the areas in which data structures are applied extensively? 3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model. 4. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? 5. Minimum number of queues needed to implement the priority queue? 6. What is the data structures used to perform recursion? 7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and postfix forms? 8. Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations. 9. Sorting is not possible by using which of the following methods? 10. A binary tree with 20 nodes has null branches? 21 Let us take a tree with 5 nodes (n=5) 11. What are the methods available in storing sequential files ? 12. How many different trees are possible with 10 nodes ? 1014 For example, consider a tree with 3 nodes(n=3), it will have the maximum combination of 5 different (ie, 23 - 3 = 5) trees. i ii iii iv v 13. List out few of the Application of tree data-structure? 14. List out few of the applications that make use of Multilinked Structures? 15. In tree construction which is the suitable efficient data structure? (a) Array (b) Linked list (c) Stack (d) Queue (e) none 16. What is the type of the algorithm used in solving the 8 Queens problem? 17. In an AVL tree, at what condition the balancing is to be done? 18. What is the bucket size, when the overlapping and collision occur at same time? 19. Traverse the given tree using Inorder, Preorder and Postorder traversals. 20. There are 8, 15, 13, 14 nodes were there in 4 different trees. Which of them could have formed a full binary tree? 21. In the given binary tree, using array you can store the node 4 at which location? At location 6 1 2 3 - - 4 - - 5 Root LC1 RC1 LC2 RC2 LC3 RC3 LC4 RC4 where LCn means Left Child of node n and RCn means Right Child of node n 22. Sort the given values using Quick Sort? 65 70 75 80 85 60 55 50 45 23. For the given graph, draw the DFS and BFS?  BFS: A X G H P E M Y J  DFS: A X H P E Y M J G 24. Classify the Hashing Functions based on the various methods by which the key value is found. 25. What are the types of Collision Resolution Techniques and the methods used in each of the type? 26. In RDBMS, what is the efficient data structure used in the internal storage representation? 27. Draw the B-tree of order 3 created by inserting the following data arriving in sequence – 92 24 6 7 11 8 22 4 5 16 19 20 78 28. Of the following tree structure, which is, efficient considering space and time complexities? (a) Incomplete Binary Tree (b) Complete Binary Tree (c) Full Binary Tree 29. What is a spanning Tree? 30. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes? 31. Convert the given graph with weighted edges to minimal spanning tree. 32. Which is the simplest file structure? (d) Sequential (e) Indexed (f) Random 33. Whether Linked List is linear or Non-linear data structure? 34. Draw a binary Tree for the expression : A * B - (C + D) * (P / Q) 35. For the following COBOL code, draw the Binary tree? 01 STUDENT_REC. 02 NAME. 03 FIRST_NAME PIC X(10). 03 LAST_NAME PIC X(10). 02 YEAR_OF_STUDY. 03 FIRST_SEM PIC XX. 03 SECOND_SEM PIC XX.

3799


a sample of gas occupies a volume of {450.0 ml}at {740 mm Hg}and[16C]determine the volume of this same sample at [760 mm Hg]and [37c]?

2809


How to Add TrueType fonts to windows in code?

620






how do you programme Carrier Sense Multiple Access

779


Have you been a team leader in your previous or present job and what are the challenges of associated with team leadership?

5238


where solid grounding and where grounding through ngr done and why?

1341


What are document required by the bank to make payment for debit memo (Import). if we have allready made payment for orignal bill.

667


In a flow, when a Customer has called for enquiring about some product. He does not have any Service tag, Order # or SR#. In this case what kind of Activity will be created and how will the agent proceed with the Activity.

800


WHAT IS A SAMPLE USER INTERFACE OF DES ENCRYPTION/DECRYPTION PROJECT?

1216


What is the difference between Requirement type Determination and Schedule line category determination ?

291


MS SQL error '17824 Unable to write to ListenOn connection ' what does this error mean?

740


How to derive test data from the design documents?

742


What does the above code synthesize to?

1198






Cap Gemini SAP MM Interview Questions
  • Software (1)
  • C (2)
  • OOPS (2)
  • C++ General (1)
  • COM DCOM (2)
  • VC++ AllOther (1)
  • Programming Languages AllOther (2)
  • CGI Perl (1)
  • VB Script (10)
  • Shell Script (4)
  • UDP (1)
  • Networking AllOther (1)
  • Visual Basic (1)
  • C Sharp (1)
  • ASP.NET (6)
  • Crystal Reports (1)
  • BizTalk (1)
  • Dot Net Framework (3)
  • Dot Net AllOther (1)
  • Exchange Server (1)
  • Oracle General (9)
  • Database Management (2)
  • Forms Reports (1)
  • Oracle AllOther (4)
  • SQL Server (18)
  • MySQL (1)
  • DB Administration (2)
  • SQL PLSQL (15)
  • Databases AllOther (1)
  • Linux AllOther (1)
  • Unix Commands (3)
  • Unix General (4)
  • Unix AllOther (1)
  • Solaris AllOther (3)
  • Operating Systems General Concepts (1)
  • WinRunner (1)
  • Load Runner (3)
  • QTP (40)
  • Test Director (1)
  • Selenium (1)
  • Automation Testing AllOther (1)
  • Manual Testing (84)
  • QA Concepts (15)
  • Mobile Testing (1)
  • Test Cases (7)
  • Test Documents Reporting (1)
  • Testing AllOther (19)
  • COBOL (21)
  • JCL (16)
  • CICS (14)
  • DB2 (31)
  • IMS (2)
  • Natural (1)
  • MVS (1)
  • VSAM (5)
  • RPG400 (8)
  • COBOL400 (1)
  • DB400 (3)
  • Core Java (17)
  • Advanced Java (5)
  • Swing (1)
  • Struts (2)
  • JDBC (1)
  • Weblogic (2)
  • Java J2EE AllOther (4)
  • Java Related AllOther (4)
  • MQSeries (2)
  • Middleware AllOther (1)
  • SOAP (1)
  • Teradata (9)
  • Business Objects (18)
  • Cognos (24)
  • Informatica (67)
  • Ab Initio (2)
  • Data Stage (19)
  • SAS (3)
  • ETL (4)
  • Data Warehouse General (2)
  • HR Questions (5)
  • WiFi Security (1)
  • SAP Basis (27)
  • SAP ABAP (109)
  • SAPScript (3)
  • SAP SD (96)
  • SAP MM (20)
  • SAP PP (2)
  • SAP FI CO (66)
  • SAP HR (27)
  • SAP CRM (55)
  • SAP APO (1)
  • SAP Business Warehouse (9)
  • SAP Security (23)
  • SAP Netweaver (1)
  • SAP ALE IDocs (2)
  • SAP B1 (1)
  • SAP Business Objects BO BOBJ (1)
  • CRM General (1)
  • Siebel (14)
  • Oracle Apps Technical (11)
  • Oracle Apps Financial (19)
  • Oracle Apps Manufacturing (1)
  • Oracle Apps HRMS (1)
  • Oracle Apps SCM (6)
  • WebMethods (10)
  • TIBCO (1)
  • Mechanical Engineering (2)
  • Electrical Engineering (4)
  • Electronics Communications (2)
  • Engineering AllOther (3)
  • Marketing Sales (2)
  • Banking Finance (3)
  • Audit (2)
  • Taxation (3)
  • Accounting General (15)
  • Accounting AllOther (15)
  • Call Centre AllOther (3)
  • BSRB AllOther (1)
  • Law AllOther (1)
  • Everything Else AllOther (1)
  • English (2)
  • General Aptitude (24)
  • Placement Papers (1)
  • CCNA (1)
  • Certifications AllOther (1)
  • H1B Visa (2)
  • USA Student Visa F1 Visa (1)
  • L1 Visa (2)
  • USA Business Visa B1 Visa (1)
  • USA Dependent Visa H4 Visa (2)
  • C Code (1)
  • Programming Code AllOther (1)
  • Oracle Errors (1)
  • MySQL Errors (1)