
MDU Mathematical Foundation of Computer Science  Sem I Unit 4 : Lattices and Boolean Algebra(Introduction to defining language, Kleene Closure, Arithmetic expressions, Chomsky Hierarchy, Regular Expressions, Generalized Transition graph) 


1. Unit01(Compiler Design) 
Total View (20) 

Introduction, Lexical analysis: Language processors; The structure of a Compiler; The evolution of programming languages; The science of building a Compiler; Applications of compiler technology; Programming language basics. Lexical analysis: The Role of Lexical Analyzer; Input Buffering; Specifications of Tokens; Recognition of Tokens
Title: COMPILER DESIGN/10CS63




2. Introduction to Finite Automata(Formal Languages and Automata Theory
) 
Total View (99) 

This chapter contains topics such as: Central concepts of Automata theory, Deterministic Finite Automata, Nondeterministic Finite Automata with numerous examples
Title: Finite Automata and Formal Languages




3. Lattices(Mathematics) 
Total View (741) 

In this section we learn more advanced feature on the relation like partial ordered sets and Lattices. These structures are useful in set theory, algebra, sorting and searching.
Title: Math 1.4 Discrete Mathematics




4. Additional TopicsA Bird's Eye View(Formal Languages & Automata Theory) 
Total View (359) 

Equivalence between Turing Machines and Type0 languages: For every TM M, we can construct an equivalent grammar G and viceversa. Equivalence between Context Sensitive Languages and Linear Bounded Automata: Linear Bounded Automata is a nondeterministic TM which does not use any tape space beyond input limits. For every CSG G, there is an equivalent LBAM and viceversa. A brief outline of space co
......
Title: Formal Languages & Automata Theory




5. Data Mining Query Language(Computer Science) 
Total View (726) 

The feature of the data mining systems is the ability to support adhoc and interactive data mining in order to facilitate flexible and effective knowledge discovery. Data mining query languages can be designed to support such a feature. The importance of the design of a good data
mining query language can also be seen from observing the history of relational database systems. Relational database
......
Title: MSCS516A Data Mining




6. Regular Expressions and Regular Languages(Formal Languages & Automata Theory) 
Total View (318) 

A regular expression is another medium for concise and precise specification of languages. Regular expressions were studied extensively by S.C. Kleene. It turns out that regular expressions specify the same class of languages which can be recognized by FA. This equivalence has made regular expression a convenient input language in lexical analyzer generators (LEX) and many text formatting packages
......
Title: Formal Languages & Automata Theory




7. Unit02(Computer Science) 
Total View (17) 

Introduction to Java: Java's magic: the Byte code; Java Development Kit (JDK); the Java Buzz words, Objectoriented programming; Simple Java programs. Data types, variables and arrays, Operators, Control Statements
Title: Object Oriented Programming with Java/ 15CS45




8. Design Methodologies(VLSI Design
) 
Total View (740) 

Design Strategies, Introduction, Structured Design Strategies, Design Hierarchy, Concepts of Regularity, Modularity and Locality, Design Methods, Design Synthesis, Behavioral Synthesis, RTL Synthesis, Logic optimization, StructuraltoLayout Synthesis, Layout Synthesis, Design capture Tools, HDL Design, Schematic Design, Layout Design, Floor Planning, Chip Composition, Design Verification Tools,
......
Title: Introduction to VLSI Design




9. Matrices of Relation, Transitive Closure and Warshall's Algorithm(Mathematics) 
Total View (740) 

Through this unit we discuss about matrix digraphs relation along with transitive closure. Also of interest in how the relation matrix is used in the study of Graph theory.
Title: Math 1.4 Discrete Mathematics




10. Properties of Regular Languages(Formal Languages & Automata Theory) 
Total View (317) 

In this chapter, we discuss various properties of languages recognized by Finite Automata. We try to answer many questions that can be asked about the regular languages. Is a given regular language empty? finite? infinite? What are the limitations of regular languages? Also, we discuss the closure properties of regular languages under various operations.
Title: Formal Languages & Automata Theory






12. Fundamentals of Computer Design(Advanced Computer Architecture) 
Total View (187) 

