Asian IMS NCC Orchid
What is mean by inconsistency?
=> Data inconsistency is a condition that occurs between files when similar data is kept in different formats in two different files or when matching of data must be done between files.
Define Data independence.
=> The ability to modify schema definition in one level without affecting schema definition in the next higher level is called data independence
What do you mean by data dictionary?
=> A data dictionary is a file or a set of files that contains a database’s metadata. The data dictionary contains records about other objects in the database, such as data owners, data relationships to other objects, and other data
Differentiate between DDL and DML.
=>The basic difference between DDL and DML is that DDL(Data Definition Language) is used to Specify the database schema database structure. On the other hand, DML (Data Manipulation Language) is used to access, modify or retrieve the data from the database
Differentiate between generalization and specialization.
|It proceeds in a bottom-up manner||It proceeds in a top-down manner.|
|It reduces the size of the schema.||It increases the size of the schema.|
What do you mean by mapping cardinalities?
=>A mapping constraint is a data constraint that expresses the number of entities to which another entity can be related via a relationship set.
What is n-ary relationship set?
=> N-ary relationship set is a relationship set where ‘n’ entity sets to participate in a relationship set.
What do you mean by redundancy?
=>Data redundancy is a condition created within a database or data storage technology in which the same piece of data is held in two separate places. This can mean two different fields within a single database.
Define EER Model.
=>EER model is a high-level data model that includes all the concepts introduces by ER model. Additionally, it includes the concept of
- Super class
- Sub Class
- Specialization and Generalization
Briefly define the different roles of DBA.
=> The different roles of DBA are:
- Schema Design
- Routine and maintenance
- Data analysis
- Authorization/ Define Authority.
1.Define data structure?
A data structure is a specialized format for organizing, processing, retrieving and storing data. While there are several basic and advanced structure types, any data structure is designed to arrange data to suit a specific purpose so that it can be accessed and worked with in appropriate ways.
2.What is linked list?
A linked list is a linear data structure, in which the elements are not stored at contiguous memory locations. In simple words, a linked list consists of nodes where each node contains a data field and a reference(link) to the next node in the list.
3.What is sorting?
Sorting refers to the operation or technique of arranging and rearranging sets of data in some specific order. A collection of records called a list where every record has one or more fields.
4.Define cyclic graph.
A cyclic graph is a graph containing at least one graph cycle. Cyclic graphs are not trees.
5.What is hashing?
Hashing is generating a value or values from a string of text using a mathematical function.Hashing is one way to enable security during the process of message transmission when the message is intended for a particular recipient only.
6.Define double linked list.
A Doubly Linked List (DLL) contains an extra pointer, typically called previous pointer, together with next pointer and data which are there in singly linked list.
7.What is queue?
A Queue is a linear structure which follows a particular order in which the operations are performed. The order is First In First Out (FIFO). A good example of a queue is any queue of consumers for a resource where the consumer that came first is served first.
8.Define binary tree.
A binary tree is a tree data structure where each node has up to two child nodes, creating the branches of the tree. The two children are usually called the left and right nodes. Parent nodes are nodes with children, while child nodes may include references to their parents.
9.What is divide and conquer algorithm?
Divide and conquer is an algorithmdesign paradigm based on multi-branched recursion. A divide-and-conquer algorithm works by recursively breaking down a problem into two or more sub-problems of the same or related type, until these become simple enough to be solved directly.
A stack is a conceptual structure consisting of a set of homogeneous elements and is based on the principle of last in first out (LIFO). It is a commonly used abstract data type with two major operations, namely push and pop.
- What is asymptotic complexity?
Ans: The limiting behavior of the execution time of an algorithm when the size of the problem goes to infinity is called asymptotic complexity.
- Differentiate between static and dynamic data structure.
Ans: Static structure – It has fixed memory allocation at creation. Eg: Array
Dynamic Structure – Its memory allocation is not fixed at creation. Eg: Linked List.
- List the two approach to delete a node having two children in Binary Search Tree?
Ans: The two approach to delete a node ha having two children in Binary Search Tree are:-
- Deletion by Merging and
- Deletion by copying
- Why doubly linked list is advantageous than singly linked list?
Ans: Because of two way communication in doubly linked list
- From which end insertion of an element is done in a queue?
Ans: From front end insertion of an element is done in a queue.
- Define self-organizing list?
Ans: A self-organizing list is a list that reorders its elements based on self-organizing heuristic to improve average access time.
- What happens when there is excessive recursion?
Ans: When there is excessive recursion the same function is repeatedly called again and again and at worst case scenario the system crashes.
- Define a complete binary tree.
Ans: A complete binary tree is a strict binary tree of same level.
- Differnetiate between searching and traversing.
|Searching means to search a particular node||Traversing means to travel to each node exactly once only|
- Why is array implementation of binary tree not good?
Ans: Array implementation of binary tree not good because it consumes lot of time
Orchid International College
- Define Balance Factor.
Ans. The difference between the height of left subtree and the height of right subtree is called Balance Factor.
- What is a min heap ?
Ans. A min heap is a binary tree structure in which the parent node has the value smaller than its children and descendants and the root has the smallest value.
3.Define Big-Omega notation.
Ans. If there exists two functions f(n) and g(n) and two constants c and N such that f(n) >= c*g(n) for all N>n0, then f(n) is said to be big-omega of g(n).
4.What is a strictly binary tree?
Ans. A binary tree with each node having exactly two children or zero child is called a strictly binary tree.
- Differentiate between tail and non-tail recursion.
|Tail Recursion||Non Tail Recursion|
|i. In tail recursion, the recursive call is made only in the last statement.||i. In non-tail recursion, the recursive call can be anywhere inside the function.|
- How is priority queue different from a simple queue ?
|Simple Queue||Priority Queue|
|i. The element at the front of the queue is deleted first.||i. The element having highest priority is deleted first.|
|ii. There is no need of shifting of elements.||ii. If any element is removed from the middle of the queue, the elements after that need to be shifted to front.|
- Define Queue.
Ans. A Queue is a data structure in which elements are inserted from the back end known as rear end and the elements are deleted from the front end.
- When does stack overflow condition occur ?
Ans. Stack overflow condition occurs when the stack is already full and an additional element is tried to be pushed on the stack. In other words, when TOP = stacksize -1, stack overflow occurs.
- Define expression tree.
Ans. An expression tree is a binary tree structure in which operands are placed in the leaf node and the operators are placed in the parent node and the operator with the lowest precedence is placed as root.
- What is the prefix notation of (A+B)*(C-D)/E.
Ans. The prefix notation is: *+AB/-CDE.