Computer Fundamentals and Programming in C is designed to serve as a textbook for the undergraduate students of engineering, computer science, computer applications, and information technology. The book seeks to provide a thorough overview of all the fundamental concepts related to computer science and programming. It lays down the foundation for all the advanced courses that a student is expected to learn in the following semesters. The book is divided into three parts, beginning with an introduction to computers illustrating the evolution, characteristics, basic orgranisation, and classification of computers along with their applications. It then delves into the concepts of input/output devices in detail and number representation including binary, octal, and hexadecimal number systems. Separate chapters on computer's memory, computer software, Internet, and introduction to algorithms and programming languages are covered next. Part two entails the fundamentals of C programming including a thorough introduction to programming in C language, decision control and loop statements, functions, arrays, strings, pointers, structure and union, file management, and preprocessor directives. Part three introduces all the important data structures, namely, linked lists, stacks, queues, trees, and graphs. A highly detailed pedagogy entailing plenty of examples, figures, programming tips, keywords, and end-chapter exercises makes this a must-have book for all engineering students.

Table of Contents:
1. INTRODUCTION TO COMPUTERS ; 1.1 WHAT IS A COMPUTER? ; 1.2 CHARACTERISTICS OF COMPUTERS ; 1.3 GENERATION OF COMPUTERS ; 1.3.1 FIRST GENERATION ; 1.3.2 SECOND GENERATION ; 1.3.3 GENERATION ; 1.3.4 GENERATION ; 1.3.5 GENERATION ; 1.4 CLASSIFICATION OF COMPUTERS ; 1.5 APPLICATIONS OF COMPUTER ; 1.6 BASIC COMPUTER ORGANIZATION ; 1.7 LAB SESSION - INSIDE A COMPUTER ; 1.8 THE MOTHERBOARD ; 2. NUMBER REPRESENTATION IN COMPUTERS ; 2.1 BINARY NUMBER SYSTEM ; 2.2 WORKING WITH BINARY NUMBERS ; 2.2.1 CONVERT A BINARY NUMBER INTO DECIMAL ; 2.2.2 CONVERT A DECIMAL NUMBER INTO BINARY ; 2.2.3 ADDING TWO BINARY NUMBERS ; 2.2.4 SUBTRACTING TWO BINARY NUMBERS ; 2.2.5 SUBTRACTING TWO BINARY NUMBERS USING TWO'S COMPLEMENT ; 2.2.6 MULTIPLICATION OF TWO BINARY NUMBERS ; 2.2.7 DIVISION OF BINARY NUMBERS ; 2.3 OCTAL NUMBER SYSTEM ; 2.3.1 CONVERT AN OCTAL NUMBER INTO DECIMAL ; 2.3.2 CONVERT A DECIMAL NUMBER INTO OCTAL ; HEXADECIMAL NUMBER SYSTEM ; 2.4 CONVERT A HEXADECIMAL NUMBER INTO BINARY ; 2.4.1 CONVERT A HEXADECIMAL NUMBER INTO BINARY ; 2.4.2 CONVERT A HEXADECIMAL NUMBER INTO DECIMAL ; 2.4.3 CONVERT A DECIMAL NUMBER INTO HEXADECIMAL ; 2.5 WORKING WITH FRACTIONS ; 2.6 SIGNED NUMBER REPRESENTATION IN BINARY ; 2.6.1 SIGN-AND-MAGNITUDE ; 2.6.2 ONE'S COMPLEMENT ; 2.6.3 TWO'S COMPLEMENT ; 2.7 BCD CODE ; 2.8 OTHER CODES ; 2.8.1 ASCII CODES ; 2.8.2 EBCDIC CODES ; 2.8.3 EXCESS 3 CODE ; 2.8.4 OTHER WEIGHTED CODES ; 2.8.5 GRAY CODE ; 2.9 LOGIC GATES ; 2.10 UNIVERSAL GATES ; 3. INPUT/ OUTPUT DEVICES ; 3.1 INPUT DEVICES ; 3.1.1 KEYBOARD ; 3.1.2 POINTING DEVICES ; 3.1.2.1 MOUSE ; 3.1.2.2 TRACKBALL ; 3.1.2.3 TOUCH PAD ; 3.1.3 HANDHELD DEVICES ; 3.1.3.1 JOYSTICK ; 3.1.3.2 STYLUS ; 3.1.3.3 TOUCH SCREEN ; 3.1.4 OPTICAL DEVICES ; 3.1.4.1 BAR CODE READER ; 3.1.4.2 IMAGE SCANNER ; 3.1.4.3 OPTICAL CHARACTER RECOGNITION ; 3.1.4.4 OPTICAL MARK RECOGNITION ; 3.1.4.5 MAGNETIC INK CHARACTER READER ; 3.1.5 AUDIO VISUAL DEVICES ; 3.1.5.1 AUDIO INPUT DEVICES ; 3.1.5.2 VIDEO INPUT DEVICES ; 3.2 OUTPUT DEVICES ; 3.2.1 SOFT COPY OUTPUT DEVICES ; 3.2.1.1 MONITOR ; 3.2.1.1.1 CRT MONITOR ; 3.2.1.1.2 LCD MONITOR ; 3.2.1.1.3 PLASMA MONITOR ; 3.2.1.2 PROJECTOR ; 3.2.1.3 SPEAKER ; 3.2.2 HARD COPY OUTPUT DEVICES ; 3.2.2.1 DOT MATRIX ; 3.2.2.2 DAISY WHEEL ; 3.2.2.3 LINE PRINTER ; 3.2.2.4 INKJET MATRIX ; 3.2.2.5 LASER MATRIX ; 3.2.2.6 PLOTTERS ; 4. COMPUTER'S MEMORY ; 4.1 INTRODUCTION ; 4.2 MEMORY HIERARCHY ; 4.3 PROCESSOR REGISTERS ; 4.4 CACHE MEMORY ; 4.5 PRIMARY MEMORY ; 4.5.1 RAM ; 4.5.2 ROM ; 4.5.3 HOW DOES CPU FINDS THE REQUIRED DATA FROM THE MAIN MEMORY? ; 4.6 SECONDARY STORAGE DEVICES ; 4.6.1 OFFLINE STORAGE ; 4.6 HARD DISK ; 4.7 OPTICAL DRIVE ; 4.7.1 CDROM ; 4.7.2 DVD ROM ; 4.7.3 CD-R ; 4.7.4 CD-RW ; 4.8 USB FLASH DRIVE ; 4.9 FLOPPY DISK ; 4.10 MAGNETIC TAPE ; 4.11 MEMORY CARDS ; 5. COMPUTER SOFTWARE ; 5.1 INTRODUCTION TO COMPUTER SOFTWARE ; 5.2 CLASSIFICATION OF COMPUTER SOFTWARE ; 5.2.1 SYSTEM SOFTWARE ; 5.2.1.1 COMPUTER BIOS AND DEVICE DRIVERS ; 5.2.1.2 OPERATING SYSTEM ; 5.2.1.3 UTILITY SOFTWARE ; 5.2.1.4 COMPILER, INTERPRETER, LINKER, LOADER ; 5.2.2 APPLICATION SOFTWARE ; 5.3 SOME POPULAR APPLICATIONS SOFTWARE ; 5.3.1 PRODUCTIVITY SOFTWARE ; 5.3.2 INTRODUCTION TO OFFICE PACKAGE ; 5.3.3 GRAPHICS SOFTWARE ; 5.3.4 MULTIMEDIA SOFTWARE ; 5.4 OPERATING SYSTEM ; 5.4.1 WINDOWS OPERATING SYSTEM ; 5.4.2 UNIX ; 5.4.3 LINUX ; 6. THE INTERNET ; 6.1 INTRODUCTION TO COMPUTER NETWORKS ; 6.1.1 ADVANTAGES OF COMPUTER NETWORKS ; 6.2 THE CONNECTING MEDIA ; 6.3 DATA TRANSMISSION MODE ; 6.3.1 SIMPLEX, HALF DUPLEX AND FULL DUPLEX CONNECTIONS ; 6.3.2 SERIAL AND PARALLEL TRANSMISSION ; 6.3.3 SYNCHRONOUS AND ASYNCHRONOUS TRANSMISSION MODE ; 6.4 NETWORK TOPOLOGIES ; 6.4.1 BUS TOPOLOGY ; 6.4.2 STAR TOPOLOGY ; 6.4.3 RING TOPOLOGY ; 6.4.4 MESH TOPOLOGY ; 6.4.5 HYBRID TOPOLOGY ; 6.5 TYPES OF NETWORK ; 6.5.1 LAN ; 6.5.2 WAN ; 6.5.3 MAN ; 6.5.4 CAN ; 6.5.5 PAN ; 6.6 NETWORKING DEVICES ; 6.6.1 HUB ; 6.6.2 REPEATERS ; 6.6.3 SWITCH ; 6.6.4 BRIDGES ; 6.6.5 ROUTER ; 6.6.6 GATEWAY ; 6.6.7 NIC CARD ; 6.7 THE INTERNET ; 6.7.1 HISTORY ; 6.8 INTERNET SERVICES ; 6.8.1 ELECTRONIC MAIL ; 6.8.2 FILE TRANSFER PROTOCOL ; 6.8.3 CHATTING ; 6.8.4 INTERNET CONFERENCING ; 6.8.5 ELECTRONIC NEWSPAPER ; 6.8.6 WORLD WIDE WEB ; 6.8.7 ONLINE SHOPPING ; 6.8.8 INTERNET GLOSSARY ; 7. INTRODUCTION TO ALGORITHMS AND PROGRAMMING LANGUAGES ; 7.1 CONCEPT OF ALGORITHMS ; 7.2 KEY FEATURES OF AN ALGORITHM ; 7.3 SOME MORE ALGORITHMS ; 7.4 FLOWCHARTS ; 7.4.1 SIGNIFICANCE OF FLOWCHART ; 7.4.2 ADVANTAGES OF FLOWCHART ; 7.4.3 LIMITATIONS OF FLOWCHART ; 7.5 PSEUDOCODE ; 7.6 PROGRAMMING LANGUAGES ; 7.7 GENERATION OF PROGRAMMING LANGUAGES ; 7.7.1 FIRST GENERATION ; 7.7.2 SECOND GENERATION ; 7.7.3 THIRD GENERATION ; 7.7.4 FOURTH GENERATION ; 7.7.5 FIFTH GENERATION ; 7.8 STRUCTURED PROGRAMMING LANGUAGE ; 7.8.1 ADVANTAGES ; 7.8.2 EXAMPLE ; 7.9 INTRODUCTION TO THE DESIGN AND IMPLEMENTATION OF CORRECT, EFFICIENT AND MAINTENANCE PROGRAMS ; 8. INTRODUCTION TO C (76) ; 8.1 INTRODUCTION ; 8.1.1 BACKGROUND ; 8.1.2 CHARACTERISTICS OF C ; 8.1.3 USES ; 8.2 STRUCTURE OF A C PROGRAM ; 8.3 WRITING THE FIRST C PROGRAM ; 8.4 FILES USED IN A C PROGRAM ; 8.4.1 SOURCE CODE FILE ; 8.4.2 HEADER FILES ; 8.4.3 OBJECT FILE ; 8.4.4 BINARY EXECUTABLE FILE ; 8.5 COMPILING AND EXECUTING C PROGRAM ; 8.6 USING COMMENTS IN A C PROGRAM ; 8.7 KEYWORDS ; 8.8 IDENTIFIERS ; 8.9 BASIC DATA TYPES IN C ; 8.9.1 HOW ARE FLOATS AND DOUBLES STORED? ; 8.10 VARIABLES ; 8.10.1 DECLARING VARIABLES ; 8.10.2 INITIALIZING VARIABLES ; 8.11 CONSTANTS ; 8.11.1 INTEGER CONSTANT ; 8.11.2 FLOATING POINT CONSTANT ; 8.11.3 CHARACTER CONSTANT ; 8.11.4 STRING CONSTANT ; 8.11.5 DECLARING CONSTANT ; 8.12 INPUT/OUTPUT STATEMENTS IN C ; 8.12.1 STREAMS IN C ; 8.12.2 FORMATTING INPUT/OUTPUT ; 8.12.3 PRINTF() ; 8.12.4 SCANF() ; 8.12.5 PRINTF() AND SCANF() EXAMPLES ; 8.12.6 DETECTING ERRORS WHILE DATA INPUT ; 8.13 OPERATORS IN C ; 8.13.1 ARITHMETIC OPERATORS ; 8.13.2 RELATIONAL OPERATORS ; 8.13.3 EQUALITY OPERATORS ; 8.13.4 LOGICAL OPERATORS ; 8.13.4.1 LOGICAL AND ; 8.13.4.2 LOGICAL OR ; 8.13.4.3 LOGICAL NOT ; 8.13.5 UNARY OPERATORS ; 8.13.5.1 UNARY MINUS ; 8.13.5.2 INCREMENT OPERATOR (++) AND DECREMENT OPERATOR (-) ; 8.13.6 CONDITIONAL OPERATORS ; 8.13.7 BITWISE OPERATORS ; 8.13.7.1 BITWISE AND ; 8.13.7.2 BITWISE OR ; 8.13.7.3 BITWISE XOR ; 8.13.7.4 BITWISE NOT ; 8.13.7.5 SHIFT OPERATOR ; 8.13.8 ASSIGNMENT OPERATORS ; 8.13.9 COMMA OPERATOR ; 8.13.10 SIZEOF OPERATOR ; 8.13.11 OPERATOR PRECEDENCE ; 8.14 TYPE CONVERSION AND TYPE CASTING ; 8.14.1 TYPE CONVERSION ; 8.14.2 TYPE CASTING ; PROGRAMMING TIPS ; KEYWORDS ; 9. DECISION CONTROL AND LOOPING STATEMENTS (73) ; 9.1 INTRODUCTION TO DECISION CONTROL STATEMENTS ; 9.2 CONDITIONAL BRANCHING STATEMENT ; 9.2.1 IF STATEMENT ; 9.2.2 IF-ELSE STATEMENT ; 9.2.3 IF-ELSE-IF STATEMENT ; 9.2.4 SWITCH CASE STATEMENT ; 9.3 ITERATIVE STATEMENTS ; 9.3.1 WHILE LOOP ; 9.3.2 DO- WHILE LOOP ; 9.3.3 FOR LOOP ; 9.4 NESTED LOOPS ; 9.5 C BREAK AND CONTINUE STATEMENT ; 9.6 GO TO STATEMENT ; PROGRAMMING TIPS ; KEYWORDS ; CASE STUDY FOR CHAPTERS 8 AND 9 ; 10. FUNCTIONS (53) ; 10.1 INTRODUCTION ; 10.1.1 WHY ARE FUNCTIONS NEEDED? ; 10.2 USING FUNCTIONS ; 10.3 FUNCTION DECLARATION ; 10.4 FUNCTION DEFINITION ; 10.5 FUNCTION CALL ; 10.6 RETURN STATEMENT ; 10.7 PASSING PARAMETERS TO FUNCTION ; 10.7.1 CALL BY VALUE ; 10.7.2 CALL BY REFERENCE ; 10.8 VARIABLE SCOPE ; 10.8.1 BLOCK SCOPE ; 10.8.2 FUNCTION SCOPE ; 10.8.3 PROGRAM SCOPE ; 10.8.4 FILE SCOPE ; 10. 9 STORAGE CLASSES ; 10.9.1 AUTO ; 10.9.2 REGISTER ; 10.9.3 EXTERN ; 10.9.4 STATIC ; 10.9.5 COMPARISON OF STORAGE CLASSES ; 10.10 RECURSIVE FUNCTIONS ; 10.10.1 REVERSE THE CHARACTERS ; 10.10.2 GREATEST COMMON DIVISOR ; 10.10.3 FINDING EXPONENTS ; 10.10.4 FIBONACCI SERIES ; 10.11 TYPES OF RECURSION ; 10.12 TOWER OF HANOI PROBLEM ; 10.13 RECURSION VS ITERATION ; PROGRAMMING TIPS ; KEYWORDS ; ANNEXURE 1: USER-DEFINED HEADER FILES ; 11. ARRAYS (74) ; 11.1 INTRODUCTION ; 11.2 DECLARATION OF ARRAYS ; 11.3 ACCESSING ALL THE ELEMENTS OF ARRAY ; 11.3.1 CALCULATING THE ADDRESS OF ARRAY ELEMENTS ; 11.4 STORING VALUES IN ARRAYS ; 11.4.1 INITIALIZATION OF ARRAYS ; 11.4.2 INPUTTING VALUES ; 11.4.3 ASSIGNING VALUES ; 11.5 CALCULATING THE LENGTH OF ARRAYS ; 11.6 OPERATIONS THAT CAN BE PERFORMED ON ARRAYS ; 11.6.1 TRAVERSAL ; 11.6.2 INSERTION ; 11.6.3 DELETION ; 11.6.4 MERGING THE ARRAYS ; 11.6.5 SEARCHING THE ARRAY ELEMENTS ; 11.6.5.1 LINEAR SEARCH ; 11.6.5.2 BINARY SEARCH ; 11.7 ONE DIMENSIONAL ARRAY FOR INTER-FUNCTION COMMUNICATION ; 11.8 TWO DIMENSIONAL ARRAYS ; 11.8.1 DECLARATION OF TWO DIMENSIONAL ARRAYS ; 11.8.2 INITIALIZATION OF TWO DIMENSIONAL ARRAYS ; 11.8.3 ACCESSING THE ELEMENTS ; 11.9 OPERATION ON TWO DIMENSIONAL ARRAYS ; 11.10 TWO DIMENSIONAL ARRAYS FOR INTER-FUNCTION COMMUNICATION ; 11.11 MULTI DIMENSIONAL ARRAYS ; 11.12 SPARSE MATRICES ; ANNEXURE 2: SORTING ; CASE STUDY FOR CHAPTERS 10 AND 11 ; 12. STRINGS (77) ; 12.1 INTRODUCTION ; 12.1.1 READING STRINGS ; 12.1.2 WRITING STRINGS ; 12.1.3 SUMMARY OF FUNCTIONS USED TO READ AND WRITE CHARACTERS ; 12.2 SUPPRESSING INPUTS ; 12.3 STRING TAXONOMY ; 12.4 STRING OPERATIONS ; 12.4.1 LENGTH ; 12.4.2 CONVERTING INTO UPPER CASE ; 12.4.3 CONVERTING INTO LOWER CASE ; 12.4.4 CONCATENATION ; 12.4.5 APPENDING ; 12.4.6 COMPARISON ; 12.4.7 REVERSE ; 12.4.8 EXTRACTING A SUBSTRING FROM LEFT OF A STRING ; 12.4.9 EXTRACTING A SUBSTRING FROM RIGHT OF A STRING ; 12.4.10 EXTRACTING A SUBSTRING FROM MIDDLE OF A STRING ; 12.4.11 INSERTION ; 12.4.12 INDEXING ; 12.4.13 DELETION ; 12.4.14 REPLACEMENT ; 12.5 MISCELLANEOUS STRING AND CHARACTER FUNCTIONS ; 12.6 ARRAY OF STRINGS ; 13. POINTERS (74) ; 13.1 UNDERSTANDING THE COMPUTER'S MEMORY ; 13.2 INTRODUCTION TO POINTERS ; 13.3 DECLARING POINTER VARIABLES ; 13.4 POINTER EXPRESSIONS AND POINTER ARITHMETIC ; 13.5 NULL POINTERS ; 13.6GENERIC POINTERS ; 13.7 PASSING ARGUMENTS TO FUNCTIONS USING POINTERS ; 13.8 POINTERS AND ARRAYS ; 13.9 PASSING ARRAY TO A FUNCTION7.9 DIFFERENCE BETWEEN ARRAY NAME AND POINTER ; 13.10POINTERS AND STRINGS ; 13.11 ARRAY OF POINTERS ; 13.12POINTERS AND TWO DIMENSIONAL ARRAYS ; 13.13 ARRAY OF FUNCTION POINTERS ; 13.14 POINTERS AND TWO DIMENSIONAL ARRAYS ; 13.15 POINTERS AND THREE DIMENSIONAL ARRAYS ; 13.16 POINTER TO FUNCTION ; 13.16.1 INITIALIZING FUNCTION POINTER ; 13.16.2 CALLING A FUNCTION USING A FUNCTION POINTER ; 13.16.3 COMPARING FUNCTION POINTERS ; 13.16.4 PASSING A FUNCTION POINTER AS AN ARGUMENT TO A FUNCTION ; 13.17 ARRAY OF FUNCTION POINTERS ; 13.18 POINTER TO POINTERS ; 13.19 MEMORY ALLOCATION IN C PROGRAMS ; 13.20 MEMORY USAGE ; 13.21 DYNAMIC MEMORY MANAGEMENT ; 13.21.1 MEMORY ALLOCATION PROCESS ; 13.21.2 ALLOCATING A BLOCK OF MEMORY ; 13.21.3 RELEASING THE USED SPACE ; 13.21.4 ALTERING THE SIZE OF ALLOCATED MEMORY ; 13.22 DRAWBACK OF POINTERS ; ANNEXURE 3: POINTERS ; CASE STUDY FOR CHAPTERS 12 AND 13 ; 14. STRUCTURE AND UNION (49) ; 14.1 INTRODUCTION ; 14.1.1 STRUCTURE DECLARATION ; 14.1.2 TYPEDEF DECLARATION ; 14.1.3 INITIALIZATION OF STRUCTURES ; 14.1.4 ACCESSING MEMBERS OF STRUCTURES ; 14.1.5 COPYING AND COMPARING STRUCTURES ; 14.2 NESTED STRUCTURES ; 14.3 ARRAY OF STRUCTURES ; 14.4 STRUCTURES AND FUNCTIONS ; 14.4.1 PASSING INDIVIDUAL MEMBERS ; 14.4.2 PASSING THE ENTIRE STRUCTURE ; 14.4.3 PASSING STRUCTURES THROUGH POINTERS ; 14.5 SELF REFERENTIAL STRUCTURES ; 14.6 UNION ; 14.6.1 DECLARING A UNION ; 14.6.2 ACCESSING A MEMBER OF A UNION ; 14.6.3 INITIALIZING UNION ; 14.7 ARRAY OF UNION VARIABLES ; 14.8 UNIONS INSIDE STRUCTURES ; 14.9 ENUMERATED DATA TYPES ; 14.9.1 ENUM VARIABLES ; 14.9.2 USING THE TYPEDEF KEYWORD ; 14.9.3 ASSIGNING VALUES TO ENUM VARIABLES ; 14.9.4 ENUMERATION TYPE CONVERSION ; 14.9.5 COMPARING ENUMERATED TYPES ; 14.9.6 INPUT/OUTPUT OPERATIONS ON ENUMERATED TYPES ; ANNEXURE 4: BIT & BYTE ; 15. FILE MANAGEMENT (59) ; 15.1 INTRODUCTION ; 15.1.1 STREAMS IN C ; 15.1.2 BUFFERS ASSOCIATED WITH FILE STREAMS ; 15.1.3 TYPES OF FILES ; 15.1.3.1 ASCII TEXT FILES ; 15.1.3.2 BINARY FILES ; 15.2 USING FILES IN C ; 15.2.1 DECLARING A FILE POINTER ; 15.2.2 OPENING A FILE ; 15.2.2.1 THE FILE NAME ; 15.2.2.2 FILE MODE ; 15.2.3 CLOSING A FILE ; 15.3 READING DATA FROM FILES ; 15.3.1 FSCANF() ; 15.3.2 FGETS() ; 15.3.3 FGETC() ; 15.3.4 FREAD() ; 15.4 WRITING DATA TO FILES ; 15.4.1 FPRINTF() ; 15.4.2 FPUTS() ; 15.4.3 FPUTC() ; 15.4.4 FWRITE() ; 15.5 DETECTING THE END OF FILE ; 15.6 ERROR HANDLING DURING FILE OPERATIONS ; 15.6.1 FCLEARERR() ; 15.6.2 PERROR() ; 15.7 ACCEPTING COMMAND LINE ARGUMENTS ; 15.8 FUNCTION FOR SELECTING A RECORD RANDOMLY ; 15.8.1 FSEEK() ; 15.8.2 FTELL() ; 15.8.3 REWIND() ; 15.8.4 FGETPOS() ; 15.8.5 FSETPOS() ; 15.9 THE REMOVE() FUNCTION ; 15.10 RENAMING A FILE ; 15.11 CREATING A TEMPORARY FILE ; 16. THE PREPROCESSOR DIRECTIVE (27) ; 16.1 INTRODUCTION ; 16.2 TYPES OF PREPROCESSOR DIRECTIVES ; 16.3 #DEFINE ; 16.3.1 OBJECT-LIKE MACROS ; 16.3.2 FUNCTION-LIKE MACROS ; 16.3.2.1 INVOKING A FUNCTION-LIKE MACRO ; 16.3.3 NESTING OF MACROS ; 16.3.4 RULES FOR USING MACROS ; 16.3.5 OPERATORS RELATED TO MACROS ; 16.3.5.1 OPERATOR TO CONVERT TO STRING LITERAL ; 16.3.5.2 MERGE OPERATOR ; 16.4 #INCLUDE ; 16.5 #UNDEF ; 16.6 #LINE ; 16.7 PRAGMA DIRECTIVES ; 16.8 CONDITIONAL DIRECTIVES ; 16.8.1 #IFDEF ; 16.8.2 #IFNDEF ; 16.8.3 #IF ; 16.8.4 #ELSE ; 16.8.5 #ELIF ; 16.8.6 #ENDIF ; 16.9 THE DEFINED OPERATOR ; 16.10 #ERROR ; 16.11 PRE-DEFINED MACROS ; 17. INTRODUCTION TO DATA STRUCTURES ; 17.1 INTRODUCTION TO DATA STRUCTURES ; 17.2 LINEAR AND NON-LINEAR DATA STRUCTURES ; 17.2.1 LINKED LIST ; 17.2.1.1 LINKED LIST VERSUS ARRAYS ; 17.2.1.2 TRAVERSING A SINGLY LINKED LIST ; 17.2.1.3 SEARCHING A LINKED LIST ; 17.2.1.4 INSERTING A NEW NODE IN A LINKED LIST ; 17.2.1.5 DELETING A NODE FROM A LINKED LIST ; 17.2.2 STACKS ; 17.2.2.1 ARRAY REPRESENTATION OF STACK ; 17.2.2.2 OPERATIONS ON STACKS ; 17.2.3 QUEUES ; 17.2.3.1 OPERATIONS ON A QUEUE ; 17.2.4 TREES ; 17.2.4.1 KEY TERMS ; 17.2.4.2 REPRESENTATION OF BINARY TREES IN MEMORY ; 17.2.4.3 TRAVERSING A BINARY TREE ; 17.2.5 GRAPHS ; 17.2.5.1 WHY GRAPHS ARE USEFUL ; 17.2.5.2 DEFINITION ; 17.2.5.3 GRAPH TERMINOLOGY ; 17.2.5.4 REPRESENTATION OF GRAPHS ; CASE STUDY FOR CHAPTER 176R ; APPENDICES ; APPENDIX IA ASCII CHART ; APPENDIX IB BITWISE OPERATIONS ; APPENDIX II- ANSI C LIBRARY FUNCTIONS ; APPENDIX IIIA- ADVANCED TYPE QUALIFIERS LIKE VOLATILE AND RESTRICT ; IIIB- INLINE FUNCTIONS IN C ; APPENDIX IV - VERSIONS OF C ; APPENDIX V- ALGORITHMS AND CALCULATING PROGRAM EFFICIENCY ; APPENDIX VI- INTERVIEW QUESTIONS WITH SOLUTIONS ; APPENDIX VII- MODEL TEST PAPERS