Accenture DB Administration Interview Questions

Un-Answered Questions

Hello every one i'm going to interview for as an account profile company is construction works so plz guys help me about furthering interview question

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.

What is different type testing you done when doing webbase application.the desktop application

why we use the ac supply load cell>?can we use the dc supply load cell?advantages and disadvantage of the ac supply load cell?

sir i want aao lic exam model question paper

We are using Oracle apps with XML publisher.In that,we are facing some problems while giving a Footer in RTF Template.While giving a footer in RTF Template it is Visible in all the pages,but after the PDF is getiing generated,the Footer are Visible on alternate pages only (like on first page ,third page) and so on. Please provide the Solution for getting the Footer on all the pages.

what is the diference between the 4pole & 6pole DC Motors & what is advantage 6pole over the 4pole ?

How would you relate your key competencies to this position?

query optmization techniques and quwry analyser+projects+ppts

what is Single Byte Overhead...?

i m i n3rd ye of btech EC branch and have been placed in sftware company..wat sghd i do to improve my skills in 4th yr..i have a gd academic background.

X draws a bill on Y for Rs 20,000 for 3 months on 1.1.05. The bill is discounted with banker at a charge of Rs 100. At maturity the bill return dishonoured. In the books of X, for dishonour, the bank account will be credited by Rs. (a) 19,900 (b) 20,000 (c) 20,100 (d) 19,800

What are the accounting behind consigned inventory in P2P?

We have two mandatory qualifiers nature of accounts and balancing segment, which will balance the debit and credit and recognize the nature of accounts, my question is what other qualifiers do. Like management. Thank you.

Can any bosy send interview questions on Weblogic Application Server.

Accenture DB Administration Interview Questions

- C (57)
- OOPS (10)
- C++ General (4)
- COM DCOM (1)
- Delphi (1)
- PHP (1)
- Programming Languages AllOther (13)
- JavaScript (1)
- VB Script (7)
- JSP (1)
- Awk (1)
- Scripts AllOther (1)
- SNMP (2)
- TCP IP (1)
- Protocols AllOther (6)
- Networking Administration (5)
- Networking Security (1)
- Networking AllOther (1)
- Visual Basic (1)
- C Sharp (10)
- ASP.NET (74)
- ADO.NET (5)
- Crystal Reports (1)
- BizTalk (5)
- Dot Net Framework (13)
- Dot Net WindowsForms (1)
- Dot Net General (2)
- Dot Net AllOther (2)
- Exchange Server (5)
- Microsoft Related AllOther (2)
- Oracle General (5)
- Forms Reports (1)
- Oracle AllOther (3)
- SQL Server (21)
- MySQL (1) DB Administration (2)
- SQL PLSQL (15)
- Databases AllOther (2)
- SDK (1)
- Windows Threads (1)
- Windows General (4)
- Windows AllOther (4)
- Linux System Calls (2)
- Linux AllOther (3)
- Unix Commands (2)
- Unix General (8)
- Unix AllOther (2)
- Solaris Commands (4)
- Solaris System Calls (1)
- Solaris AllOther (2)
- Operating Systems General Concepts (3)
- Data Structures (1)
- WinRunner (24)
- Load Runner (12)
- QTP (64)
- Test Director (1)
- Rational TestSuite (3)
- Selenium (1)
- Automation Testing AllOther (5)
- Manual Testing (119)
- QA Concepts (7)
- Test Cases (9)
- Test Documents Reporting (1)
- Testing AllOther (17)
- COBOL (13)
- JCL (12)
- CICS (10)
- DB2 (13)
- IMS (2)
- IBM MainFrame AllOther (14)
- RPG400 (1)
- COBOL400 (1)
- DB400 (2)
- IBM AS400 AllOther (3)
- Core Java (36)
- Advanced Java (2)
- Swing (1)
- EJB (1)
- Servlets (6)
- Struts (5)
- JDBC (1)
- J2EE (1)
- Weblogic (2)
- Java Networking (2)
- Java J2EE AllOther (1)
- Middleware AllOther (2)
- HTML DHTML (1)
- XML XSLT RSS (1)
- Teradata (4)
- Business Objects (29)
- Cognos (8)
- Informatica (60)
- Ab Initio (4)
- Data Stage (12)
- SAS (97)
- ETL (6)
- Data Warehouse General (6)
- HR Questions (34)
- Design Patterns (3)
- Project Planning (1)
- VSS (1)
- SAP Basis (25)
- SAP ABAP (154)
- SAPScript (4)
- SAP SD (104)
- SAP MM (32)
- SAP QM (1)
- SAP PP (7)
- SAP PM (1)
- SAP PS (1)
- SAP FI CO (110)
- SAP HR (20)
- SAP CRM (17)
- SAP APO (2)
- SAP Business Warehouse (20)
- SAP Security (28)
- SAP Interfaces (1)
- SAP Netweaver (4)
- SAP ALE IDocs (2)
- SAP B1 (3)
- SAP AllOther (3)
- PeopleSoft Administration (1)
- PeopleSoft Tools (2)
- Siebel (4)
- Oracle Apps Technical (37)
- Oracle Apps Financial (21)
- Oracle Apps Manufacturing (2)
- Oracle Apps HRMS (1)
- Oracle Apps SCM (5)
- Oracle Install Base (1)
- Oracle Service Contracts (2)
- ERP CRM AllOther (1)
- Client Server Architecture (3)
- AI Tools (3)
- WebMethods (7)
- TIBCO (11)
- EAI AllOther (12)
- Change Request Management (1)
- Bio Informatics (1)
- Sciences AllOther (1)
- Electrical Engineering (12)
- Electronics Communications (5)
- Engineering AllOther (4)
- Business Administration (1)
- Marketing Sales (3)
- Banking Finance (7)
- Human Resources (4)
- IT Management (2)
- Non Technical (1)
- Business Management AllOther (1)
- Audit (4)
- CompanyAffairs CS (1)
- Taxation (8)
- Accounting General (90)
- Accounting AllOther (59)
- Call Centre AllOther (31)
- APPSC AllOther (1)
- General Knowledge_Current Affairs (4)
- Government AllOther (2)
- Everything Else AllOther (6)
- English (3)
- General Aptitude (47)
- Puzzles (6)
- Placement Papers (25)
- CCNA (2)
- Microsoft Certifications (2)
- Oracle Certifications (1)
- Certifications AllOther (2)
- L1 Visa (2)
- USA AllOther Visa (4)
- Australia Visa (1)
- C Code (4)
- GATE (1)
- GMAT (3)
- Scripts Errors (1)