Data Structures Unit 1 Handwritten Notes AKTU (BCS301)

AKTU · BTECH · Semester 3 · Data Structures · Unit 1 · Handwritten Notes

AKTU Data Structures (BCS301) Unit 1 handwritten notes for B.Tech Semester 3 – Introduction, Arrays & Linked Lists. Topics: Introduction & Complexity…

Open the interactive reader to study this resource on AcademicArk.

Unit 1: Introduction, Arrays & Linked Lists – AKTU syllabus topics

  • Introduction & Complexity Analysis: Asymptotic Notations (Big O, Theta, Omega), Abstract Data Type (ADT)
  • Arrays: Row & Column Major Order / Index Formulae, Sparse Matrices
  • Linked Lists: Doubly Linked List, Circular Linked List, Polynomial Representation & Arithmetic

Most asked AKTU PYQ questions from Unit 1

  1. Q2a. Consider a multi-dimensional Array A[90] [30] [40] with base address starts at 1000. Calculate the address of A[10] [20] [30] in row major order and column major order. Assume the first element is stored at A[2][2][2] and each element take 2 byte. (10 marks, 2020-21)
  2. Qa. Each element of an array Data [20][50] requires 4 bytes of storage. Base address of Data is 2000. Determine the location of Data [10][10] when the array is stored as: (i) Row major (ii) Column major (7 marks, 2023-24)
  3. Q2a. Assume that the declaration of multi-dimensional arrays X and Y to be, X (-2:2, 2:22) and Y (1:8, -5:5, -10:5) (i) Find the length of each dimension and number of elements in X and Y. (ii) Find the address of element Y (2, 2, 3), assuming Base address of Y = 400 and each element occupies 4 memory… (10 marks, 2022-23)
  4. Q3a. Suppose a three dimensional array A is declared using A[1:10, -5:5, -10:5) (i) Find the length of each dimension and the number of elements in A (ii) Explain Row major order and Column Major Order in detail with explanation formula expression. (10 marks, 2021-22)
  5. Q3b. Suppose a three-dimensional array A is declared using A[1:10, -5:5, -10:5) (i) Find the length of each dimension and the number of elements in A (ii) Explain Row major order and Column Major Order in detail with explanation formula expression. (7 marks, 2025-26)
  6. Q3a. How to represent the polynomial using linked list ? Write a C program to add two polynomials using linked list. (10 marks, 2022-23)
  7. Q3b. Discuss the representation of polynomial of single variable using linked list. Write 'C' functions to add two such polynomials represented by linked list. (10 marks, 2021-22)
  8. Q3b. Illustrate how to represent the polynomial using linked list? Construct a C program to add two polynomials using linked list. (7 marks, 2024-25)
  9. Qb. How will you create link list representation of a polynomial. Explain it with the suitable example. (7 marks, 2023-24)
  10. Q2a. An array ARR[-5…15, 10…20] stores elements in Row Major Wise with each element requiring 2 bytes of storage. Evaluate the address of ARR[10][15] when the base address is 2500. (7 marks, 2024-25)

AKTU paper codes: BCS301, KCS301, BCS301H, KCS301H

Other Data Structures units

Data Structures previous year papers

More Data Structures resources

Browse all notes · Semester 3 notes