PGoCareerGoCareer prep tools
LoginSign up
  • Java
  • Python
  • AI
  • React
  • Angular
  • PHP
  • Node.js
  • SQL
  • DSA
  • HTML
  • CSS
  • JS
  • Spring
  • ML
  • MongoDB

DSA · Theory

Introduction

← All stacks

Theory

1/810

Introduction

Introduction is a DSA topic. In plain words you use it for marks stored somehow in a viva board. Don’t start with a slogan — start with that picture.

Smallest example: array vs list vs hash — one line each. Type it, run it, and say what you see. If you can do that from memory, you know Introduction.

From the example next to this theory — Introduction: dry-run [4, 1, 3].

Trap — reciting names with no cost. Fix that before you talk about advanced DSA.

Viva — what is Introduction? Then show array vs list vs hash — one line each. Then name the trap.

Exam tip

What is Introduction? Show this: array vs list vs hash — one line each. Trap: reciting names with no cost.

Example

# 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.

Short notes

  • DefIntroduction — marks stored somehow in a viva board.
  • Rulearray vs list vs hash — one line each
  • Trapreciting names with no cost
  • Usea viva board

Questions

1

What is Introduction?

2

Give one small example of Introduction.

3

What mistake do beginners make with Introduction?

4

Where do you use Introduction?

1 / 810

P

GoCareerGo

Utilities · Preparation Hub · Resume · CV · Tools — one workspace.

Workspace

DashboardProfilePreparation HubResume builderCV builderCareer planning

PDF Tools

Merge PDFSplit PDFCompress PDFImage to PDFAll toolsJobs

Image & QR

Compress ImageResize ImageQR ScannerQR GeneratorBlogIT interview prep

Company

FAQFeedbackContactPrivacyTermsSitemap

© 2026 GoCareerGo. Keep moving forward.