False. A single-level page table is an array A where A[p] is either the physical page number of virtual page p or is a null page number. It does address translation in a single fetch.

A two-level page table, such as the table use by the Intel x86 family of processors, breaks pages into large groups. Each virtual page p is broken into a group number g_p and member number m_p in the group. If A[g_p] is not null, then A[g_p][m_p] is either a physical page number or is null. If A[g_p] is null, then p is not in memory. So a two-level page table requires two fetches to do an address translation.

The advantage of a two-level page table is that it uses less memory. By storing a single null page number in A[g], the table says that all pages in group g are not currently in memory.