Chapter 2. Linked Lists

Posted on by
Reply
  1. Write code to remove duplicates from an unsorted linked list.
    FOLLOW UP
    How would you solve this problem if a temporary buffer is not allowed?
  2. Implement an algorithm to find the nth to last element of a singly linked list.
  3. Implement an algorithm to delete a node in the middle of a single linked list, given only access to that node.
    EXAMPLE
    Input: the node c from the linked list a->b->c->d->e
    Result: nothing is returned, but the new linked list looks like a->b->d->e

    Continue reading →

Chapter 1. Arrays and Strings

Posted on by
Reply

 

  1. Implement an algorithm to determine if a string has all unique characters. What if you cannot use additional data structures? [C++]
  2. Implement a function void reverse(char* str) in C or C++ which reverses a null-terminated string. [C++]
  3. Given two strings, write a method to decide if one is a permutation of the other. [C++]
  4. Write a method to replace all spaces in a string with ‘%20’. You may assume that the string has sufficient space at the end of the string to hold the additional characters, and that you are given the “true” length of the string. (Note: if implementing in Java, please use a character array so that you can perform this operation in place.)[C++]
    EXAMPLE
    Input: “Mr John Smith ”
    Output: “Mr%20John%20Smith” Continue reading →

8051 Development Tool

Posted on by
Reply

Current Features:

  1. Read a Intel Hex file (compiled by Keil uVision4)
  2. Generated a memory table which is used to write to AT89S52 microcontroler (8-Bit Microcontroller, 8KB ISP Flash)
  3. Converted the table into another format: 5F=0; DF=1 (the actual data that will be written to the device)
  4. Listed all usb devices

Unfinished parts:

  1. Read/write data from/to AT89S52 microcontroler

Continue reading →