Definitions [6]
Define the following term with reference to Tree:
Leaf
A node that has no child nodes is called a leaf node. Such nodes have a degree of zero. In the given figure, nodes D, G, K, M are leaf nodes. Leaf nodes are also known as terminal nodes.
Define Elementary Item
Data items which are not divided into sub-items are called as elementary
items.
Define the following term with reference to the Tree:
Depth
Depth of a tree is defined as maximum level of any nodes in the tree. If root is level 0 then depth or height of tree is equal to 1 + largest level number.
For eg: Depth of above tree is 5.
Define the following term with reference to Tree:
Root
A node that does not have a parent is called the root node. Generally, the first node of a tree is considered the root. In the given figure, node A is the root of the tree.
Define Entity.
An entity is something that has certain attributes or properties which may be assigned values.
The values themselves may be numeric or non-numeric.
| Attributes | Name | Age | Sex | Education |
| Values | ABC | 25 | F | B.E.(ELECT) |
An entity is a real world object, person, concept or a thing about which data can be stored and managed in database.
Define Group Item
A data element that is composed of one or more subordinate, smaller data items.
Concepts [25]
- Class as a Contract
- Separating Implementation from Interface
- Encapsulation
- Difference Between Private Company and Public Company
- Interfaces in Java
- Implementing Interfaces Through a Class
- Interfaces for User Defined Implementation of Behaviour
- Basic Data Structures (Stack, Queue, Dequeue)
- Implementation Directly Through Classes
- Definition Through an Interface and Multiple Implementations by Implementing the Interface
- Basic Algorithms and Programs Using the Above Data Structures
- Basic Input/Output Using Scanner and Printer Classes from JDK
- Files and Their Representation Using the File Class
- File Input/Output
- Input/Output Exceptions
- Tokens in an Input Stream
- Concept of Whitespace
- Extracting Tokens from an Input Stream (StringTokenizer Class)
- Recursion
- Simple Recursive Functions (e.g. Factorial, GCD, Binary Search, Conversion of Representations of Numbers Between Different Bases)
- Concrete Computational Complexity
- Concept of Input Size
- Estimating Complexity in Terms of Functions
- Importance of Dominant Term
- Best, Average and Worst Case
