Computer Science
for all
Foundation Course
School of Computer
and
Information Sciences

Assignment - I

  1. Search the web and write a report on the importance of Jacquard Loom in Computer Science.
  2. Search the web and find out five problems solved by the Greedy algorithms. Also, find the advantages and disadvantages of greedy algorithms.
  3. Type or copy the following passage into MSWord or LibreOffice and run the spell-checker. For each misspelt word, see which word among the options given by the spellchecker is correct. Do you think Levenshtein Edit distance algorithm is used? Justify your answer.

    “Well, I suppose you had better go down,” said the girl in a subued sort of voice. “Or” - she seemed to brighten - “shall we pour water on him from the staircase window?”

    I started violently. She had made the suggestion as if she considered it one of her best and brifhtest, and I suddenly realissed what it meant to play the host to a girl of her temperament and personality. All that I had ever heard or read about the reckless young generation seemed to come back to me.

    “Don't dream of it!”, I whispered unrgently. “Dismiss the project utterly and absolutely from your mind.”

    I mean to say, a ry J. Washburn Stoker seeking an errant daughter was bad enough. A J. Washburn Stoker stimulatied to additional acerbity by a jugful of H2O on his head, I declined to contemolate.

    It reminded me a of a Jeeves' gag – something about that faous chappie, Shakespeare, and “porpentine.” Our conversation at that time went something or other like,

    Jeeves: “I could tell a tale whose ligjtest word would ake thy knotted and combined locks to part ... like quills upon the fretful porpentine.”

    “I say, Jeeves! What is a porpwnbine?”

    “A porcupine, sir,” replied the honest fellow.

    “The man, Shakespeare, must be an ass, Jeeves. Why can't he call it a porcupine then?”

    “I would not venture to express such an opinion, sir, on one of the most celebrated writers of the language.”

    “I really don't understand these writer fellows, Jeeves; they take a simple, everyday object and then call it something like qwxzytbenine, and everyone puts them on a pedestal and they think they are kings or sowething. All wrong!”

  4. For the following distances between cities, use the algorithm discussed in class and find the shortest distances between each pair of cities.

    PQRST
    P 028141063
    Q 28 0211271
    R 1421 06944
    S 101269 025
    T 63714425 0

Assignment - II

Due Date: 14 April 2018
  1. (8 Marks) Search the web and write short notes on Memory Hierarchy showing the different kinds of memory used in a computer system. Make a table that compares the different memories based on the following characteristics:
    • Power Consumption
    • Reliability
    • Capacity
    • Cost
    • Speed
  2. (4 Marks) State how many bits are needed for representing the following numbers in binary; then, represent them in binary. The first one is done as an example.
    • 132: Requires 8 bits because $2^8 = 256 > 132$ and $2^7 = 128 < 132$. Representation: 1000 0100 (space is only for clarity; otherwise, the representation is 10000100)
    • 60
    • 25
    • -77
    • 600
  3. (4 Marks) Add the following numbers using 2's complement representation of binary numbers with 8 bits.
    • 30 + 52
    • 24 + (-11)
  4. (4 Marks) Read ISCII and Unicode representations for Indian language texts from the Internet and show how the following are represented.
    • Your name
    • कन्याकुमारी
T H E    E N D

Instructions