**EC8393 Important Questions Fundamentals of Data Structures in C**

EC8393 Important Questions Fundamentals of Data Structures in C Regulation 2017 Anna University free download. Fundamentals of Data Structures in C Important Questions EC8393 pdf free download.

**Sample EC8393 Important Questions Fundamentals of Data Structures in C**

1. What is meant by an abstract data type?

An ADT is an object with a generic description independent of implementation details. This description includes a specification of an components from which the object is made and also behavioral details of objects.

2. Advantages and Disadvantages of arrays?

Advantages: Data accessing is faster Array‟s are simple-in terms of understanding point and in terms of programming. Disadvantages: Array size is fixed Array elements stored continuously Insertion and deletion of elements in an array is difficult. (EC8393 Important Questions Fundamentals of Data Structures in C)

3. What is an array?

Array may be defined abstractly as a finite ordered set of homogenous elements. Finite means there is a specific number of elements in the array.

4. What is a linked list?

Linked list is a kind of series of data structures, which are not necessarily adjacent in memory. Each structure contains the element and a pointer to a record containing its successor. (EC8393 Important Questions Fundamentals of Data Structures in C)

5. What is singly linked list?

A singly linked list is a linked list, there exists only one link field in each and every node and all nodes are linked together in some sequential manner and this type of linked list is called singly linked list.

6. What is a doubly linked list?

In a simple linked list, there will‟topoint be on the next element, where as in a doubly linked list, there will be two pointers one to point the next element and the other to point the previous element location. (EC8393 Important Questions Fundamentals of Data Structures in C)

7. Define double circularly linked list?

In a doubly linked list, if the last node or pointer of the list, point to the first element of the list, then it is a circularly linked list.

8. What is the need for the header?

Header of the linked list is the first element in the list and it stores the number of elements in the list. It points to the first data element of the list. (EC8393 Important Questions Fundamentals of Data Structures in C)

9. Define Polynomial ADT

A polynomial object is a homogeneous ordered list of pairs <exponent, coefficient>, where each coefficient is unique. Operations include returning the degree, extracting the coefficient for a given exponent, addition, multiplication, evaluation for a given input. (EC8393 Important Questions Fundamentals of Data Structures in C)

Subject name | Fundamentals of Data Structures in C |

Semester | 3 |

Subject Code | EC8393 |

Regulation | 2017 regulation |

EC8393 Important Questions Fundamentals of Data Structures in C **Click Here To Download**

**EC8393 Important 16 mark Questions Fundamentals of Data Structures in C**

**EC8393 Syllabus Fundamentals of Data Structures in C**

**EC8393 Notes Fundamentals of Data Structures in C**