Computer Science Study Materials

CSC 201: WORD PROCESSING NOTE

Editing Text Features of Word Processing Documents Objectives of Word Processing Word Processing Packages Electronic Spreadsheet (Microsoft Excel) Spreadsheet Packages Computer Network Applications/Purpose of Computer Network Components of Computer Network Network Benefits Disadvantages of Networks Classification of Area by their Geography Peer to Peer Network Advantages & Disadvantages of Peer to Peer Network Internet

BCA 322 DBMS

FILE ORGANIZATION ·         Introduction ·         Storage Devices Characteristics ·         File Organization ·         Sequential Files ·         Indexing and Methods of Indexing ·         Hash Files INTRODUCTION TO DATABASE SYSTEMS ·         What is Data, Database System, DBMS? ·         Single and Multi-User Systems ·         Advantages and Drawbacks of DBMS ·         Architecture of DBMS ·   �...

Note on Systems Concept and Environment

SYSTEM CONCEPTS AND ENVIRONMENT Characteristics of the System Elements of System Information System Environment Types of System MIS: Management Information System Introduction to Structured Methodologies SOFTWARE DEVELOPMENT LIFE CYCLE Figure SDLC System Analysis System Design System Design Chart ROLE OF SYSTEM ANALYST Multifunctional Role Figure Illustrating Multifunctional Role Multifunctional Role of System Analyst Skill Set Required by an Analyst Graphs for Skill Set MIS Organization SOFT...

CSC 335 Note on Java

Introduction to Computers the Internet and Java Introduction to Java Applications; Input/Output and Operators Introduction to Classes, Objects, Methods, and Strings Control Statements: Part 1; Assignment, ++ and -- Operators Control Statements: Part 2; Logical Operators Methods: A Deeper Look Arrays and ArrayLists Classes and Objects: A Deeper Look Object Oriented Programming: Inheritance Object Oriented Programming: Polymorphism and Interfaces Exception Handling: A Deeper Look GUI Components...

CSC 335 Notes 2 Chapter 7: What is a Compiler Design? Types, Construction Tools, Example

What is a Compiler? Features of Compilers Types of Compiler Tasks of Compiler History of Compiler Steps for Language processing systems Compiler Construction Tools Why use a Compiler? Types of Parsers in Compiler Design Parse Tree | Derivations | Automata Properties Of Parse Tree Yield Of Parse Tree- PRACTICE PROBLEMS BASED ON DERIVATIONS AND PARSE TREE

CSC 335 Notes 2 Chapter 6: Pushdown Automata (PDA)

PDA - the automata for CFLs δ : The Transition Function PDA for Lwwr PDA as a state diagram PDA for Lwwr: Transition Diagram PDA’s Instantaneous Description (ID) Principles about IDs PDA for Lwwr: Proof of correctness PF==> PN construction Equivalence of PDAs and Equivalence of PDAs and CFGs CFGs == PDAs ==> CFLs Converting CFG to PDA Converting a CFG into a PDA Formal construction of PDA from CFG Simulating g strin 0011 on the new PDA Proof of correctness for CFG ==> PDA Proof of corre...

CSC 335 Notes 2 Chapter 4: Context-Free Languages & Grammars (CFLs & CFGs)

Context-Free Languages Applications of CFLs & CFGs Structure of a production CFG conventions Syntactic Expressions in Programming Languages String membership Generalization of derivation Left-most & Right-most Derivation Styles How to prove that your CFGs How to prove that your CFGs are correct Parse Trees, Derivations, and Recursive Inferences Interchangeability of different CFG representations The connection between CFLs Connection between CFLs and RLs CFLs & Regular Languages Ambiguity in ...

CSC 335 Notes 2 Chapter 3 (Regular Expressions)

Regular Expressions vs Finite Regular Expressions vs. Finite Automata Language Operators Building Regular Expressions Precedence of Operators Finite Automata (FA) & Regular Finite Automata (FA) & Regular Expressions (Reg Ex) DFA to RE construction RE to NFA construction Algebraic Laws of Regular Expressions

CSC 335 Note 1(INTRODUCTION TO FORMAL LANGUAGES AND AUTOMATA THEORY)

BASICS OF AUTOMATA THEORY Theory of Automata Types of Automata Some important points about DFA and NFA Transition Diagram Transition Table

CSC 113: Computer For Arts, Social Science And Management Science

Section A: Introduction to Computer Science Meaning and History of Computer Science Generations of Computer Science Practical Introduction to using personal computer hardware and software. Section B: Computer Hardware and Software Computer Hardware: functional components, modern input, and output units Computer Software: Operating systems, application packages Section C: Program Development: Algorithm, Pseudocode, and Flowchart Explain the meaning of the program Mention and use programming de...

CSS 101- General Introduction to Computer Science

The computer can be defined as a powerful electronic device which has the capability of accepting data as an input, processing the data and applying some arithmetic and logical operation to it, store the result of the data if the need be and finally display the result or output as an information at a very fast speed. 

Distributed Revision Resources (Exam Questions 2019)

Distributed Revision Questions 2019 Preview1.Distinguish between the link-register model, and the message-passing model in which each channel has unit capacity. Then implement the link-register model using the message passing model. 2. A keyboard process K sends an arbitrarily large stream of key-codes to a process P, which is supposed to store them in the memory. In addition to receiving the inputs from K, P also executes an infinite computation G. The channel (K, P) has a finite...

FORTRAN Programming Language Questions and answers

Exercise1: Define the term FORTRANFORTRAN (FormulaTranslation) is a third-generation ( 3GL ) programming language that  was designed  for use  by engineers,  mathematicians, and  otherusers and creators of scientific algorithms.


31 - 44 Of 44 Results