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.
Important Questions [8]
- A double ended queue is a linear data structure which enables the user to add and remove integers from either ends i.e., from front or rear.
- Differentiate between a stack and a queue.
- CardGame is a game of mental skill, built on the simple premise of adding and removing the cards from the top of the card pile. The details of the class Card Game are given below. Class name CardGam
- Convert the following infix notation to postfix form. (P + Q * R - S)/T * U
- Convert the following infix notation to prefix notation. (A - B)/C * (D + E)
- Answer the following questions based on the diagram of a Binary Tree given below: Name the external nodes of the tree. State the degree of node M and node L. Write the post-order traversal of the
- Answer the following questions from the diagram of a Binary Tree given below: a. Write the pre-order traversal of the above tree structure.
- What is the importance of the reference part in a Linked List?
Concepts [6]
- 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
- Conversion of Infix to Prefix and Post Fix Notations
- Recursive Data Structures - Single Linked List (Algorithm and Programming), Binary Trees, Tree Traversals (Conceptual)
