0(0)

GW-BASIC

Description

GW-BASIC is a dialect of the BASIC programming language developed by Microsoft from IBM BASICA. Functionally identical to BASICA, its BASIC interpreter is a fully self-contained executable and does not need the Cassette BASIC ROM found in the original IBM PC. It was bundled with MS-DOS operating systems on IBM PC compatibles by Microsoft.

The language is suitable for simple games, business programs and the like. Since it was included with most versions of MS-DOS, it was also a low-cost way for many aspiring programmers to learn the fundamentals of computer programming. Microsoft also sold a BASIC compiler, BASCOM, compatible with GW-BASIC, for programs needing more speed.

According to Mark Jones Lorenzo, given the scope of the language, “GW-BASIC is arguably the ne plus ultra of Microsoft’s family of line-numbered BASICs stretching back to Altair BASIC – and perhaps even of line-numbered BASIC in general.”

Topics for this course

59 Lessons

CHAPTER 1-PROBLEM SOLVING

Lecture 01-Problem Solving Intro00:17:31
Lecture 02-Analyze the Problem00:11:50
Lecture 03-Design Algorithm and Draw Flowcharts00:13:26
Lecture 04-Test & Debug the Program00:18:58
Lecture 05-Maintain and Update the Program00:16:02
Lecture 06-Document the Program00:11:25
Lecture 07-STRATEGY FOR DEVELOPING ALGORITHM00:20:13
Lecture 08-ALGORITHM TO MAKE A TEA00:9:32
Lecture 09-ALGORITHM TO FIND SUM OF FIRST 50 NATURAL NUMBERS00:12:50
Lecture 10-ALGORITHM TO FIND FACTORIAL OF A GIVEN NUMBER00:16:30
Lecture 11-FLOWCHART00:11:02
Lecture 12-GUIDELINES FOR DRAWING A FLOWCHART00:13:59
Lecture 13-ADVANTAGES OF FLOWCHARTS00:18:29
Lecture 14-FLOWCHART TO FIND FACTORIAL OF A NUMBER00:13:14
Lecture 15-STEPS TO FIND DENSITY OF A CYLINDER00:10:11
Lecture 16-FLOWCHART TO FIND LARGEST OF THREE NUMBER00:18:51
Lecture 17-FLOWCHART TO PREPARE A TEA00:4:56
Lecture 18-FLOWCHART FOR FINDING AREA OF A RECTANGLE00:7:51
Lecture 19-ALGORITHM FOR MAKING TELEPHONE CALL TO YOUR FRIEND00:6:40
Lecture 20-ALGORITHM TO CALCULATE AREA OF A CIRCLE00:13:15
Lecture 21-ANALYSIS, SOLVING COMPLEX PROBLEM00:12:03
Lecture 22-Difference between Runtime & Logical Errors00:13:49
Lecture 23-ALGO TO FIND DISTANCE TRAVELED BY A CAR00:11:09
MULTIPLE CHOICE QUESTIONS 1 TO 10
MULTIPLE CHOICE QUESTIONS 11 TO 20
MULTIPLE CHOICE QUESTIONS 21 TO 30

CHAPTER 2-DATA TYPES, ASSIGNMENT & INPUT OUTPUT STATEMENTS

CHATPER 3-CONTROL STRUCTURES

About the instructor

0 (0 ratings)

7 Courses

10 students

Free

Want to receive push notifications for all major on-site activities?