0% found this document useful (0 votes)
142 views2 pages

BSC Bca 3 Sem It Data Structures 78181 Jan 2021

This document is an exam paper for a Data Structures course. It contains instructions for the exam, which has two sections - Section A with 10 short answer questions worth 2 marks each, and Section B with 6 longer answer questions worth 10 marks each where students must attempt 4. Section A covers topics like dangling pointers, arrays, big O notation, stacks, hashing, sparse matrices, reverse polish notation, out-degree, sorting, and recursion. Section B asks about pointers and dynamic memory allocation, graph search algorithms, converting infix to postfix notation, algorithm complexity analysis, queues, and binary search trees. Students are warned that disclosing their identity or marking passing requests on the exam paper could lead to disciplinary action.

Uploaded by

Ritik Anand
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
0% found this document useful (0 votes)
142 views2 pages

BSC Bca 3 Sem It Data Structures 78181 Jan 2021

This document is an exam paper for a Data Structures course. It contains instructions for the exam, which has two sections - Section A with 10 short answer questions worth 2 marks each, and Section B with 6 longer answer questions worth 10 marks each where students must attempt 4. Section A covers topics like dangling pointers, arrays, big O notation, stacks, hashing, sparse matrices, reverse polish notation, out-degree, sorting, and recursion. Section B asks about pointers and dynamic memory allocation, graph search algorithms, converting infix to postfix notation, algorithm complexity analysis, queues, and binary search trees. Students are warned that disclosing their identity or marking passing requests on the exam paper could lead to disciplinary action.

Uploaded by

Ritik Anand
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

Roll No. Total No.

of Pages : 02
Total No. of Questions : 16
B.Sc. (IT) / BCA (Sem.–3 )
DATA STRUCTURES
Subject Code : UGCA-1915
M.Code : 78181
Time : 3 Hrs. Max. Marks : 60

INST RUCT IONS T O CANDIDAT ES :


1. SECTION-A is COMPULSORY cons is ting of TEN questions carrying TWO marks
each.
2. SECTION-B c ontains SIX questions ca rrying TEN mark s each a nd students hav e
to attempt any FOUR questions .

SECTION-A

Write briefly :

1) Dangling Pointer

2) Define Array

3) Big ‘O’ Notation

4) Define Stack

5) Hashing

6) Sparse Matrix

7) Reverse Polish Notation

8) out-degree

9) Sorting

10) Recursion

1 | M-78181 (S3)-570

https://www.ptustudy.com
SECTION-B

11) What is a pointer? How dynamic memory is allocated?

12) Explain depth first search and breadth first search in graphs.

13) How to convert in-fix notation into post-fix notation?

14) How complexity of an algorithm is checked? Explain its types.

15) What is a Queue? Write algorithm to insert and delete a node in circular queue.

16) What is BST? Explain its traversals with an example.

NOTE : Disclosure of Identity by writing Mobile No. or Marking of passing request on any
paper of Answer Sheet will lead to UMC against the Student.

2 | M-78181 (S3)-570

https://www.ptustudy.com

You might also like