FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE
📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download PTU B.Tech 2020 March CSE-IT 3rd Sem BTCS 304 Data Structures Question Paper

Download PTU (I.K. Gujral Punjab Technical University Jalandhar (IKGPTU) ) BE/BTech CSE/IT (Computer Science And Engineering/ Information Technology) 2020 March 3rd Sem BTCS 304 Data Structures Previous Question Paper

This post was last modified on 21 March 2020

Tags:PTUB.TechQuestion Papers2020MarchCSEIT3rd SemBTCS-304Data StructuresPDFDownloadPrevious YearExam Paper
Download Document
Download Document
PTU B.Tech Question Papers 2020 March (All Branches)


FirstRanker.com

Roll No. : [ ] [ ] [ ] Total No. of Pages : 02
Total No. of Questions : 18

--- Content provided by‍ FirstRanker.com ---

B.Tech. (CSE)/(IT) (2012 to 2017)
(Sem. - 3)
DATA STRUCTURES
Subject Code : BTCS-304
M.Code : 56594

--- Content provided by‍ FirstRanker.com ---

Time : 3 Hrs. Max. Marks : 60

INSTRUCTION TO CANDIDATES :

  1. SECTION-A is COMPULSORY consisting of TEN questions carrying TWO marks each.
  2. SECTION-B contains FIVE questions carrying FIVE marks each and students has to attempt any FOUR questions.
  3. SECTION-C contains THREE questions carrying TEN marks each and students has to attempt any TWO questions.

    4. --- Content provided by‍ FirstRanker.com ---

SECTION-A

Answer briefly :

  1. Write a short note on pointers.
  2. Define Big O notation.
  3. Discuss applications of Linked Lists.

    4. --- Content provided by⁠ FirstRanker.com ---

  4. List types of operators.
  5. Define priority queue.
  6. Discuss AVL trees.
  7. What is adjacency List?
  8. Write a short note on rehashing.

    9. --- Content provided by‌ FirstRanker.com ---

  9. What are advantages of selection sort?
  10. What are recursive procedures?

SECTION-B

  1. Write the advantage and disadvantage of Array and Link List data structures.
  2. What is algorithm complexity? How it is measured?

    3. --- Content provided by‌ FirstRanker.com ---

  3. Write an algorithm to convert infix expression to postfix expression by taking a suitable example.
  4. Compare direct address tables with hash tables.
  5. Illustrate the concept of depth-first search traversing of graph.

SECTION-C

  1. What is Hash function? How linear probing is used to resolve collision in Hash Tables?

    2. --- Content provided by⁠ FirstRanker.com ---

  2. Explain various methods in which a binary tree can be represented. Write any one in detail with example.
  3. Write an algorithm to sort an array of integers in the descending order using bubble sort.

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

FirstRanker.com


--- Content provided by FirstRanker.com ---


This download link is referred from the post: PTU B.Tech Question Papers 2020 March (All Branches)

This post was last modified on 21 March 2020