Computer Science Engineering
Level 1 Syllabus
Sr.No. Category Sub category Weight-age
1 DS Basics 1) DS Basics: Basic Terminologies: 1
Elementary Data Organizations, Data
Structure Operations: insertion, deletion,
traversal etc.; Analysis of an Algorithm
2) Searching: Linear Search and Binary 1
Search Techniques and their complexity
analysis
3) Sorting: Objective and properties of 2
different sorting algorithms: Selection
Sort, Bubble Sort, Insertion Sort, Quick
Sort, Merge Sort, Heap Sort; Performance
and Comparison among all the methods
2 Linked Lists, Stacks and 1) Linked Lists: Singly linked lists: 2
Queues Representation in memory; Algorithms of
several operations: Traversing, Searching,
Insertion into, Deletion from linked list;
Doubly linked list: operations on it and
algorithmic analysis
2) Stacks: ADT Stack and its operations: 2
Algorithms and their complexity analysis;
Applications of Stacks: Expression
Conversion and evaluation –
corresponding algorithms and complexity
analysis
3) Queue: ADT queue; Types of Queue: 2
Simple Queue, Circular Queue, Priority
Queue; Operations on each types of
Queues: Algorithms and their analysis
3 Trees and Graphs 1) Trees: Basic Tree Terminologies; 2
Different types of Trees: Binary Tree,
Threaded Binary Tree, Binary Search Tree,
AVL Tree; Tree operations on each of the
trees and their algorithms with complexity
analysis
2) Graphs: Basic Terminologies and 2
Representations; Graph search and
traversal algorithms and complexity
analysis
3) Hashing: Hashing 1
