CUET PG 2021 — Computer PYQ

1. Linear Logic (Sequence):

Isme elements ek line mein hote hain. Agar $n$ elements hain, toh kisi bhi beech wale element $i$ ke liye:

Inka traversal hamesha single run mein ho jata hai.

2. Non-Linear Logic (Hierarchy/Network):

Yahan ek element ke kai successors ho sakte hain.

Inhe traverse karne ke liye recursion ya complex algorithms ki zaroorat hoti hai.

Quick Solving Table

Data Structure	Type	Structure Equation
Array	Linear	$A[0]\to A[1]\to A[2]$
Linked List	Linear	${\text{Node}}_1\to {\text{Node}}_2\to {\text{Node}}_3$
Stack	Linear	$\text{Top}\to {\text{Element}}_{n-1}$
Queue	Linear	$\text{Front}\to \cdots \to \text{Rear}$
Tree	Non-Linear	$\text{Root}\to \text{Multiple Children}$
Graph	Non-Linear	$\text{Vertex}\to \text{Multiple Edges}$

Final Answer

Agar options mein Array, Linked List, Stack, ya Queue hai, toh woh Linear hain. Agar Tree ya Graph hai, toh woh Non-Linear hain.