Data and file structure

Question:
I want to get the syllabus of BCA III sem of Data And File Structure Using C for Kachchh University.

Answer:-

Here is the syllabus for BCA III sem for Data And File Structure Using C paper of Kachchh University…

INTRODUCTION: (5%)
Data Structure and its classification (Primitive, non-primitive: linear, non-linear)

ARRAYS: (10%)

Array concept (one dimension, two dimension), Memory representation of single dimension array & two dimension array (row major, column major), Operations for one dimension array (insertion, deletion, traversal), Sparse matrix, Memory representation of sparse matrix (vector notation).

SEARCHING AND SORTING: (15%)

Sequential search, Binary search, Comparison in terms of efficiency, Bubble sort,Selection sort, Insertion sort, Quick sort, Merge sort, Comparison in terms of their efficiency.

STACKS AND QUEUES: (25%)
Properties of stacks, Stack representation using array, Stack operations (push, pop, peep, and change), and applications of stack (recursion, evaluating arithmetic expression: conversion from infix to postfix notation, evaluating postfix expression) Properties of queues, Circular queue, Priority queue, Double ended queue, Queue representation using array, Queue operations (insert, delete), Applications of queue (CPU scheduling in multiprogramming environment, Round Robin algorithm)

LINKED LISTS: (15%)

Singly linked lists, Doubly linked list, Circular linked list, Header linked list, Operations of linked list (insertion, deletion, traversal, split, join), Application of linked list (Representation of polynomial and its addition, Dynamic storage management).

TREES: (30%)

Definition,

Binary trees and its properties, Binary search tree, Representation of tree using array and linked list, Operations on binary trees (creation, traversal: preorder, post order, inorder, converse preorder, converse inorder, converse postorder, search, deletion), Applications of binary trees, Threaded binary tree, Heap tree (insert and delete operations, heap sort), B-trees (indexing and search operation), AVL trees (representation and AVL rotations), Expression tree (evaluation), Forests (introduction).

For the syllabus of other papers of BCA III sem click on the following attachment

KSKVKU Syllabus BCA III Sem

Leave a Comment