Scribd
Upload
323 views1 page

CS (ECE) 301 Question Paper (DS) Paper - UT 1

Guru Nanak Institute of Technology Department of Computer Science & Engineering held a paper on Data Structures for second year CSE students. The paper was divided into 3 questions worth a total of 15 marks - the first question asked students to define data structures, abstract data types, and algorithms, the second asked to convert an infix expression to postfix, and the third asked to find the address of an element in a 2D array under row major and column major layouts.

Uploaded by

Sayani Chandra
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
323 views1 page

CS (ECE) 301 Question Paper (DS) Paper - UT 1

Guru Nanak Institute of Technology Department of Computer Science & Engineering held a paper on Data Structures for second year CSE students. The paper was divided into 3 questions worth a total of 15 marks - the first question asked students to define data structures, abstract data types, and algorithms, the second asked to convert an infix expression to postfix, and the third asked to find the address of an element in a 2D array under row major and column major layouts.

Uploaded by

Sayani Chandra
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

GURU NANAK INSTITUTE OF TECHNOLOGY

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

Paper Name: Data Structures


Paper Code: CS 301
CSE I, CSE II

Year: 2nd Semester: 3rd


Time Allotted: 1 hour Full Marks: 15

Answer any three questions from the following

1. (a) What is Data Structure? How many types of Data Structures are there?
(b) What is Abstract Data Type?
(c) What do you mean by Algorithm? [(1+1)+2+1]

2. Convert the following infix notation to postfix expression


A+[(B+C)+(D+E)*F]/G [5]

3. In a two dimensional array 12 × 15 with each element occupying 2 bytes of memory


with the address of the first element [1, 1] is 5000. Find the address of [6, 4] for both
Row major & Column major cases. [5]

4.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy