LSATHacks
  • Explanations
  • Tutoring
  • Courses
  • Login
  • Cart
  • Explanations
  • Tutoring
  • Courses
  • Login
  • Cart
LSAT Explanations › PrepTest 130 › Reading Comprehension › Section 2 › Passage 2

LSAT 130, Section 2, RC Passage 2, Philip Emeagwali

PT130.S2.P2

LSAT Preptest 130 explanations

RC Passage 2 Explanation

PASSAGE TEXT: The success that Nigerian-born computer scientist Philip Emeagwali (b. 1954) has had in …

Paragraph Summaries

  1. Philip Emeagwali pioneered the use of parallel computers to predict the flow of oil through oil fields. Parallel computers use a network of many small computers working at the same time. By contrast, traditional supercomputers work sequentially, which is powerful but slow.
  2. By mimicking the design of trees, Emeagwali was able to design an efficient parallel computer which connected and used 65,000 smaller computers.
  3. In 1996 Emeagwali proposed a parallel computer design based on honeycombs. He claims this will let us predict the weather a century in advance. Emeagwali expects that scientists will increasingly get solutions from nature.

Analysis

Note the difference between sequential and parallel. Sequential means “one after the other”. If you have to do a trillion things sequentially, you probably can’t do them very quickly. Whereas parallel computers can do many things at once.

The other key theme of this passage is that Emeagwali turns to solutions from nature. First trees (paragraph 2) and then honeycombs (paragraph 3).

# Note re: Philip Emeagwali

Generally LSAT passages stick to truth. It is worth mentioning that Philip Emeagwali has been the subject of an expose by a Nigerian newspaper, claiming that he did not invent parallel computing and exaggerated or invented most of his claimed accomplishments. You may read the articles here if you wish:

  • https://saharareporters.com/2010/10/18/how-philip-emeagwali-lied-his-way-fame
  • https://saharareporters.com/2010/11/16/what-philip-emeagwali-told-me
Previous Question
↑ Return to PT 130
Next Question

Section 2 · Reading Comprehension

Passage 1: Archaeological Remains

Q1–Q7
  • Analysis
  • 1
  • 2
  • 3
  • 4
  • 5
  • 6
  • 7

Passage 2: Philip Emeagwali

Q8–Q13
  • Analysis
  • 8
  • 9
  • 10
  • 11
  • 12
  • 13

Passage 3: Tangible-Object Theory

Q14–Q20
  • Analysis
  • 14
  • 15
  • 16, no explanation yet
  • 17, no explanation yet
  • 18, no explanation yet
  • 19, no explanation yet
  • 20, no explanation yet

Passage 4: Musical Elements

ComparativeQ21–Q27
  • Analysis
  • 21, no explanation yet
  • 22, no explanation yet
  • 23, no explanation yet
  • 24, no explanation yet
  • 25, no explanation yet
  • 26, no explanation yet
  • 27, no explanation yet

Quick Jump PT Section Que

Hi, I'm Graeme Blake

I scored a 177 on the LSAT. I founded LSATHacks and created the LSAT Mastery Seminars to help students succeed.

I’ve personally written explanations for 5,000+ LSAT questions. If you find these explanations helpful, you'll definitely like our courses.

Join my email list for LSAT study tips and resources.

Leave a Reply Cancel reply

Your email address will not be published. Required fields are marked *

Free LSAT Email Course

My best LSAT tips, straight to your inbox

Increase Your Score

LSATHacks Courses Aiming For The 170S? See exactly how a top scorer thinks INCREASE YOUR SCORE
“The seminars teach you how to think like a high-scorer so that you can choose the correct answer quickly.” — Jay
“Not only did my score improve but I was able to approach LR with utter confidence” — Kacie L.

Resources

  • Articles
  • Blog
  • Free Email Course
  • LSAT Preptest Converter
  • Experimental Section Checker
  • LSAT Prep Books

About LSATHacks

  • About/Contact
  • Courses
  • Free Trial

Community

  • Discord
  • Social Media
  • Webinars
Disclaimer: Use of these explanations requires official LSAT preptests. LSAT is a registered trademark of LSAC.
LSAC does not review or endorse specific test preparation materials or services and has not reviewed this site.

© Copyright 2026 LSATHacks. All Rights Reserved. | Privacy | Terms