Scribd
Upload
35 views2 pages

Data Structure IA1

This document outlines the internal examination details for the B.E./B.Tech and M.E. programs in Computer Science and Engineering at Annapoorana Engineering College for the Data Structures course. It includes information about the exam format, types of questions (multiple choice, short answer, and long-form), and the distribution of marks across different cognitive levels according to Bloom's taxonomy. The exam is scheduled for November/December 2024 and consists of three parts with a total of 50 marks.

Uploaded by

aecsaranyadurai
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
35 views2 pages

Data Structure IA1

This document outlines the internal examination details for the B.E./B.Tech and M.E. programs in Computer Science and Engineering at Annapoorana Engineering College for the Data Structures course. It includes information about the exam format, types of questions (multiple choice, short answer, and long-form), and the distribution of marks across different cognitive levels according to Bloom's taxonomy. The exam is scheduled for November/December 2024 and consists of three parts with a total of 50 marks.

Uploaded by

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

DATE: 29.08.

24
ANNAPOORANA ENGINEERING COLLEGE,SALEM
(An AUTONOMOUS Institution)

B.E./B.Tech, M.E.- DEGREE INTERNAL EXAMINATION - I, NOV./DEC.- 2024


Semester III
Computer Science and Engineering
22CS301 Data Structures
Regulations - 2022
Time : 1.30 Hours Maximum : 50 Marks
PART – A (8 x 1 = 8 Marks) Multiple Choice Questions
Q.No. CO BTL
Answer All Questions
1. Choose of the following is the application of data structures?
CO1 K2
a) Image processing b) Decision making c) Block chain d) All of the above
2. A linear collection of data elements where the linear node is given by means of
pointer is called? CO1 K2
a) Linked list b) Node list c) Primitive list d) None
3. Implementation of a queue, where does a new element be inserted?
a) At the head of link list b) At the centre position in the link list CO1 K3
c) At the tail of the link list d) At any position in the linked list
4. How traversal can be performed In doubly linked lists,?
a) Only in forward direction b) Only in reverse direction CO1 K1
c) In both directions d) None
5. Process of inserting an element in stack is called ____________
CO2 K1
a) Create b) Push c) Evaluation d) Pop
6. The prefix form of A-B/ (C * D ^ E) is?
CO2 K4
a) -A/B*C^DE b) -A/BC*^DE c) -ABCD*^DE d) -/*^ACBDE
7. Which of the fallowing conditions correctly check the underflow condition in a
queue. CO2 K1
a)front=-1 b)rear=1 c)rear =size d) front=0
8. In a stack, if a user tries to remove an element from an empty stack it is called
_________ CO2 K1
a) Underflow b) Empty collection c) Overflow d) Garbage Collection
Q.No. PART- B (4×3 = 12 Marks)
CO BTL
Answer All Questions
9. State the properties of list abstract data type with suitable example. CO1 K1
10. Difference between arrays and lists CO1 K2
11. Label various operations performed on the stack? CO2 K1
12. List any four applications of stack. CO2 K1
PART – C (2 X 15 = 30 Marks)
Q.No. Marks CO BTL
Answer All Questions
Explain the insertion operation in linked list. How nodes are
13. (a) (i) 8 CO1 K4
inserted after a specified node
(ii) Demonstrate the deletion operation from a linked list 7 CO1 K2

(Or)
Discuss the operation of traversing linked list. Write the
(b) (i) 8 CO1 K2
algorithm and give an example.
State how polynomial expression can be represented using
(ii) 7 CO1 K1
linked list?
Create an algorithm for Push and Pop operations on Stack
14. (a) (i) 8 CO2 K6
using Linked list. (8)
Define an efficient representation of two stacks in a given
(ii) 7 CO2 K1
area of memory with n words and explain.
(or)
(b) (i) Convert infix to Postfix notation-A*B+(C-D/E)# 8 CO2 K3
Evaluate the addition and deletion operations performed on
(ii) 7 CO2 K5
a circular queue with necessary algorithms
Table of Specification

LOTS HOTS
Blooms Remembering Understanding Applying Analyzing Evaluating Create Total
(K1) (K2) (K3) (K4) (K5) (K6)
Marks 27 20 9 9 7 8 80
% 33.75 25 11.25 11.25 8.75 10 100

Prepared by HoD

You might also like