Skip to main content

Screenshots from Windows 1.01

Windows 1.0 is a graphical personal computer operating environment developed by Microsoft, released on November 20, 1985, as the first version of the Microsoft Windows line. Version 1.01, also released in 1985, was the first point-release after Windows 1.00.  

Screenshots from Windows 1.01:

⇰ Desktop 
First Run

Empty Desktop

Desktop With Applications

⇰ Office Applications
Notepad

Text Editor

Calculator

Calendar

Clock

Address Book

⇰ Multimedia Applications
Media player, CD player, Volume level, and Sound: This GUI doesn’t have these features.

⇰ Networking Applications
Terminal
Phone Dialer: This GUI doesn’t have this feature.

⇰ Internet Applications
Browser, and Mail: This GUI doesn’t have these features.

⇰ Accessibility Applications
Keyboard Map: This GUI doesn’t have this feature.

⇰ Settings
Desktop themes, Display, Screensaver, Keyboard, Mouse, Accessibility, Power Management, Settings menu, and International Settings: This GUI doesn’t have these features. 
Time and date: This feature can be found in the General section. The only customizable feature was the double-click speed.

General

Appearance

⇰ System Managers
Application Manager: This feature can be found in the File Manager section.
Task manager: This GUI doesn’t have this feature.

File Manager

Running Applications

⇰ System Features
Help, Search, and Trashcan: This GUI doesn’t have these features.
Run

⇰ System Utilities
Command Prompt

⇰ Startup & Shutdown
Login and Logout screen, Shutting down, and Shutdown complete: This GUI doesn’t have these features.
Welcome splash

Shutdown Window

⇰ Installation
License: This GUI doesn’t have this feature.
Welcome screen

File Copying

Installation Complete

⇰ Dialogs
Color Selector: This feature can be found in the Appearance section.
About GUI

About Application

Font selection

Open File

⇰ Miscellaneous
Wrong password: This GUI doesn’t have this feature.

Popular posts from this blog

C Program To Check Whether A Number Is Palindrome Or Not.

This program takes an integer from user and the integer is reversed. If the reversed integer is equal to the integer entered by user then that number is a palindrome. If not that number is not a palindrome.   #include <stdio.h> int main()  { int num, temp, remainder, reverse = 0; printf("Enter an integer: "); scanf("%d", &num); /*  original number is stored at temp */ temp = num; while (num > 0)  { remainder = num % 10; reverse = reverse * 10 + remainder; num /= 10;   }

C Program To Convert Natural Numbers To Roman Numerals.

Roman Number System of representing numbers devised by the ancient Romans. The numbers are formed by combinations of the symbols I, V, X, L, C, D, and M, standing, respectively, for 1, 5, 10, 50, 100, 500, and 1,000 in the Hindu-Arabic numeral system. Natural numbers mean no negative numbers and no fractions, i.e. the whole numbers from 1 upwards: 1, 2, 3, and so on. Here is source code of the C program to convert natural numbers to Roman Numerals. It compiles and runs on any operating system. #include <stdio.h> void predigit(char num1, char num2); void postdigit(char c, int n); char romanval[1000]; int i = 0; int main() { int j; long number; printf("Enter any natural number: "); scanf("%d", &number);

Introduction To Algorithms, 3rd Edition

Before there were computers, there were algorithms. But now that there are computers, there are even more algorithms, and algorithms lie at the heart of computing. This book provides a comprehensive introduction to the modern study of computer algorithms. It presents many algorithms and covers them in considerable depth, yet makes their design and analysis accessible to all levels of readers. In this book, the authors tried to keep explanations elementary without sacrificing depth of coverage or mathematical rigor. Each chapter presents an algorithm, a design technique, an application area, or a related topic. Algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The book contains 244 figures — many with multiple parts — illustrating how the algorithms work. It also includes careful analysis of the running times of all algorithms. In this third edition, the entire book once again updated including changes cove...