0% found this document useful (0 votes)
33 views

Student Copy of Module1 Test

This document contains details of a module test for the course "Data Structures and Applications" with course code BCD304. The test contains 6 questions to be held from 8am to 9am on 06/01/2024. The questions assess different cognitive levels and cover course outcomes related to data structures, linear arrays, user-defined structures, sparse matrices, stacks, and converting infix to postfix expressions.
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
0% found this document useful (0 votes)
33 views

Student Copy of Module1 Test

This document contains details of a module test for the course "Data Structures and Applications" with course code BCD304. The test contains 6 questions to be held from 8am to 9am on 06/01/2024. The questions assess different cognitive levels and cover course outcomes related to data structures, linear arrays, user-defined structures, sparse matrices, stacks, and converting infix to postfix expressions.
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

Course Title: Data Structures and Applications Course Code: BCD304

Date: 06/01/2024 Time: 8am to 9 am


Module Test 1
Note: Answer all the questions.

Q. RBT
Question Marks CO
No. Level

1 Define data structures. Explain with neat block schematic different types of data
5 L2 CO1
structures with examples. What are the primitive operations that can be performed?

2 What is a linear array? Discuss the representation of linear arrays in memory.


Write a C-functions to i) Insert at a given position ii) Delete at a given position iii) 5 L2 CO1
Display.

3 Explain user defined structures with respect to C. Give structure definition and
declaration for EMPLOYEE data with the following information: ID, Name and Dob 5 L2 CO1
(Date of birth).

4 Define Sparse matrix. Write a transpose function to transpose a given sparse matrix
and Express the given Sparse Matrix as triplet and find its transpose.

[ ]
15 0 0 22
0 11 3 0 5 L3 CO1
0 0 0 −6
0 0 0 0
91 0 0 0
0 0 28 0

5 Define stack. Explain the different operations that can be performed on stack using C
5 L2 CO1
functions.

6 Write an algorithm to convert an infix expression to postfix. Apply the same for the
given infix expression. 5 L3 CO1
A*(B+D)/E-F*(G+H/K)

Course Title: Data Structures and Applications Course Code: BCD304


Date: 06/01/2024 Time: 8am to 9 am
Module Test 1
Note: Answer all the questions.

Q. RBT
Question Marks CO
No. Level

1 Define data structures. Explain with neat block schematic different types of data
5 L2 CO1
structures with examples. What are the primitive operations that can be performed?

2 What is a linear array? Discuss the representation of linear arrays in memory.


Write a C-functions to i) Insert at a given position ii) Delete at a given position iii) 5 L2 CO1
Display.

3 Explain user defined structures with respect to C. Give structure definition and 5 L2 CO1
declaration for EMPLOYEE data with the following information: ID, Name and Dob
Note: Answer all the questions.

Q. RBT
Question Marks CO
No. Level

(Date of birth).

4 Define Sparse matrix. Write a transpose function to transpose a given sparse matrix
and Express the given Sparse Matrix as triplet and find its transpose.

[ ]
15 0 0 22
0 11 3 0 5 L3 CO1
0 0 0 −6
0 0 0 0
91 0 0 0
0 0 28 0

5 Define stack. Explain the different operations that can be performed on stack using C
5 L2 CO1
functions.

6 Write an algorithm to convert an infix expression to postfix. Apply the same for the
given infix expression. 5 L3 CO1
A*(B+D)/E-F*(G+H/K)

You might also like