Notice Board
| ||
| ||
| Course Catalogue |
|
| Course Code: CSE 408 Course Name: Computer Modeling and Simulation Prerequisite: CSE 207 Credit Hours: 3.00 Detailed Syllabus: System Models- Entities, Attributes, States, Activities, Types of Models, Static & Dynamic Models, Deterministic & Stochastic Activities. Principles used in Modeling. System Simulation Continuous & Discrete event simulation Languages- GPSS, SIMULA, CSMP, DYNAMO. Probability concepts in Simulation- Random number, stochastic processes, Birth-Death process. Parameter estimation & input/output validation. Statistical Hypothesis Testing. Queuing Systems, M/M/I & M/M./m queues, Bulk arrival & Bulk service systems. Queuing networks. Computational algorithms & approximation techniques. Workload characterization & performance evaluation of computer systems. Evaluation of program performance. Case studies. | |
| Course Code: CSE 409 Course Name: Advanced Programming Languages Prerequisite: CSE 103, CSE 201 Credit Hours: 3.00 Detailed Syllabus: This course will cover functional and logic programming, concepts of programming language design, and formal reasoning about programs and programming languages. The topics included are: Functional Programming (ML/OCaml); Small-step and large-step operational semantics; Denotational semantics; Fixpoints, fixpoint induction; Axiomatic semantics; Type theory, Untyped and simply typed lambda calculus; Partial evaluation, non-determinism, Logic programming | |
| Course Code: CSE 410 Course Name: Artificial Intelligence Prerequisite: CSE 103, CSE 201, CSE 207 Credit Hours: 3.00 Detailed Syllabus: Overview of Al, general concepts of knowledge, LISP and other Al programming languages. Knowledge representation: Intelligent Agents: Agents that reason logically, Inference in First order Formalized symbolic logic, inconsistencies and uncertainties, probabilistic reasoning, structured knowledge, object oriented representation; Knowledge organization and manipulation: search strategics and game planning, matching techniques, knowledge organization and management; Introduction to selected topics in A!: Natural language processing, pattern recognition, computer vision, expert system, artificial neural networks, robotics.. Knowledge Acquisition: General concept, learning and automata, genetic algorithms, induction, analogical and explanation based learning. | |
| Course Code: CSE 411 Course Name: Compiler Design Prerequisite: CSE 103, CSE 201, CSE 207 Credit Hours: 3.00 Detailed Syllabus: Compilers, Lexical Analysis: Lexical Analysis, regular expressions, regular languages, syntax Analysis: syntax analysis, context free grammars, bottom-up parsing, LR (0) parsing SLR parsing, (LR (I) parsing, LALR (I) parsing, classification of context-free grammars and languages, syntactic error recovery, syntax direct definitions attributes evaluation, Abstract syntax trees, symbol Tables, type checking semantic cheek for Inheritance: Sub-typing, and for Overloading. Generation of intermediate code: Generation of intermediate code- translation of Boolean expressions, switch/case statements, run-time structures, Back patching Generation of unoptimized target code. Introduction to code. optimization: control flow graphs, live-variable analysis, allocation optimized register allocation by graph coloring Available expression analysis, Global common sub-expression elimination, nominators, Loops in control flow graphs, Def-use & use-def chains, Loop-invariant, code motion, partial redundancy elimination, constant propagation, optimizing Object-oriented programs, copy propagation, phase ordering of optimizations, Instruction scheduling, optimizations for memory hierarchies. | |
| Course Code: CSE 412 / CSE 413 Course Name: Programming with Java Prerequisite: CSE 103, CSE 201, CSE 207 Credit Hours: 3.00 + 1.00 Detailed Syllabus: Basics of Java, Threads and Sockets, JDBC, Serialization and reflection, Client Server programming, RMI and distributed computing, CORBA, Beans, Enterprise Java beans, XML Programming with Java, Java Servlets. The course includes lab works based on theory taught. | |
| Course Code: CSE 413 Course Name: Routers and Routing Basics Prerequisite: CSE 309 Credit Hours: 3.00 Detailed Syllabus: WANs and Router; Introduction to Routers; Configuring a Routers; Learning about other Devices; Managing Cisco IOS software; Routing and Routing Protocols; Distance Vector Routing Protocols; TCP/IP Suite Error and control messages; Basic Router Troubleshooting; Intermediate TCP/IP; Access control lists (ACLs) ; Case Study: Routing Case Study | |
| Course Code: CSE 414 Course Name: Software Quality Assurance and Testing Prerequisite: CSE 404 Credit Hours: 3.00 Detailed Syllabus: This course will study some of the major areas related to software quality, including: Defining quality, Software quality assurance processes, Software quality standards, Software testing standards, SCRUM and Testing Frameworks, Unit Testing, Integration Testing, System Testing, CMMI, PSP, Extreme Programming. | |
| Course Code: CSE 415 Course Name: Visual Programming Prerequisite: None Credit Hours: 3.00 Detailed Syllabus: There has been growing research interest in visual languages and visual programming. Its applications are diverse: visual user interface, visual specifications, visual reasoning, visual database systems and multimedia computing, to name but a few. This course will prepare the student to pursue research in these new and exciting fields of theory and application of visual languages. The aim of the course is to give students basic information about the object-oriented programming concepts using C++ and MFC library, and to enable them to design and code visual programs using Visual Studio 2008. | |
| Course Code: CSE 416 Course Name: NET Programming using C# Prerequisite: None Credit Hours: 3.00 Detailed Syllabus: This course provides the student with the essentials necessary to design and develop robust and secure applications using C#, Windows forms, and the .NET framework. In addition to the essentials, the course also provides coverage of advanced topics, such as LINQ, ADO.NET, writing secure .NET applications, designing and developing multithreaded applications, and web services. | |
| Course Code: CSE 417 Course Name: Automata and Theory of Computation Prerequisite: CSE 201 Credit Hours: 3.00 Detailed Syllabus: Alphabet, string (finite and infinite) and languages. Finite representation of languages. Finite automation (deterministic, non-deterministic and Internating), regular expressions, left and right linear grammars and their equivalence's- Minimal machine, simplification of regular expression. Finite state transducer. Properties of regular languages: closure properties, pumping theorem, ultimately periodic set. Algorithmic problems. Chomsky hierarchy of languages. Pushdown automaton (non-deterministic, deterministic and their non equivalence), context free grammars and their equivalence. Reduce grammars normal forms. CKY and Barley's parsing algorithms. Ambiguity: deterministic CFL and LR grammars. Properties of CFL: closure properties, pumping theorem Parikh's theorem Formal power series and degree of ambiguity. Fixed point theory. Algorithmic properties. Turing machine type-O grammar and their equivalence. TM as a transducer, recognizer, acceptor. Variants of TM. Turing acceptable and recognizable languages (recursive and recursively innumerable sets). Universal TM. Halting problem of TM and undecidability results (related to language theory e.g. equivalence of CFGs, ambiguity of CFG etc) Non-deterministic linear space bounded TM (liner bounded automata) and context-sensitive language (CSL ). Properties of CSL. Finite automation on infinite strings. Buchi and Mcnaughton finite state machines, their languages and properties, Relation of these machines and languages with logic and concurrency. Fractal images and automation on infinite strings. | |
| << < Pages : 1 2 3 4 5 6 7 8 9 10 > >> | |
| Institutional Memberships | |||||
 |  |  |  |  |  |
| Copyright @ 2010 ULAB | All Rights Reserved. |