Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
24 views1 page

MidSem Syllabus

The document outlines the mid-semester exam syllabus for the Department of Computer Engineering at Anjuman Islam Kalsekar Technical Campus. It covers topics including data structures, stacks, queues, linked lists, and trees, detailing their definitions, operations, and applications. The syllabus is structured to provide a comprehensive understanding of these fundamental concepts in computer engineering.

Uploaded by

rehaan986750
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
24 views1 page

MidSem Syllabus

The document outlines the mid-semester exam syllabus for the Department of Computer Engineering at Anjuman Islam Kalsekar Technical Campus. It covers topics including data structures, stacks, queues, linked lists, and trees, detailing their definitions, operations, and applications. The syllabus is structured to provide a comprehensive understanding of these fundamental concepts in computer engineering.

Uploaded by

rehaan986750
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Anjuman Islam Kalsekar Technical Campus

Department of Computer Engineering

Mid Sem Exam Syllabus

1. Introduction, Stack and Queues: Introduction to Data Structures, Concept


of ADT, Classification of Data Structures.
Stack: ADT, Representation, Operations, Applications of Stack: Infix to
postfix conversion, postfix expression evaluation, balanced parentheses.
Queue: ADT, Representation, Operations on Queue, Circular Queue.

2. Linked List: ADT, Representation, Array vs Linked list, Types of Linked list,
Singly linked list: Representation, Operations.
Doubly linked list: Representation, Operations
Circular linked list: Representation, Operations
Stack using linked list, Queue using linked list.

3. Trees: Binary Tree, Traversal of Binary Tree, Binary Search Tree,


Operations: Insertion and Deletion.

Safia Sadruddin
(Subject Owner)

You might also like