Home /Data Structures

Data Structures MS Computer Engineering/PhD Computer Engineering 2017

Data Structures MS Computer Engineering/PhD Computer Engineering 2017 — page 1

Discussion

Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.

Your email is only used to send you replies and occasional Ustadni updates. It is never shown publicly.

Log in to post under your name

No questions yet — be the first to ask.

Need Paper? See all →

Need a paper or stuck on a question? Ask here — students reply and you get an email.

Ask about a paper
  • Ayesha Mustafa· 2 days ago

    BS ZOOLOGY first semester Animal diversity ZOOL 101 - university of Punjab 2025

    0 replies Reply →
  • Abubakar· 2 days ago

    Literary criticism

    1 reply Reply →
  • Guest· 3 days ago

    this paper consists of 60 marks but now we have 35 marks paper.

    1 reply Reply →
  • Annie· 3 days ago

    Can you please tell me more past papers please because my exams are starting from next week

    1 reply Reply →
  • Ahmed· 7 days ago

    Did you provide the past papers of the science of society uos?

    1 reply Reply →

More Data Structures papers

See all

Paper text

Matoshri College of Engineering and Rescarch Center. Eklohare, Nashik

Department of Computer Engineering

S.E. Computes

Sabject: DS.A.

Theory Question Bank

Dale: 4ª OCT 17

In charge: Mr. P.S. Jadhav

Q1.

A) Define algorithm and its characteristics.

-Und 1-

B) Write pscudo C/C++ code to perfor simple trampose of sparse matrix. Discuss it tine coaplexay. 685

02.

A) Explain aymptotic notations-Big-O. Theta and Omega with one ex angle of each. (Ref: B2 Pg: 39-46)

B) Write poetado CFCA+ code to perform polynomial maltiplication using artays.

Q.3

A) Define the term: Data, Data Type. Data Structure with one example each.

B) What is the formal definition of as algarithm? Explain with one example

Q.4

A) what ace the different types of data structures?

By How poetudocode is related to an algorithm? How flowchirt related to an alge

0.5

(a) Write an algorithm that finds the turn of fint Nintegers

(b)Explain Persistent & Epheneral Data Structures.

6M

6M

Unit2

Q.

A) Define the data structure ordered list (or Linear List) and with vaitable examples. How can it be implemented?

(Ref: T2 page: 80,

47)

B) Explain the different representations of a single variable polytonial ting artuys? (Ref: T2 -

88. 90) 6 M

Q.2

A) What is linear data structure? Explain the concept of sequental organization with a suitaNe example

B) Write a pseudocode to add two polytorials. Discuss about its complexity.

7 M

Q.3

A) Weite a preado C++ code to perform adhition of two matrices. Docuss about is complexity

6M

B) Explais Memory representation and address calculation for a 1-D and a 2-D array with suitable example for rach. (Ref.

R3 - Pape 28 -

37) & (Rel. T2 - Page 108 - 112)

5 M

Q4

A) What in and ADT? Explain Artay as an ADT

B) Write a pseudocode tu tratapose ef a spurse matrix

6 M

7M

Q.5

A) What is a sparse matis? What are the advantages of spurie natrix over the 2-D array? Explain the ADT of sparse

matrix.

6M

By Wite short notes on Standard Library functions for string operations.

7 M

-Unt 3-

Q.1

a) Weite a C44 function maltiete to mukiply 2 long pontive integers represented by singly circular linked lie. (Ref

R3 pg: 244)

B) How can a polypomal in three variables to. y and i be represented by CL1.? Explan additico of two sach polysonials

(Ref: R3 pg: 245)

Q.2

a) Weite a routine addame to add two long inters of same sigh represented by DLL. (Ref R3 Py: 245)

b) Write an ADT for class Cirefine to implement CL1. (Ref R3 pg: 248)