Oracle & Java Magazine

Oracle Magazine - January - February 2012  Edition

Java Magazine  - November - December 2011 Edition

Set of Materials for Facing Technical Quiz - www.Carrerride.com

The site www.carrerride.com also provides the facility to check your technical skills
* Framework

The study materials are
http://www.careerride.com/pdf/c++.pdf
http://www.careerride.com/pdf/asp-net-questions.pdf
http://www.careerride.com/pdf/object-oriented-programming.pdf
http://www.careerride.com/pdf/Java.doc
http://www.careerride.com/pdf/Networking.doc
http://www.careerride.com/pdf/Testing.doc
http://www.careerride.com/pdf/PHP.doc
http://www.careerride.com/pdf/Csharp.doc
http://www.careerride.com/pdf/Oracle.doc
http://www.careerride.com/pdf/Sql-server.doc
http://www.careerride.com/pdf/Linux.doc
http://www.careerride.com/pdf/Oracle-DBA.doc
http://www.careerride.com/pdf/SQL-Server-DBA.doc

List of Online IT Quiz Sites

the following are the sites provide the users to test their Technical Skills.


Database Mangement System


Also the site http://www.ex-designz.net provides Quiz for the following subjects
ASP

 ASP 2

 ASP ADO

 ASP Server Side Include

 ASP.NET

 C# .NET

 CISCO-CCNA

 Computer Hardware

 Computer Technolgy

 Computer Trivia

 CSS

 HTML

 IIS 6 Administration

 Java

 JavaScript

 Javascript Fundamental

 Linux

 MCSE 70-291

 Network Plus

 Networking

 Networking 2

 OSI Model

 PERL

 PHP

 Project Management

 Search Engine Optimization

 Server Administrator

 SQL

 SQL Advanced

 SQL Server Administration

 VB.NET

 Web Designer

 Windows 2000 Server

 Windows 2003 Server Adminstration

 

 

Data Structure Question Bank

UNIT I     :  DATA STRUCTURES

1.      Define ADT.

2.      What is a data structure? What are the types of data structures?

3.      Define a linear and non linear data structure.

4.      Define in brief an array. What are the types of array operations?

5.      What is a recursive algorithm?

6.      What is the difference between a stack and a Queue?

7.      Can a stack be described as a pointer? Explain

8.      Is it possible to insert different type of elements in a stack? How?

9.      How would you sort a linked list?

10.  Explain the types of linked lists.

11.  Explain in brief a linked list.

12.  Implement an algorithm to reverse a doubly linked list.

13.  Implement an algorithm to insert in a sorted list.

14.  Implement an algorithm to reverse a doubly linked list.

15.  Implement an algorithm to insert in a sorted list.

16.  What is an Algorithm?

17.  List out and define the performance measures of an algorithm.

18.  What is Complexity analysis?

19.  Explain Space complexity?

20.  Explain Time complexity?

21.  List out the components that are used for space complexity?

22.  What do asymptotic notation means?

23.  Define linear data structure?

24.  Define Non Linear data structure?

25.  Convert the expression ((A + B) * C – (D – E) ^ (F + G)) to equivalent Prefix and Postfix notations.

26.  What are different types of Linked List?

27.  What are different types of Circular Linked List?

28.  List certain applications of lists

29.  List the basic operations carried out in a linked list?

30.  Define a stack?

31.  Define a queue?

32.  Difference between Arrays and Linked List?

33.  What is single linked list?

34.  Define HEAD pointer and NULL pointer?

35.  Define double linked list?

36.  Write operations that can be done on stack?

37.  Mention applications of stack?

38.  Define Infix, prefix and postfix notations?

39.  What are the conditions that followed in the array implementation of queue?

40.  What are the conditions that could be followed in a linked list implementations of queue?

UNIT II  : TREES

41.  List out few of the Application of tree data-structure?

42.  Draw a binary Tree for the expression :
A * B - (C + D) * (P / Q)
Write a program in ‘C' language which accepts inorder and preorder traversal outputs of  a  Binary Tree as input and prints the corresponding Binary tree.

43.  Define tree?

44.  Write a function and the node data structure to visit all of the nodes in a binary tree.

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

46.  Define Depth of   tree?

47.  Define Degree of a node?

48.  define Degree of a tree?

49.  Define Terminal node or leaf?

50.  Define Non-terminal node?

51.  Define sibling?

52.  Define binary tree?

53.  Define expression tree?

54.  Construction of expression trees?

55.  Define tree traversal and mention the type of traversals?

UNIT III SORTING AND SEARCHING

56.  What is insertion sort? How many passes are required for the elements to be sorted ?

57.  What is the need of  external sorting? Differentiate between merge sort and quick sort ?

58.  What is  replacement selection ?

59.  What is sorting?

60.  What is sequential search? What is the average number of comparisons in a sequential search?

61.  What is binary searching and Fibonacci search?

62.  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

63.  Which sort show the best average behavior?

64.  What is the average number of comparisons in a sequential search?

65.  Write Binary Search program

66.  Write programs for Bubble Sort, Quick sort

UNIT IV        GRAPHS AND THEIR APPLICATIONS

67.  What is a graph?

68.  What are Directed graphs?

69.  What is the Huffman algorithm?

70.  Define Path.

71.  Define Cycle.

72.  Define Connected graph.

73.  What are the conditions for a graph to become a tree?

74.  . Define a Weighted Graph.

75.  Give the types of representation of graphs

76.  What is a minimum spanning tree

77.  Explain about Adjacency Matrix

78.  What are the methods to solve minimum spanning tree?

79.  Explain briefly about Prim’s algorithm

80.  Define a depth first spanning tree.

81.  What is a tree edge?

UNIT V          STORAGE MANAGEMENT

82.  What is the reference count method?

83.  What is Garbage Collection?

84.  What are the algorithms associated with Garbage Collection

85.  What is Collection and Compaction ?

86.  What are the variations in Garbage Collection?

Data structure - imp questions

1. What is data structure?

A data structure is a way of organizing data that considers not only the items stored, but also their

relationship to each other. Advance knowledge about the relationship between data items allows

designing of efficient algorithms for the manipulation of data.

2. List out the areas in which data structures are applied extensively?

1. Compiler Design,

2. Operating System,

3. Database Management System,

4. Statistical analysis package,

5. Numerical Analysis,

6. Graphics,

7. Artificial Intelligence,

8. Simulation

3. What are the major data structures used in the following areas : RDBMS, Network data

model and Hierarchical data model.

1. RDBMS = Array (i.e. Array of structures)

2. Network data model = Graph

3. Hierarchical data model = Trees

4. If you are using C language to implement the heterogeneous linked list, what pointer

type will you use?

The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to

connect them. It is not possible to use ordinary pointers for this. So we go for void pointer. Void

pointer is capable of storing pointer to any type as it is a generic pointer type.

5. Minimum number of queues needed to implement the priority queue?

Two. One queue is used for actual storing of data and another for storing priorities.

6. What is the data structures used to perform recursion?

Stack. Because of its LIFO (Last In First Out) property it remembers its 'caller' so knows whom to

return when the function has to return. Recursion makes use of system stack for storing the return

addresses of the function calls.

Every recursive function has its equivalent iterative (non-recursive) function. Even when such

equivalent iterative procedures are written, explicit stack is to be used.

7. What are the notations used in Evaluation of Arithmetic Expressions using prefix and

postfix forms?

Polish and Reverse Polish notations.

8. Convert the expression ((A + B) * C - (D - E) ^ (F + G)) to equivalent Prefix and Postfix

notations.

1. Prefix Notation: ^ - * +ABC - DE + FG

2. Postfix Notation: AB + C * DE - - FG + ^

9. Sorting is not possible by using which of the following methods? (Insertion, Selection,

Exchange, Deletion)

Sorting is not possible in Deletion. Using insertion we can perform insertion sort, using selection

we can perform selection sort, using exchange we can perform the bubble sort (and other similar

sorting methods). But no sorting method can be done just using deletion.

10. What are the methods available in storing sequential files ?

1. Straight merging,

2. Natural merging,

3. Polyphase sort,

4. Distribution of Initial runs.

11. List out few of the Application of tree data-structure?

1. The manipulation of Arithmetic expression,

2. Symbol Table construction,

3. Syntax analysis.

12. List out few of the applications that make use of Multilinked Structures?

1. Sparse matrix,

2. Index generation.

13. In tree construction which is the suitable efficient data structure? (Array, Linked list,

Stack, Queue)

Linked list is the suitable efficient data structure.

14. What is the type of the algorithm used in solving the 8 Queens problem?

Backtracking.

15. In an AVL tree, at what condition the balancing is to be done?

If the 'pivotal value' (or the 'Height factor') is greater than 1 or less than -1.

16. What is the bucket size, when the overlapping and collision occur at same time?

One. If there is only one entry possible in the bucket, when the collision occurs, there is no way to

accommodate the colliding value. This results in the overlapping of values.

17. Classify the Hashing Functions based on the various methods by which the key value is

found.

1. Direct method,

2. Subtraction method,

3. Modulo-Division method,

4. Digit-Extraction method,

5. Mid-Square method,

6. Folding method,

7. Pseudo-random method.

18. What are the types of Collision Resolution Techniques and the methods used in each of

the type?

1. Open addressing (closed hashing), The methods used include: Overflow block.

2. Closed addressing (open hashing), The methods used include: Linked list, Binary tree.

19. In RDBMS, what is the efficient data structure used in the internal storage

representation?

B+ tree. Because in B+ tree, all the data is stored only in leaf nodes, that makes searching

easier. This corresponds to the records that shall be stored in leaf nodes.

 20. What is a spanning Tree?

A spanning tree is a tree associated with a network. All the nodes of the graph appear on the

tree once. A minimum spanning tree is a spanning tree organized so that the total edge

weight between nodes is minimized.

 21. Does the minimum spanning tree of a graph give the shortest distance between

any 2 specified nodes?

The Minimal spanning tree assures that the total weight of the tree is kept at its minimum.

But it doesn't mean that the distance between any two nodes involved in the minimumspanning

tree is minimum.

22. Which is the simplest file stru

cture? (Sequential, Indexed, Random)

Sequential is the simplest file structure.

 23. Whether Linked List is linear or Non-linear data structure?

According to Access strategies Linked list is a linear one.

According to Storage Linked List is a Non-linear one.