Education and Career Forum

Data Structure usually refers to a way of storing the data inside the computer so that it can be efficiently used when required. Algorithm design depends on the whole technique of data structure. To have an efficient algorithm design one needs to have an efficient data structure at first. The whole course of the data structure paper usually tries to focus in a pin hole manner on this aspect of computer science and impart a thorough knowledge to students about it. Some of the major topics covered under this paper are library management systems, job scheduling in Operating systems, compilers, prefix and post fix evaluations, non-linear and linear Data structures, Dijkstra’s shortest path, tabular comparison in sorting algorithms, nodes in binary, hash table and hash key functions, properties of Big O notation, polynomial, program for representation of Q data structures. For a clear cut concept in the whole processing and storage of data, the study of data structure is indispensible. The paper follows the standard AMIETE paper format and if it would be helpful for you to download the previous year’s question papers which are attached below.