Data Structure
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?
Compiler Design,
Operating System,
Database Management System,
Statistical analysis package,
Numerical Analysis,
Graphics,
Artificial Intelligence,
Simulation
3. What are the major data structures used in the following areas : RDBMS, Network data model & Hierarchical data model.
RDBMS Array (i.e. Array of structures)
Network data model Graph
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.
Prefix Notation:
^ - * +ABC - DE + FG Postfix Notation:
AB + C * DE - - FG + ^
9. Sorting is not possible by using which of the following methods?
(a) Insertion
(b) Selection
(c) Exchange
(d) Deletion
(d) 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).
Conceptual schema at the conceptual level describes the structure and constraints for the whole database for a community of users. These uses a conceptual or an implementation data model.
...he search involves repeatedly taking the first node off the queue, finding that node’s successors, and putting them on the end of the queue. This continues until either the first node on the queue is the goal or target state, or the queue is empty. If the first node is the target state the algorithm will signal success (e.g. return TRUE). Otherwise the search fails. What is nice about about this algorithm is that by simply replacing the queue with a stack the same algorithm now performs a depth first search. Having a stack allows the algorithm to ‘backtrack’ to previous nodes and then select new routes from that node. Simply searching for a target on this basis is called a ‘blind search’. Using additional information that might aid the algorithm to more intelligently find the target is called a ‘heuristic search’ an example of which is the A* tree search algorithm.
What does any kind of order have to do with math? It’s just left to right isn’t it? Wrong, the order of operations is a specific method to figuring out the correct answer to certain problems. For those of you who do not realize what I am yammering on about, this procedure piece is about the order of operations.
There are two types of data. They are unstructured and multi-structured. Unstructured data comes from information that isn’t organized or easily interpreted by traditional databases or data models. This is usually in text format.
Part 1. (a) Define each, (b) Explain its significance, (c) where indicated with this symbol * provide an example.
35 Meng Xiaofeng and Ci Xiang, 2013 : Big Data Management: Concepts,Techniques and Challenges pp 4-6
In 1977, Larry Ellison, Bob Miner, and Ed Oates founded System Development Laboratories. After being inspired by a research paper written in 1970 by an IBM researcher titled “A Relational Model of Data for Large Shared Data Banks” they decided to build a new type of database called a relational database system. The original project on the relational database system was for the government (Central Intelligence Agency) and was dubbed ‘Oracle.’ They thought this would be appropriate because the meaning of Oracle is source of wisdom.
The first type of Big Data used in military logistics is the structured data, which is data that has been stored in the databases in an orderly manner. In military logistics, the two sources of structured data are machines and humans. Examples include GPS data, usage statistics of vehicles, ships and aircrafts, and data from medical devices. The second type of structured data is unstructured data, which is data that resides in the traditional column databases and have no clear format in storage. Examples include the mobile data, and data from satellite images about certain terrains (Sagiroglu & Sinanc, 2013).
6- Developing of new tools, for all the new fields of studying, and developing programs for data mining and analysis of huge databases.
There are several basic and advance sorting algorithms. All sorting algorithm apply to specific quite issues. One among the basic issues of computer science is ordering an inventory of things. There is a plethora of solutions to this problem, referred to as sorting algorithms. Some sorting algorithms are simple and intuitive, such as the bubble sort. Others, such as the quick sort are extraordinarily sophisticated, however turnout lightning-fast results. The common sorting algorithms will be divided into two categories by the complexity of their algorithms ( Deepak Garg 2009). There is an immediate correlation between the complexity of an algorithm and its relative efficiency. Algorithmic complexity is usually written in a very kind referred to as Big-O notation, wherever the O represents the complexity of the algorithm and a value n represents the size of the set the algorithm is run against. The two categories of sorting algorithms are O(n2), which incorporates the bubble, insertion, selection, and shell, sorts; and O(n log n) which incorporates the heap, merge, and quick sort.
A data dictionary is a place where the DBMS stores definitions of the data elements and their metadata. All programs that access the data in the database will work through the DBMS. It uses the data dictionary to look up the required data component structures and relationships, thus the users do not have to code such complex relationships in each program. In addition, any changes made in database structure will be automatically recorded in the data dictionary, thereby freeing the users from having to modify all the programs that access the changed structure.
As a simple example of the using of hashing in databases: a group of people could be arranged in a database like this:
and 8 can be written as 2 , while 5, 6, and 7 can be written using some
The prefix function Π for a pattern encapsulates knowledge about how the pattern matches against shifts of itself. This information can be used to avoid useless shifts of the pattern ‘p’. In other words, this enables avoiding backtracking on the string
In developing SSIM, following four symbols have been used to denote the direction of relationship between two barriers i and j.