DOCSLIB.ORG

Final Exam 2019

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Final Exam 2019 Page 0 German University in Cairo January 18, 2020 Media Engineering and Technology Faculty Prof. Dr. Slim Abdennadher Dr. Nada Sharaf Dr. Mohamed Abdel Megeed Salem CSEN102: Introduction to Computer Science Winter Semester 2019-2020 Final Exam Bar Code Instructions: Read carefully before proceeding. 1) Please tick your major Major Engineering BI 2) Duration of the exam: 3 hours (180 minutes). 3) No books or other aids are permitted for this test. 4) This exam booklet contains 17 pages, including this one. Three extra sheets of scratch paper are attached and have to be kept attached. Note that if one or more pages are missing, you will lose their points. Thus, you must check that your exam booklet is complete. 5) Write your solutions in the space provided. If you need more space, write on the back of the sheet containing the problem or on the four extra sheets and make an arrow indicating that. Scratch sheets will not be graded unless an arrow on the problem page indicates that the solution extends to the scratch sheets. 6) When you are told that time is up, stop working on the test. Good Luck! Don’t write anything below ;-) Exercise 1 2 3 4 5 6 7 (Bonus) P Possible Marks 16 14 6 30 15 20 6 91 Final Marks CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 1 Exercise 1 General arithmetics (3+5+4+4=16 Marks) Number conversions In this exercise you have to convert numbers from one base to another. A number n of a base b other than 10 will be given on this page as nb For decimal numbers, the subscript base can be omitted (i. e., we write n instead of “n10”). For bases b that are greater than 10, please use uppercase Latin letters (A, B, . ) as digits beyond 9, just as it is done with hexadecimal numbers. a) Convert the following numbers into binary. Show your workout. 1. 7458 2. F ACE16 3. 467 b) Convert the following and show your workout. • The binary integer number 0101100111001101011101001110012 into hexadecimal. • Let m = 2113 and n = 2114. Find the base 5 representation of m + n. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 2 c) Give the least number of bits needed to perform the following operation in two’s complement and perform the operation afterward. −21 − 15 d) Let A = 11111010 and B = 00001010 be two 8-bit 2’s complement numbers. Compute the subtraction of A − B in 2’s complement notation and find out the corresponding decimal value. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 3 Exercise 2 Boolean functions (14 Marks) Circuit improvement Given the following boolean expression: AB0 + A(B + C)0 + B(B + C)0 a) Draw a truth table for the Boolean expression. b) Simplify the Boolean expression to reach a circuit that can be designed with 2 gates. Use the axioms of the Boolean Algebra. Please mention the applied rules. x + 0 = x x ∗ 1 = x x + 1 = 1 x ∗ 0 = 0 x + x = x x ∗ x = x x + x0 = 1 x ∗ x0 = 0 (x0)0 = x x + y = y + x xy = yx Commutativity x + (y + z) = (x + y) + z x(yz) = (xy)z Associativity x(y + z) = xy + xz x + yz = (x + y)(x + z) Distributivity (x + y)0 = x0y0 (xy)0 = x0 + y0 DeMorgan’s Law c) What is the functionality of the circuit? CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 4 Exercise 3 Boolean Circuits (6 Marks) Functionality Given the following truth table A B C X5 X4 X3 X2 X1 X0 0 0 0 1 1 1 1 1 0 0 0 1 0 0 0 0 1 0 0 1 0 0 0 0 1 0 1 0 1 1 0 0 1 0 0 0 1 0 0 0 0 1 0 1 1 1 0 1 0 0 1 1 1 0 1 1 0 0 1 0 0 0 1 1 1 1 0 1 0 1 0 0 What is the functionality of the circuit where A; B; C are the 3 input variables and X5;X4;X3;X2;X1 and X0 are the 5 output variables? Justify your answer. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 5 Exercise 4 (30 Marks) The 9’s complement of a decimal number is found by subtracting each digit in the number from 9. Decimal Digit 0 1 2 3 4 5 6 7 8 9 9’Complement 9 8 7 6 5 4 3 2 1 0 a) If you want to design a circuit for 9’s complement converter of digits, how many input variables and how many output variables do you need? Justify your answer. b) Draw a truth table that corresponds to the above table. Note: You should neglect all rows that do not correspond to digits. c) Find the Boolean expressions of the output variables using the sum of product method. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 6 d) Simplify all Boolean expressions e) Draw the circuit for the 9’s complement converter using and, or and negation gates. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 7 f) In the following, assume that we want to perform the subtraction of two decimal digits A and B: A − B We will be using 9’s complement to perform subtraction through addition. The algorithm is as follows: 1. Get the binary representation of A using 4 bits (let us call it ABin) 2. Get the 9’s complement of B (let us call it Bcomp). 3. Convert the 9’s complement of B to binary using 4 bits (let us call it BcompBin). 4. Add ABin and BcompBin 5. If the output is greater than 9: i. Correct the output by adding 6 (0110) to it 6. Now that you have an output, you check if a carry was produced to generate the output 7. If no carry is generated then: i. The subtraction is negative ii. To compute the actual value, take the 9’s complement of the result 8. If a carry is generated, then i. The final result is positive. ii. To compute the actual value, add the carry (fifth bit/most significant bit) to the rest of the number Examples: 1. Computing 8 - 3 • 8 in binary is 1000 • The 9’s complement of 3 is 6: 0110 • 1 0 0 0 0 1 1 0 ------- 1 1 1 0 • Output is greater than 9, thus we add 6 1 1 1 0 0 1 1 0 ------- (1) 0 1 0 0 • There is a carry, thus the number is positive. • We add the carry to the other bits 0 1 0 0 0 0 0 1 ------- 0 1 0 1 • The final output is 5 2. Computing 3-8 • 3 in binary is 0011 • The 9’s complement is 8 is 1: 0001 • 0 0 1 1 0 0 0 1 ------- 0 1 0 0 CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 8 • The number is not greater than 9 • There is not carry, thus the output is negative • The actual value is the 9’s complement of the output 0100: 4 which is 5 • Thus, the final output is -5 Your task is to design a 9’s complement subtractor for digits represented in binary 4-bits numbers. Assume that we have already • 9’s complement converters of digits as well as 4-bit adders (presented in lectures) in addition to and, or and not gates. • a Greater-Comparator-Than-9 components. This takes as an input a 4-bit binary number and returns 1 if the input is greater than 9 and 0 otherwise. Hint: Since we have branches in the algorithm presented above, we need to handle the if condition. To handle an if C then A else B statement, you could use the following Boolean expression: (C ∗ A) + (C0 ∗ B) CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 9 Exercise 5 (4+2+4+4+1=15 Marks) Given the following program arr = eval(input()) x = eval(input()) n = len(arr) r1 = -1 r2 = -1 i = 0 while i<n: if (x != arr[i]) : i+=1 else: r2 = i if (r1 == -1) : r1 = i i += 1 if (r1 != -1) : print( "First Mystery = " , r1, "Second Mystery = " , r2) else : print("Third Mystery") a) What is the output of the program for the following input arr = [1, 2, 2, 2, 2, 3, 4, 7 ,8 ,8 ] x = 8 Trace your program. b) What is the functionality of the program for any sorted list of integers with duplicates. Please determine the meaning of the three mysteries. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 10 c) Give the best case and worst case scenarios. Justify your answer in English without calculating the total number of operations. d) Give the total number of operations for the execution of the program for the worst case scenario. arr = eval(input()) -------------------------> 1 operation executed once x = eval(input()) n = len(arr) r1 = -1 r2 = -1 i = 0 while i<n: if (x != arr[i]) : i+=1 else: r2 = i if (r1 == -1) : r1 = i i += 1 if (r1 != -1) : print( "First Mystery = " , r1, " Second Mystery = " , r2) else : print("Third Mystery") e) Give the order of magnitude of the program above. CSEN102: Introduction to Computer Science, Final Exam, January 18, 2020 Page 11 Exercise 6 Iterative Algorithms (20 Marks) As presented in Exercise 4, the 9’s complement of a decimal number is the subtraction of each of its digits from 9.
Load more

