Skip to main content

Free Online Books Tutorials interview questions

Book Reviews
Interview Questions
Magazine Feeds
Online Books

Home » Interview Questions » Computer Science

Computer Algorithms Data structures

Submitted by bookman on Wed, 10/28/2009 - 00:09

Computer Algorithms Data structures

What's the difference between a linked list and an array?
Implement a linked list. Why did you pick the method you did?
Implement an algorithm to sort a linked list. Why did you pick the method you did? Now do it in O(n) time
Describe advantages and disadvantages of the various stock sorting algorithms.
Implement an algorithm to reverse a linked list. Now do it without recursion.
Implement an algorithm to insert a node into a circular linked list without traversing it
Implement an algorithm to sort an array. Why did you pick the method you did?
Implement an algorithm to do wild card string matching.
Implement an algorithm to do wild card string matching.
Implement strstr() (or some other string library function).
Reverse a string. Optimize for speed. Optimize for space.
Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris is name My." Optimize for speed. Optimize for space.
Find a substring. Optimize for speed. Optimize for space.
Reverse the words in a sentence, i.e. "My name is Chris" becomes "Chris is name My." Optimize for speed. Optimize for space.
Find a substring. Optimize for speed. Optimize for space.
Suppose you have an array of 1001 integers. The integers are in random order, but you know each of the integers is between 1 and 1000 (inclusive). In addition, each number appears only once in the array, except for one number, which occurs twice. Assume that you can access each element of the array only once. Describe an algorithm to find the repeated number. If you used auxiliary storage in your algorithm, can you find an algorithm that does not require it?
Count the number of set bits in a number. Now optimize for speed. Now optimize for size.
Multiple by 8 without using multiplication or addition. Now do the same with 7.
Add numbers in base n (not any of the popular ones like 10, 16, 8 or 2 -- I hear that Charles Simonyi, the inventor of Hungarian Notation, favors -2 when asking this question).
Write routines to read and write a bounded buffer.
Write routines to manage a heap using an existing array.
Implement an algorithm to take an array and return one with only unique elements in it.
Implement an algorithm that takes two strings as input, and returns the intersection of the two, with each letter represented at most once. Now speed it up. Now test it.
Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date.
Implement an algorithm to print out all files below a given root node.
Given that you are receiving samples from an instrument at a constant rate, and you have constant storage space, how would you design a storage algorithm that would allow me to get a representative readout of data, no matter when I looked at it? In other words, representative of the behavior of the system to date.
How would you find a cycle in a linked list?
Give me an algorithm to shuffle a deck of cards, given that the cards are stored in an array of ints.
The following asm block performs a common math function, what is it?
cwd xor ax, dx
sub ax, dx
Imagine this scenario:
I/O completion ports are communictaions ports which take handles to files, sockets, or any other I/O. When a Read or Write is submitted to them, they cache the data (if necessary), and attempt to take the request to completion. Upon error or completion, they call a user-supplied function to let the users application know that that particular request has completed. They work asynchronously, and can process an unlimited number of simultaneous requests.
Design the implementation and thread models for I/O completion ports. Remember to take into account multi-processor machines.
Write a function that takes in a string parameter and checks to see whether or not it is an integer, and if it is then return the integer value.
Write a function to print all of the permutations of a string.
Write a function to print the Fibonacci numbers.
Write a function to copy two strings, A and B. The last few bytes of string A overlap the first few bytes of string B.
How would you write qsort?
How would you print out the data in a binary tree, level by level, starting at the top?

‹ Computer Science up Computer Science ›

Login or register to post comments

Tags in Tags

Cardiovascular System Computer Science Database Books DERMATOLOGY DIGESTIVE DISEASES GENARAL MEDICINE General GENETICS GYNECOLOGY AND OBSTETRICS Hardware Books HIV AIDS INFECTIOUS DISEASES Java Books Languages Math Books Medical Books Microsoft Books Networking NEUROSCIENCE NUTRITION ONCOLOGY Operating Systems OPHTHALMOLOGY Other Books PEDIATRICS PHARMACOLOGY RADIOLOGY Software Engineering UROLOGY Web Services and web Development

Book navigation

Art and Photography

Biographies and Memoirs

Book Reviews

Business and Investing

Comics and Graphic Novels

Computer Science

Computers and Internet

Cooking and culinary

Crafts and Hobbies

Engineering

Entertainment

Health and Life

History

Home and Garden

Interview Questions

Literature and Fiction

Magazine Feeds

Mathematics Books

Medicine

Mystery and Thrillers

Nonfiction

Online Books

Parenting and Families

Politics

Reference

Science Books

Self-Help

Sports

Text Books

Travel

User login

Username: *

Password: *

Create new account
Request new password

Follow on Twitter

Follow us on Twitter

Navigation

Popular content
Recent posts
Feed aggregator

Latest Online books

microsoft press microsoft windows communication foundation step by step
Inside Windows Communication Foundation
Essential Windows Communication Foundation (WCF): For .NET Framework 3.5
Microsoft .NET Server Solutions for the Enterprise
Microsoft .NET for Programmers
Expert C# 2008 Business Objects
Exam 70-536 Microsoft .NET Framework 2.0 Application Development Foundation
Visual Diagnosis in Emergency and Critical Care Medicine
Manual of Emergency and Critical Care Ultrasound
sex positions complete guide
.NET Development Security Solutions
Professional Enterprise .NET
Microsoft Â® ADO.NET Step by Step (Step By Step (Microsoft))
How to Design Programs An Introduction to Computing and Programming
Algorithms and Complexity
Processor Architecture Laboratory
Writing device drivers in Linux: A brief tutorial
Linux Device Drivers Demystified
Writing a Linux device driver
Write a Linux Hardware Device Driver
Developing Linux Device Drivers using Libusb Programming Interface
Engineering Mathematics Frequently Asked Questions
Advanced engineering mathematics (7th edition)
MATHEMATICS FOR ELECTRICAL ENGINEERING AND COMPUTING
Mathematics for Computer Science
Advanced Calculus for Engineers
Mathematical Methods for Engineers II
ISMAILIA A NARRATIVE OF THE EXPEDITION TO CENTRAL AFRICA FOR THE SUPPRESSION OF THE SLAVE TRADE
In The Heart Of Africa By Sir Samuel W. Baker

(c)chilanti.com