data structures
• 1 Vote(s) - 2 Average
• 1
• 2
• 3
• 4
• 5
 seminar surveyer Active In SP Posts: 3,541 Joined: Sep 2010 29-12-2010, 04:43 PM PRESENTED BY, S.JAILANI BEEVI WORST CASE ANALYSIS OF SHELL SHORT Although shell sort is simple to code, the analysis of its running time is quite another story. The running time of shellsort depends on the choice of increment sequence.   worst case analysis of shell sort.ppt (Size: 2.1 MB / Downloads: 119)
 seminar addict Super Moderator Posts: 6,592 Joined: Jul 2011 01-02-2012, 12:03 PM data structures   Data structre.pptx (Size: 46.62 KB / Downloads: 50) Types of data structures 1. According to nature of Size: (i) Static data structure (ii) Dynamic data structure 2. According to occurrence: (i) Linear data structure (ii) Non-linear data structure 3. Primitive and Non-primitive data structure According to nature of Size 2. Dynamic data structure: Allow to change its size during program execution(add or delete elements at run time) Example: Link list, tree, graph etc. Primitive and Non-primitive data structure 1. Primitive Data Structure: Basic data structure and directly operated upon by the machine instructions. Example: integer , float, character. 2.Non-primitive Data Structure: Derived from primitive data structure. Emphasising on structuring of a group of homogeneous or heterogeneous data items. Example: Array , List , Tree , Graph.
 seminar paper Active In SP Posts: 6,455 Joined: Feb 2012 03-03-2012, 03:55 PM data structures   data-struct.doc (Size: 100 KB / Downloads: 23) 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.
 seminar ideas Super Moderator Posts: 10,003 Joined: Apr 2012 04-08-2012, 10:17 AM to get information about the topic " structures" full report ppt and related topic refer the link bellow topicideashow-to-structures seminar and presentationproject and implimentationsattachment.php?aid=29417 topicideashow-to-data-structures topicideashow-to-data-structures-interview-ques-ans topicideashow-to-connections-in-steel-structures