Recommended publications
  • Count Down: Six Kids Vie for Glory at the World's Toughest Math
    Count Down Six Kids Vie for Glory | at the World's TOUGHEST MATH COMPETITION STEVE OLSON author of MAPPING HUMAN HISTORY, National Book Award finalist $Z4- 00 ACH SUMMER SIX MATH WHIZZES selected from nearly a half million EAmerican teens compete against the world's best problem solvers at the Interna• tional Mathematical Olympiad. Steve Olson, whose Mapping Human History was a Na• tional Book Award finalist, follows the members of a U.S. team from their intense tryouts to the Olympiad's nail-biting final rounds to discover not only what drives these extraordinary kids but what makes them both unique and typical. In the process he provides fascinating insights into the creative process, human intelligence and learning, and the nature of genius. Brilliant, but defying all the math-nerd stereotypes, these athletes of the mind want to excel at whatever piques their cu• riosity, and they are curious about almost everything — music, games, politics, sports, literature. One team member is ardent about water polo and creative writing. An• other plays four musical instruments. For fun and entertainment during breaks, the Olympians invent games of mind-boggling difficulty. Though driven by the glory of winning this ultimate math contest, in many ways these kids are not so different from other teenagers, finding pure joy in indulging their personal passions. Beyond the Olympiad, Steve Olson sheds light on such questions as why Americans feel so queasy about math, why so few girls compete in the subject, and whether or not talent is innate. Inside the cavernous gym where the competition takes place, Count Down reveals a fascinating subculture and its engaging, driven inhabitants.
    [Show full text]
  • Foundations of Computation, Version 2.3.2 (Summer 2011)
    Foundations of Computation Second Edition (Version 2.3.2, Summer 2011) Carol Critchlow and David Eck Department of Mathematics and Computer Science Hobart and William Smith Colleges Geneva, New York 14456 ii c 2011, Carol Critchlow and David Eck. Foundations of Computation is a textbook for a one semester introductory course in theoretical computer science. It includes topics from discrete mathematics, automata the- ory, formal language theory, and the theory of computation, along with practical applications to computer science. It has no prerequisites other than a general familiarity with com- puter programming. Version 2.3, Summer 2010, was a minor update from Version 2.2, which was published in Fall 2006. Version 2.3.1 is an even smaller update of Version 2.3. Ver- sion 2.3.2 is identical to Version 2.3.1 except for a change in the license under which the book is released. This book can be redistributed in unmodified form, or in mod- ified form with proper attribution and under the same license as the original, for non-commercial uses only, as specified by the Creative Commons Attribution-Noncommercial-ShareAlike 4.0 Li- cense. (See http://creativecommons.org/licenses/by-nc-sa/4.0/) This textbook is available for on-line use and for free download in PDF form at http://math.hws.edu/FoundationsOfComputation/ and it can be purchased in print form for the cost of reproduction plus shipping at http://www.lulu.com Contents Table of Contents iii 1 Logic and Proof 1 1.1 Propositional Logic ....................... 2 1.2 Boolean Algebra .......................
    [Show full text]
  • Notices of the American Mathematical Society Is Support, for Carrying out the Work of the Society
    OTICES OF THE AMERICAN MATHEMATICAL SOCIETY 1989 Steele Prizes page 831 SEPTEMBER 1989, VOLUME 36, NUMBER 7 Providence, Rhode Island, USA ISSN 0002-9920 Calendar of AMS Meetings and Conferences This calendar lists all meetings which have been approved prior to Mathematical Society in the issue corresponding to that of the Notices the date this issue of Notices was sent to the press. The summer which contains the program of the meeting. Abstracts should be sub­ and annual meetings are joint meetings of the Mathematical Associ­ mitted on special forms which are available in many departments of ation of America and the American Mathematical Society. The meet­ mathematics and from the headquarters office of the Society. Ab­ ing dates which fall rather far in the future are subject to change; this stracts of papers to be presented at the meeting must be received is particularly true of meetings to which no numbers have been as­ at the headquarters of the Society in Providence, Rhode Island, on signed. Programs of the meetings will appear in the issues indicated or before the deadline given below for the meeting. Note that the below. First and supplementary announcements of the meetings will deadline for abstracts for consideration for presentation at special have appeared in earlier issues. sessions is usually three weeks earlier than that specified below. For Abstracts of papers presented at a meeting of the Society are pub­ additional information, consult the meeting announcements and the lished in the journal Abstracts of papers presented to the American list of organizers of special sessions.
    [Show full text]
  • Number Systems
    Number Systems PDF generated using the open source mwlib toolkit. See http://code.pediapress.com/ for more information. PDF generated at: Sat, 09 Mar 2013 02:39:37 UTC Contents Articles Two's complement 1 Ones' complement 10 Binary-coded decimal 14 Gray code 24 Hexadecimal 39 Octal 50 Binary number 55 References Article Sources and Contributors 70 Image Sources, Licenses and Contributors 72 Article Licenses License 73 Two's complement 1 Two's complement Two's complement is a mathematical operation on binary numbers, as well as a binary signed number representation based on this operation. The two's complement of an N-bit number is defined as the complement with respect to 2N, in other words the result of subtracting the number from 2N. This is also equivalent to taking the ones' complement and then adding one, since the sum of a number and its ones' complement is all 1 bits. The two's complement of a number behaves like the negative of the original number in most arithmetic, and positive and negative numbers can coexist in a natural way. In two's-complement representation, negative numbers are represented by the two's complement of their absolute value;[1] in general, negation (reversing the sign) is performed by taking the two's complement. This system is the most common method of representing signed integers on computers.[2] An N-bit two's-complement numeral system can represent every integer in the range −(2N − 1) to +(2N − 1 − 1) while ones' complement can only represent integers in the range −(2N − 1 − 1) to +(2N − 1 − 1).
    [Show full text]
  • Omega: Chaitin's Demon
    From SIAM News, Volume 39, Number 1, January/February 2006 Omega: Chaitin’s Demon Meta Math!: The Quest for Omega. By Gregory Chaitin, Pantheon Books, New York, 2005, 240 pages, $26.00. Problem: Name a book that combines mathematical history, philosophy, more than a whiff of theology, personal palaver, and brilliant insights, along with evidence of a Borges-like imagination, eyebrow-raising mathematical constructions, breathtaking excitement, grandiose ruminations, and some bosh. Solution: The book under review. This solution may not be unique, but with the addition of a side condition—that the book be a guide for readers seeking to learn where the oracular mathematical demon Omega resides—we certainly have uniqueness. We live in an age when some of our most brilliant scientists and mathematicians want to go beyond the confines of their disciplines as cur- rently pursued and create something revolutionary: one super-transcendental step for mankind, something meta, and, with an eye on sales, something sensational. Some years ago Gregory Chaitin, one of the stars at the IBM T.J. BOOK REVIEW Watson Research Center, defined a real number (or, more precisely, a construction, because a specific number Ω By Philip J. Davis emerges only after a Turing machine and an encoding have been arbitrarily selected) that he dubbed . Definition: Ω is the probability that a random program on a universal Turing machine will halt under the probability distribu- tion that a program of length k has probability 2 –k. In its ambiguity, Ω is something like the god Jupiter—now a swan, now a bull, depending on the opportunities available.
    [Show full text]
  • Complete Issue 22, 2000
    Humanistic Mathematics Network Journal Issue 22 Article 18 4-1-2000 Complete Issue 22, 2000 Follow this and additional works at: http://scholarship.claremont.edu/hmnj Recommended Citation (2000) "Complete Issue 22, 2000," Humanistic Mathematics Network Journal: Iss. 22, Article 18. Available at: http://scholarship.claremont.edu/hmnj/vol1/iss22/18 This Full Issue is brought to you for free and open access by the Journals at Claremont at Scholarship @ Claremont. It has been accepted for inclusion in Humanistic Mathematics Network Journal by an authorized administrator of Scholarship @ Claremont. For more information, please contact [email protected]. ISSN 1 065-82 Humanistic Mathematics Network Journal Issue #22 April2000 STRUCTURAL SOCIO- LANGUAGE LINGUISTICS LINGUISTICS PEDAGOGY t '. ~ ~ MATHEMATICS __.. META- __.. MATHEMATICS MATHEMATICS EDUCATION In this issue... • What We Say, What Our Students Hear: A Case for Active Listening (p. 1) • Coherence in Theories Relating Mathematics and Language (p. 32) INVITATION TO AUTHORS EDITOR Essays, book reviews, syllabi, poetry, and letters are wel- Alvin White comed. Your essay should have a title, your name and ad- Harvey Mudd College dress, e-mail address, and a brief summary of content. In addition, your telephone number (not for publication) ASSOCIATE EDITORS would be helpful. Susan Addington If possible, avoid footnotes; put references and bibliogra- California State University, San Bernadino phy at the end of the text, using a consistent style. Please put all figures on separate sheets of paper at the end of the Stephen Brown text, with annotations as to where you would like them to State University of New York, Buffalo fit within the text; these should be original photographs, or drawn in dark ink.
    [Show full text]
  • Part I: 1865-1898
    MATHEMATICS AT CORNELL MATHEMATICS AT CORNELL: STORIES AND CHARACTERS, 1865—1965 PART I: 1865-1898 PART I: 1865—1898, THE FIRST THIRTY YEARS PREAMBLE CHAPTER I: BEFORE CORNELL, 1800—1867 I.1 THREE EUROPEAN SCIENTISTS I.2 SCIENCE AND EDUCATION IN THE UNITED STATES BEFORE 1870 I.3 THE FOUNDERS CHAPTER II: THE EARLY YEARS, 1868—1878 II.1 THE OPENING OF CORNELL II.2 THE DEPARTMENT OF E.W. EVANS, Z.H. POTTER AND H.T. EDDY II.3 THE DEPARTMENT OF J.E. OLIVER, G.W. JONES AND L.A. WAIT II.4 THE FIRST STUDENTS CHAPTER III: TRANSITION, 1879—1887 III.1 JAMES EDWARD OLIVER (ALMOST SACKED) III.2 ABRAM ROGER BULLIS (1854—1928) III.3 ARTHUR STAFFORD HATHAWAY (1858—1934) III.4 THE JOHNS HOPKINS UNIVERSITY III.5 TOWARDS A GRADUATE PROGRAM INTERMEZZO: ROLLIN ARTHUR HARRIS (1863—1918) CHAPTER IV: THE BIRTH OF THE GRADUATE PROGRAM, 1888—1898 IV.1 THE RISE OF A COMMUNITY IV.2 GÖTTINGEN AND THE MATHEMATICAL CLUB IV.3 THE DEATHS OF JAMES OLIVER AND ERNST RITTER IV.4 MATHEMATICS AND CORNELL’S FOUNDING IDEAS MATHEMATICS AT CORNELL The Ithaca Journal, January 1st 18281 Beneath our feet the village lies, Above, around, on either side Improvements greet us far and wide. Here Eddy’s factory appears, First of the hardy pioneers. Yes, Ithaca, where from this brow I gaze around upon you, now I see you not as first I knew. Your dwellings, humble, how and few, Your chimney smokes I then could count; But now my eyes cannot surmount The splendid walls that meet the eye And mock my early memory.
    [Show full text]
  • Powers and Exponents Page Historylast Edited by Joe Redish 2 Years, 8 Months Ago Class Content >Modeling with Mathematics > Math Recap
    Powers and exponents Page historylast edited by Joe Redish 2 years, 8 months ago Class content >Modeling with mathematics > Math recap In understanding how one variable depends on another, we introduced the idea of functional dependence. This helps us understand not just that one variable depends on another, but how it depends on the other. This is especially important in complex situations such as biology where many variables can be involved and "which one dominates" matters. Powers Some of the most useful and convenient functional dependencies that we will encounter are power laws. This means that the variable we choose to be dependent depends on the variable we choose to be independent by some power of that variable. Thus y = f (x ) = xN = x multiplied by itself N times says that "y goes like x raised to the Nth power". Exponentials We know that a quadratic function rises faster than a linear one (eventually) and a cubic rises faster than a quadratic. But there is an extremely useful function that eventually rises faster than any power. This is the exponential function. In this case, the variable is not raised to a power -- the variable itself is in the power that some constant is raised to. So as the variable gets bigger and bigger, the power the constant is raised to gets bigger and bigger. We write y = ex . Now e could be any constant, but we typically take it as a special transcendental number (that means it's decimal representation never stops and never repeats): e = 2.712... This particular choice is because when we make this choice, the function ex is its own derivative.
    [Show full text]
  • New Mathematical Diversions
    MARTIN GARDNER MARTIN GARDNER NEW MATHEMATICAL MATHEMATICALN~N RTIN GARDNER More a from Martin Gardner as they appeared in Scientific American with a Postscript and new Bibliography from the Author and over 100 drawings and diagrams The Mathematical Association of America Washington, D.C. @ 1995 by The Mathematical Association of America (Incorporated) Library of Congress Catalog Card Number 95-76293 ISBN 0-88385-517-8 Printed in the United States of America Current Printing (last digit): lo987654321 SPECTRUM SERIES Published by THE MATHEMATICAL ASSOCIATION OF AMERICA Committee on Publications JAMES W. DANIEL, Chair Spectrum Editorial Board ROGER HORN, Editor ARTHUR T. BENJAMIN DIPA CHOUDHURY HUGH M. EDGAR RICHARD K. GW DAN KALMAN LESTER H. LANGE MARY R. PARKER A. WAYNE ROBERTS EDWARD R. SCHEINERMAN SANFORD SEGAL SPECTRUM SERIES The Spectrum Series of the Mathematical Association of America was so named to reflect its purpose: to publish a broad range of books including biographies, accessible expositions of old or new rnathe- matical ideas, reprints and revisions of excellent out-of-print books, popular works, and other monographs of high interest that will appeal to a broad range of readers, including students and teachers of mathematics, mathematical amateurs, and researchers. All the Math That's Fit to Print, by Keith Devlin Complex Numbers and Geometry, by Liang-shin Hahn Cryptology, by Albrecht Beutelspacher From Zero to Infinity, by Constance Reid I Want to be a Mathematician, by Paul R. Halmos Journey into Geometries, by Marta Sved The Last Problem, by E. T. Bell (revised and updated by Underwood Dudley) The Lighter Side of Mathematics: Proceedings of the Eug2ne Strens Memorial Conference on Recreational Mathematics & its History, edited by Richard K.
    [Show full text]
  • Problem Books in Mathematics
    Problem Books in Mathematics Edited by P. Winkler Problem Books in Mathematics Series Editor: Peter Winkler Pell’s Equation by Edward J. Barbeau Polynomials by Edward J. Barbeau Problems in Geometry by Marcel Berger, Pierre Pansu, Jean-Pic Berry, and Xavier Saint-Raymond Problem Book for First Year Calculus by George W. Bluman Exercises in Probability by T. Cacoullos Probability Through Problems by Marek Capin´ski and Tomasz Zastawniak An Introduction to Hilbert Space and Quantum Logic by David W. Cohen Unsolved Problems in Geometry by Hallard T. Croft, Kenneth J. Falconer, and Richard K. Guy Berkeley Problems in Mathematics, (Third Edition) by Paulo Ney de Souza and Jorge-Nuno Silva The IMO Compendium: A Collection of Problems Suggested for the International Mathematical Olympiads: 1959-2004 by Dusˇan Djukic´, Vladimir Z. Jankovic´, Ivan Matic´, and Nikola Petrovic´ Problem-Solving Strategies by Arthur Engel Problems in Analysis by Bernard R. Gelbaum Problems in Real and Complex Analysis by Bernard R. Gelbaum (continued after index) Christopher G. Small Functional Equations and How to Solve Them Christopher G. Small Department of Statistics & Actuarial Science University of Waterloo 200 University Avenue West Waterloo N2L 3G1 Canada [email protected] Series Editor: Peter Winkler Department of Mathematics Dartmouth College Hanover, NH 03755 USA [email protected] ISBN-13: 978-0-387-34539-0 e-ISBN-13: 978-0-387-48901-8 Mathematics Subject Classification (2000): 39-xx Library of Congress Control Number: 2006929872 © 2007 Springer Science+Business Media, LLC All rights reserved. This work may not be translated or copied in whole or in part without the written permission of the publisher (Springer Science+Business Media, LLC, 233 Spring Street, New York, NY 10013, USA), except for with reviews or scholarly analysis.
    [Show full text]
  • In 1965, at the Ripe Old Age of Seventeen, I Spent Some Time, Quite
    Pragmatics 11:2.155-192 (2001) International Pragmatics Association DOI: 10.1075/prag.11.2.04cus CRITIQUE OF PUERILE REASON: A PRAGMATIC LOOK AT ARGUMENTATION IN J.P. MORELAND’S THE CREATION HYPOTHESIS1 Steven Cushing Abstract Key arguments in J.P. Moreland’s The Creation Hypothesis that purport to provide a scientific basis for creationism as an alternative to evolutionary theory are examined. Arguments based on Bayes’ theorem, the existence of intracable mathematical problems, the close correspondence between the actual values of basic physical constants and those required for the existence of life, the second law of thermodynamics, the nature of infinity, the specified complexity of DNA, and the human-specificity of language are analyzed and found wanting. In general, the arguments are seen to fail as a result of confusions in word usage or meaning, sometimes of a very elementary nature. The scientific, philosophical, and ethical implications of the overall argument’s failure and the reasons for it are discussed. Keywords: Creationism, Evolution, Argumentation, Scientific method, Fundamentalist theology. 1. Background In 1965, having just turned seventeen, I spent some time, quite by accident (some might say it was God’s plan), at the Summer Institute of Linguistics (SIL), an arm of the evangelical Christian Wycliffe Bible Translating Society. I had become aware of linguistics through a course I took the preceding summer taught by then MIT graduate student Barbara Hall (now Partee) across the Charles River from my home in Dorchester, Massachusetts. When an opportunity to learn more about the subject unexpectedly presented itself, I willingly acquiesced. I had a grant from the National Science Foundation to study philosophy of science and mathematics at the University of North Dakota in Grand Forks.
    [Show full text]
  • Small Is Beautiful” – Mathematical Modelling and Free Surface Flows
    Chapter 3 Where “Small is Beautiful” – Mathematical Modelling and Free Surface Flows John D. Fenton Abstract Mathematical and computational models in river and canal hydraulics of- ten require data that may not be available, or it might be available and accurate while other information is only roughly known. There is considerable room for the development of approximate models requiring fewer details but giving more insight. Techniques are presented, especially linearisation, which is used in several places. A selection of helpful mathematical methods is presented. The approximation of data is discussed and methods presented, showing that a slightly more sophisticated approach is necessary. Several problems in waves and flows in open channels are then examined. Complicated methods have often been used instead of standard sim- ple numerical ones. The one-dimensional long wave equations are discussed and presented. A formulation in terms of cross-sectional area is shown to have a surpris- ing property, that the equations can be solved with little knowledge of the stream bathymetry. Generalised finite difference methods for long wave equations are pre- sented and used. They have long been incorrectly believed to be unstable, which has stunted development in the field. Past presentations of boundary conditions have been unsatisfactory, and a systematic exposition is given using finite differences. The nature of the long wave equations and their solutions is examined. A simplified but accurate equation for flood routing is presented. However, numerical solution of the long wave equations by explicit finite differences is also simple, and more gen- eral. A common problem, the numerical solution of steady flows is then discussed.
    [Show full text]