DSA · Theory

Introduction

Theory

1/810

Introduction sits in a viva board. Arun’s job is marks stored somehow. Write that first.

Do Introduction once by hand. array vs list vs hash — one line each. Change one input. Say the new result out loud.

Introduction exists so Arun can keep marks stored somehow correct in a viva board.

Use Introduction when marks stored somehow must stay clear. If a simpler DSA step works, use that instead.

Introduction trap — reciting names with no cost. Arun loses marks for that every viva.

Introduction is not a lonely heading. Arun ties it to marks stored somehow.

One breath for Introduction, then marks stored somehow, then reciting names with no cost. Sit down.

Exam tip

Say Introduction in one breath, then array vs list vs hash — one line each, then reciting names with no cost.

# Introduction
data = [4, 1, 3]
print("start", data)
if data[0] > data[1]:
    data[0], data[1] = data[1], data[0]
print("after one step", data)

Introduction: dry-run [4, 1, 3]. Say the list after one step.