Scribd
Upload
8 views1 page

Data Structures CAT - I QP

This document outlines the CAT-I examination for the Department of Computer Science and Engineering at Thangavelu Engineering College, covering the subject of Data Structures. It includes details on the exam structure, with Part A consisting of short answer questions and Part B featuring detailed questions on various data structures and their implementations. Part C focuses on in-depth explanations of specific topics like Doubly Linked Lists and Stack operations.

Uploaded by

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

Data Structures CAT - I QP

This document outlines the CAT-I examination for the Department of Computer Science and Engineering at Thangavelu Engineering College, covering the subject of Data Structures. It includes details on the exam structure, with Part A consisting of short answer questions and Part B featuring detailed questions on various data structures and their implementations. Part C focuses on in-depth explanations of specific topics like Doubly Linked Lists and Stack operations.

Uploaded by

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

THANGAVELU ENGINERING COLLEGE

KARAPAKKAM, CHENNAI -97.


CAT –I EXAMINATION
DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Sub code: CS3301 Time:3 Hrs


Sub Name: Data Structures Maximum: 100 marks
Date : 19-09-2024
PART - A ( 5x 2 = 20 marks)
1.Define List ADT.
2.How will you check whether the list is full or not ?
3.Define Linked List.
4.What are the types of Expressions ?
5.What are the operations performed in a List?
6.Define Stack.
7.What are the advantages of Stack?
8.Define Multilist.
9.What is a Function call?
10.Name Some Applications of Queue.

PART - B ( 5x13 = 65 marks)


11.a).Explain in detail Array based Implementation of List. (13)
(OR)
11.b).Describe Circularly Linked List and its operations. (13)

12.a).Write a C Program to perform Polynomial Addition. (13)


(OR)
12.b)What is a Singly Linked List ? Explain. (13)
13.a).How will you convert Infix to Postfix Expression ? Explain the steps with Example (13)
(OR)
13.b).i Write Short notes on Balancing Symbols with example. (07)
13.b)ii Differentiate Stack and Queue. (06)
14.a). Explain in detail Linked List based implementation of Queue
(OR)
14.b)How will you Evaluate the following Arithmetic Expressions (13)
(i)6523+8*+3+* (ii) 623+-382/+*2+3+
15.a). Explain in detail Linked List based implementation of Stack. (13)
(OR)
15.b). Explain in detail the Array Implementation of Queue. (13)
PART-C (1*15=15)
16.a).Explain in detail Doubly Linked List? What are the operations performed in it? (15)
(OR)
16.b). What is a Stack ? Explain in detail Insertion and Deletion operations in a Stack with
Array Implementation. (15) (15)

You might also like