Scribd
Upload
21 views2 pages

NAVEEN

The document is a test for a subject on C programming and data structures. It contains questions in three parts - Part A has 5 short questions worth 2 marks each, Part B has 2 long answer questions worth 15 marks each, and Part C has 1 long answer question worth 10 marks. The questions cover topics like arrays, stacks, queues, trees, pointers and more.

Uploaded by

pavi
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
21 views2 pages

NAVEEN

The document is a test for a subject on C programming and data structures. It contains questions in three parts - Part A has 5 short questions worth 2 marks each, Part B has 2 long answer questions worth 15 marks each, and Part C has 1 long answer question worth 10 marks. The questions cover topics like arrays, stacks, queues, trees, pointers and more.

Uploaded by

pavi
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/ 2

ARJUN COLLEGE OF TECHNOLOGY

Coimbatore-Pollachi Highway, Thamaraikulam, Coimbatore 642 120


Approved by AICTE,New Delhi & Affiliated to Anna University,
Chennai An ISO 9001:2015 Certified Institution.
DEPARTMENT OF ELECTRONIC COMMUNICATION ENGINEERING
ACADEMIC YEAR 2023 -2024 ODD SEMESTER
CONTINUOUS ASSESSMENT TEST – I

Subject Code & Name: CS3353/C PROGRAMMING AND DATA STRUCTURES


Regulation: R2021 Date: Semester: 03
Maximum Marks: 50 Time: 9.15am to 10.45am

Part – A (5×2=10)
Bloom’s Mapping
Sl.No Questions Taxonomy Level CO
1 Define Array Remember CO1
What are the pre-processor directives? List any two pre-processor
2 Remember CO1
directives

3 Define: Stack. List its operations Remember CO2


4 Write the basic structure of c programs Remember CO2
5 What are the tree and sub trees? Remember CO1
Part-B (15 x2 =30)
Understand CO2
Briefly explain the data types in c programming
6 (or)
Explain about the types of operators.

7 Briefly explain the pre-processor directives in c programs Understand


(or) CO2
Briefly explain the Stack and queue

Part-C (10 x1 =10)


CO1
Understand
8 Explain about ADT and its types
Understand CO3

Course Instructor HoD


ARJUN COLLEGE OF TECHNOLOGY
Coimbatore-Pollachi Highway, Thamaraikulam, Coimbatore 642 120
Approved by AICTE,New Delhi & Affiliated to Anna University,
Chennai An ISO 9001:2015 Certified Institution.

DEPARTMENT OF ELECTRONIC COMMUNICATION ENGINEERING


ACADEMIC YEAR 2023 -2024 ODD SEMESTER
CONTINUOUS ASSESSMENT TEST – I

Subject Code & Name: CS3353/C PROGRAMMING AND DATA STRUCTURES


Regulation: R2021 Date: Semester: 03
Maximum Marks: 50 Time: 9.15am to 10.45am

Part – A (5×2=10)
Bloom’s Mapping
Sl.No Questions Taxonomy Level CO
1 Define Recursion Remember CO1
2 Write short notes on’ ENUM’ Remember CO1
3 List the advantages of linked list over arrays. Remember CO2
4 What is the role of pointers in call by references Remember CO2
5 What is binary search tree? Remember CO1
Part-B (15 x2 =30)
Briefly explain the AVL trees Understand CO2
6 (or)
Explain about the Tree traversal in data structures

Explain the AVL tree applications, Advantages and Disadvantages Understand


7 of AVL trees.
(or) CO2

Briefly explain the tree terminologies in data structures

PART-C (10 x1 =10)


CO1
8 Explain about the applications of data structures Understand
Understand CO3

Course Instructor HoD

You might also like