IEMCET computing preparation: Graph representations — worked example and reasoning

Problem to solve

Which representation often uses less space for a large sparse graph?

Try the problem before reading the answer. Record the requested quantity, relevant information and any interpretation choices. Keep this original practice example separate from official examination questions or previous-year papers.

Choose the governing principle

A full matrix uses Θ(V²) entries; a typical adjacency-list representation uses Θ(V+E) storage.

An adjacency list records neighbours; an adjacency matrix records possible vertex pairs. Their storage patterns differ.

Worked answer

An adjacency list, because E is small relative to V².

The answer follows the stated model and the values in this question. Preserve exact expressions when given; if you use a numerical approximation, label it and keep sufficient precision until the final step.

Audit the reasoning

Trace a small example and a boundary case. Distinguish correctness from complexity, a necessary condition from a sufficient one, and declared constraints from coincidences in sample data. Check whether the question asks for an exact count, a bound or a qualitative property.

A specific error to avoid here: Comparing representations without specifying graph density can hide their main tradeoff.

Explain before repeating

Write a short explanation linking the governing principle to the answer rather than copying the final line. Identify one assumption and explain how violating it would make this method unreliable. Use the linked worksheet for a new task, then return to this example after a delay and solve it without the answer visible.

Official sources and verification

Sources checked on 26 October 2026. A source’s date, programme and campus limit which claims it supports. Official pages may change after review.

1. UEM Kolkata — IEMCET 2026 syllabus and instructions

   Historical course-specific preparation guidance. Some introductory route text conflicts with the central portal.

2. WBJEEB — JECA 2026 information bulletin

   2026 MCA syllabus and institution modules; Appendix 10 includes IEM Salt Lake. Historical, not a 2027 seat guarantee.

3. IIT Madras — GATE 2027 Computer Science syllabus

   Current GATE CS topic reference; IEMCET adoption of every 2027 revision is not asserted. MCA eligibility and programme paper instructions remain separate.

Found a discrepancy? Send the page and the official notice for correction.