Introduction, Classes of computer, Defining computer architecture, Trends in Technology, power in Integrated Circuits and cost, Dependability, Measuring, reporting and summarizing Performance, Quantitative Principles of computer design.
Title: Advanced Computer Architecture




13. Introduction(Formal Languages & Automata Theory) 
Total View (225) 

Ever since the advent of civilisation, man has shown interest in creating machines to replace/ease human labour. Hence, it is not surprising that he felt the need for a machine that would do laborious computation for him. In 16th century, Pascal invented a rudimentary computing device. In 19th century, Charles Babbage actually built a machine called analytical engine which had the essential charac
......
Title: Formal Languages & Automata Theory




14. Graphs(Applied Mathematics) 
Total View (622) 

Graph theory is one of the most developing branches of mathematics with wide applications to computer science. Graph theory is applied in diverse areas such as social sciences, linguistics, physical sciences, communication engineering and others. Graph theory also plays an important role in several areas of computer science, such as switching theory and logic design, artificial intelligence, forma
......
Title: Discrete Structures and Graph Theory




15. Data Mining Parameters(Computer Science) 
Total View (726) 

A popular misconception about data mining is to expect that data mining systems can autonomously dig out all of the valuable knowledge that is embedded in a given large database,without human intervention or guidance. Although it may at first sound appealing to have an autonomous data mining system, in practice, such systems will uncover an overwhelmingly large set of patterns.
A datamining task
......
Title: MSCS516A Data Mining





17. Lexical Analysis(System Software & Compiler Design) 
Total View (1) 

A preprocessor produce input to compilers. They may perform the following functions.
1. Macro processing: A preprocessor may allow a user to define macros that are short hands for
longer constructs.
2. File inclusion: A preprocessor may include header files into the program text.
3. Rational preprocessor: these preprocessors augment older languages with more modern flowofcontrol
and data stru
......
Title: System Software & Compiler Design





19. Properties of Context Free Languages(Formal Languages & Automata Theory) 
Total View (358) 

In this chapter, we discuss various properties of context free languages such as limitations and closure under different operations.
Title: Formal Languages & Automata Theory




20. Graph as a Data Structure, Graph Representation Based on Sequential Allocation and Linked Allocation(Computer Science) 
Total View (798) 

Graph is an important mathematical representation of a physical problem, for example finding optimum shortest path from a city to another city for a traveling sales man, so as to minimize the cost.
Title: MSCS504 Data Structure




21. Multiplication of Positive Numbers(Computer Science) 
Total View (199) 

In this unit, a detail explanation of Multiplication of Positive numbers and Signed  Operand Multiplication is given and also about the Booth Algorithm, a technique that works equally well for both negative and positive multipliers. Evaluated Fast Multiplication and also Bit Pair Recoding of Multipliers and Sketched out CarrySave Addition of Summands.
Title: MSCS 503 Computer Architecture




22. Introduction to Programming(Computer Fundamentals) 
Total View (56) 

Problem Solving Stages, Case Studies, Elements of BASIC Programming, Basic Character set, Constants, Variables, Operators and Expressions, Structure of a Basic Program, Basic Statements, Input/Output Statements, Other Basic Statements, Branching Statements, Looping Statements, Fun with Basic, Writing and Saving the First BASIC Program
Title: Computer Fundamentals




23. Logic Operations(Computer Science) 
Total View (200) 

In this Unit, we have explained how to perform Arithmetic Operations on FloatingPoint Numbers and their implementations In this topic, we _outline the general procedures for addition, subtraction, multiplication, and division of floatingpoint numbers. The rules we give apply to the singleprecision IEEE standard formal. These rules specify only the major steps needed to perform the four, operati
......
Title: MSCS 503 Computer Architecture




24. Data, Information and Knowledge: Concepts and Definitions(Library and Information Science) 
Total View (234) 

After reading this unit, students will be able to understand the connotations of the terms Data, Information, Knowledge and Wisdom.They will also be able to distinguish between Data, Information and Knowledge.
Title: BLI51 Library Information and Society




25. Partial Ordering and Totally Ordered Set(Mathematics) 
Total View (738) 

We shall emphasize the study of a relation on a set A. various properties of relations are developed along with ways to represent finite relation.
Title: Math 1.4 Discrete Mathematics






Total 0 Chapter(s) Shortlisted and Price Rs. .00 Download Now
