Course Name
BSc IT (Bachelor of Science in Information Technology)
Subject Code BT0065 (C Programming and Data Structures – Theory )
Get Questions
PART  A
PART  B
PART  C
C Programming and Data Structures – Theory Syllabus.
Unit 1: Introduction to C Language
Historical Development of C language; Character Sets; Variables; Keywords;
Data Types Constants; Operators and Expressions.
Unit 2: Algorithms & Flowcharts
Definition of Algorithm; Examples of Algorithms; Definition of Flowchart;
Example of Flowcharts.
Unit 3: Introduction to Programming
Structure of C Program; Compilation and Execution of a C Program; Decision
Making and Branching Statements; Break Statement; Continue Statement; Switch
Statement; Goto Statement; Iterative Statements.
Unit 4: Arrays
Formatted Output; Type Casting; Arrays; Language C Preprocessor; Macro
Expansion; File Inclusion. Storage Class.
Unit 5: Functions
Functions; User Defined Functions; Library Functions. Recursion.
Unit 6: Structures; Unions & Pointers
Structures; Array of Structures; Union; Defining Union Types; Initializing
Unions. Pointers; Dynamic Allocation of Memory; De allocation of Memory.
Unit 7: File Structures
Block Structure; Opening; Accessing and Closing Files; File Pointer; File
Open Modes; File Open Functions; File Read & Write Functions; File Close
Functions.
Unit 8: Overview of Data Structure
Example of Data Structure; Abstract Data Types (ADT); Levels of Data
Structure; Type of Data Structure; Application of Data Structure.
Unit 9: Stack and Queues
Operations on Stack; Push operation ;Pop operation ;Display Items of a Stack
;Stack Implementation; Stack Implementation using arrays; Stack Implementation
using structures. Applications of Stack. Polish Notation; Infix to Postfix
Conversion; Postfix Evaluation; Operations on Queue; Different types of Queues;
Ordinary Queue; Disadvantage of Ordinary Queue; Double Ended Queue (Dqueue);
Circular Queue; Priority Queue; Applications of Queues.
Unit 10: Linked Lists
Type of Linked Lists; Singly Linked List; Circular Linked List; Doubly
Linked Lists; Application of Linked List.
Unit 11: Trees and Their Applications
Tree Terminologies; Binary Tree; Balanced Tree (B Tree); AVL Tree;
Application of Trees
Unit 12: Graphs and Their Applications
Graph Terminologies; Graph Representation; Adjacency Lists; Adjacency
Matrix; Graph Traversal; Depth First Traversal; Breadth First Traversal.
Spanning Trees; Kruskal’s Algorithm; Prim’s Algorithm.
Unit 13: Searching and Sorting
Basic Searching Techniques: Sequential Search/Linear search, Binary Search;
Overview of Sorting Methods: Internal Sorting, Selection Sort, Bubble Sort
,Insertion Sort, Quick Sort, Heap Sort, Shell Sort, Radix Sort, External Sorts,
Merge Sort.
