BCA-CTIS

M/DSEC/VOC/DSE/PC/AEC/ VAC)

1.      learn the basics of data structure and algorithm complexities.

2.      acquire knowledge of arrays and strings.

3.      understand the idea of implementation for linked lists and stacks.

4.      learn various searching and sorting techniques along with the implementation of queues.

5* develop the project with data structures.

Internal Assessment Marks:30(20(T)+10(P)) End Term Exam Marks: 70(50(T)+20(P))

The examiner will set a total of nine questions. Out of which the first question will be compulsory. The remaining eight questions will be set from four units selecting two questions from each unit. The examination will be of three-hour duration. All questions will carry equal marks. The first question will comprise short answer-type questions covering the entire syllabus. The candidate will have to attempt five questions, selecting one from each unit. The first question will be compulsory.

The practicum will be evaluated by an external and an internal examiner. The examination will be of three-hour duration.

Algorithm Specifications: Performance Analysis and Measurement (Time and Space Analysis of Algorithms- Average, Best and Worst Case Analysis).

Arrays: Introduction, Linear Arrays, Representation of Linear Array in Memory, Two Dimensional and Multidimensional Arrays, Sparse Matrix and its Representation, Operations on Array: Algorithm for Traversal, Selection, Insertion, Deletion and its implementation.

Linked List: Introduction, Array vs. linked list, Representation of

linked lists in Memory, Traversing a Linked List, Insertion, Deletion, Searching into a Linked list, Type of Linked List.

Introduction to Queues: Simple Queue, Double Ended Queue, Circular Queue, Priority Queue, Representation of Queues as Linked List and Array, Applications of Queue. Algorithm on Insertion and Deletion in Simple Queue and Circular Queue. Priority Queues.

Searching and Sorting Techniques, Sorting Techniques: Bubble sort, Merge sort, Selection sort, Quick sort, Insertion Sort. Searching Techniques: Sequential Searching, Binary Searching.

Students are advised to do laboratory/practical practice not limited to but including the following types of problems:

·        Write a program that uses functions to perform the following operations on an array i) Creation ii) Insertion iii) Deletion

iv) Traversal.

·        Write a program that uses functions to perform the following operations on strings i) Creation ii) Insertion iii) Deletion iv) Traversal.

·        Write a program that uses functions to perform the following operations on a singly linked list i) Creation ii) Insertion iii) Deletion iv) Traversal.

·        Write a program that uses functions to perform the following operations on a doubly linked list i) Creation ii) Insertion iii) Deletion iv) Traversal

·        Write a program that implement stack (its operations) using

·        Write a program that implements Queue (its operations) using i) Arrays and ii) Linked lists (Pointers).

·        Write a program that implements the following sorting

i) Bubble sort ii) Selection sort iii) Quick sort.

·        Write programs for various types of tree traversals.

➢      Theory

·     Class Participation: 5

·     Seminar/presentation/assignment/quiz/class test etc.: 5

·     Mid-Term Exam: 10

➢      Practicum

·     Class Participation: NA

·     Seminar/Demonstration/Viva-voce/Lab records etc.: 10

·     Mid-Term Exam:   NA

End Term Exam Marks: 70(50(T)+20(P)

)

·        Seymour Lipschutz, Data Structures, Tata McGraw- Hill Publishing Company Limited, Schaum’s Outlines.

·        Yedidyan Langsam, Moshe J. Augenstein, and Aaron M. Tenenbaum, Data Structures Using C, Pearson Education.

·        Trembley, J.P. And Sorenson P.G., An Introduction to Data Structures with Applications, McGraw-Hill.

·        Mark Allen Weiss, Data Structures and Algorithm Analysis in C, Addison- Wesley.

* Applicable for courses having practical components.