0% found this document useful (0 votes)
49 views8 pages

Third Year Computer Science Courses

The document outlines the course details for the third year, first and second semesters, including course titles, credits, prerequisites, and contact hours. Key subjects include Database Systems, Operating Systems, Microprocessors, Theory of Computation, Data Communication, Compiler Design, and Digital System Design. Additionally, it includes practical laboratory courses and project work, emphasizing technical writing and seminar presentations.

Uploaded by

sanaullahabm.ngc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
49 views8 pages

Third Year Computer Science Courses

The document outlines the course details for the third year, first and second semesters, including course titles, credits, prerequisites, and contact hours. Key subjects include Database Systems, Operating Systems, Microprocessors, Theory of Computation, Data Communication, Compiler Design, and Digital System Design. Additionally, it includes practical laboratory courses and project work, emphasizing technical writing and seminar presentations.

Uploaded by

sanaullahabm.ngc
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

COURSE DETAILS IN THIRD YEAR 1st SEMESTER

CSE 3101: Database System


Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Introduction to Database System: Purpose of database systems, View of Data, Data Models &
Languages, Database Administrator & Users, System Structure

Entity-Relationship Model: Basic Concepts, Design issues, mapping constraints, keys, weak
entity sets, E-R diagram and its extended features, design of an E-R database schema, reduction
to table

Relational Model: Structure of Relational Database, Relational Algebra, Extended Relational-


Algebra Operations, Modification of the database, Views.

Structure Query Language: Background, Basic Structure: Set, Aggregate Functions, Null
Values, Nested Subqueries, Derived Relation, Views, Modification, joined relations, DDL.

Integrity Constraints: Domain Constraints, Referential Integrity, Assertions, and Triggers.

Functional Dependency: atomic domain,First normal form, keys and functional dependencies,
BCNF,3NF, 4NF, Higher Normal [Link] of a set of functional dependencies, closure of
attribute sets, canonical cover, lossless decomposition, decomposition using functional
dependencies.

Data Storage structure: Overview of physical storage, RAID, File organization and record
organization in a File, Data Dictionary storage.

Indexing and Hashing: Basic concepts, Ordered Indices, B+ tree, B tree, Hashing, Index
definition in SQL.

Transaction: Transaction concept, Transaction State, Implementation of Atomicity &


Durability, Concurrent execution, Serializability, Recoverability, Transaction in SQL.

CSE 3102: Database System Laboratory


Credits: 1.5 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Laboratory works based on CSE 3101

Page 18
CSE 3103: Operating System
Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Introduction: Evolution, Goals and Components of OS, Types of OS. Operating System Services

Process management: Process states and state transition, Process Control Blocks, Job and Process
scheduling, Process Communication, Threads

CPU Scheduling: Scheduling levels, Objectives and criteria, CPU scheduling algorithms,
Algorithm Evaluation

Process Synchronization: Process co-ordination, Critical section problems, Semaphores, Monitors,


Classical problems of process synchronization.

Deadlock: System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock
prevention, avoidance, and detection, Recovery form deadlock, Deadlock handling.

Memory management: Logical and Physical Address Space, Swapping, Memory allocation
schemes, Paging and Segmentation, Segmentation with Paging

Virtual memory: Demand paging, Performance of Demand Paging, Page replacement algorithms,
Allocation of frames, Demand Segmentation

Secondary storage management: Disk structure; Disk scheduling, Disk management, Swap-space
management, Disk reliability, Stable storage implementation

File-System: File and Directory concept, File system structure, Allocation method, Free space
Management, Directory Implementation.
Protection and Security: Goals of protection, principle of protection, Access matrix, Access
Control, Security problems and Threats, Computer Security, Implements Security Defenses,

CSE 3104: Operating System Laboratory


Credits: 1.5 Pre-requisite: CSE 2102 Contact Hours: 3 Hours/Week
Laboratory works based on CSE 3103

CSE 3105: Microprocessors and Assembly Language


Credits: 3 Pre-Requisites: CSE 2105 Contact Hours: 3 Hours/Week
Introduction: Microprocessors and microcomputers; Evolution of microprocessors;
microprocessor applications; Programming Languages; General architecture of microprocessor; The
Memory; Input/Output; Co-processors.

Page 19
Assembly Language Programming: Introduction to Assembly Language Programming,
Addressing Modes, Machine & Assembly instruction types & their formats; Character
representation instructions; Instruction execution; Control structures, Subroutines, Interrupt, Macros
& files; I/O programming; Assembler.

Intel 8086 microprocessor: Internal architecture; Register structure; Programming model;


Addressing modes, Instruction set; Programming; Memory subsystem; Bus timing and standards,
Co-processors interfacing, Inter-processors communication.

Overview of Other Processors: Intel 80186, 80286, 80386, 80486 & Pentium microprocessors and
other advance processors; Motorola 68000, Dual Core, Core to Duo, Core i3, Core i5, Core i7,
Quad Core, Atom, Processors in cell phones.

CSE 3106: Microprocessors and Assembly Language Laboratory


Credits: 1.5 Pre-Requisites: CSE 2106 Contact Hours: 3 Hours/Week
Laboratory works based on CSE 3105

CSE 3107: Theory of Computation


Credits: 2 Pre-Requisites: Nil Contact Hours: 2 Hours/Week
The Central Concepts: Introduction to Finite State Machines and Finite State Automata;
Alphabets, Strings and Languages.

Finite Automata: Deterministic Finite Automata, Non-deterministic Finite Automata, and their
applications; Finite Automata with Epsilon-Transitions.

Regular Expressions and Languages: Regular Expressions, Finite Automata and Regular
Expressions, Applications of Regular Expressions, and Algebraic Laws for Regular Expressions.

Properties of Regular Languages: The Pumping Lemma for Regular Languages and its
applications; Closure Properties and Decision Properties of Regular Languages; Equivalence and
Minimization of Automata.

Context-Free Grammars and Languages: Context-Free Grammars; Parse Trees; Applications of


Context-Free Grammars; Ambiguity in Grammars and Languages, Chomsky and Greibach Normal
forms for CFG’s; The Pumping Lemma for CFL’s; Closure and Decision properties of CFL’s.

Pushdown Automata: Definition and the languages of a PDA; Equivalence of PDA’s and CFG’s;
Deterministic Pushdown Automata.

Introduction to Turing Machines: The Turing Machine, Programming Techniques for Turing
Machines, Extensions to the Basic Turing Machine, Restricted Turing Machines, Turing Machines
and Computers.
Page 20
HUM 3101: Industrial Management and Accounting
Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Industrial Management: Administration, Management and organization, Authority and
responsibility, Scientific management, Organization structure, organization chart, Span of
control, Selection and recruitment of employees; training and its types, promotion, wage system
and incentive; job-evaluation and merit rating, Plant layout, layout of physical facilities,
Transportation and storage, Material handling, Maintenance, Maintenance policy, Production
control in intermittent and continuous manufacturing industry, functions of production control,
Purchasing procedures : Inventory-need and methods of control, Factors affecting inventory
building-up, Economic lot size and reorder point.
Accounting: Basic accounting, Classification of account, Journal, Ledger, Cash book, Trial
Balance, Final account.
Cost Accounting: Definition and objectives; Elements of a costs; Preparation of a cost sheet,
Marginal costing: Break even analysis, Process costing.

CSE 3100: Software Development Project-I


Credits: 1.0 Pre-Requisites: CSE 2102 Contact Hours: 2 Hours/Week
Students will develop one project with proper documentation as approved by the departmental
academic committee.

Page 21
COURSE DETAILS IN THIRD YEAR 2nd SEMESTER

CSE 3201: Data Communication


Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Data and Signals Overview: Introduction, a Communication Model, fundamentals of data
communication, reference models, basic concepts and terminologies of data and signal,
transmission impairments.

Digital and Analog Transmission: Line coding, block coding, sampling, quantization,
modulation techniques.

Transmission Media: Twisted pair, coaxial cable, fiber optic cable, radio waves, microwaves,
infrared, and satellite communication.

Data communication Interface: Serial and parallel transmission, Asynchronous and


Synchronous Transmission, Simplex, half-duplex and full-duplex communications, interface
standards: RS-232 interface, Null modems, RS-449 interface, X.21 interface.

Digital Data communication Technique: Asynchronous and synchronous transmission, line


configuration and interfacing

Error Detection and correction: Types of error, error detection and error correction
techniques.

Data Link Control: Flow control techniques and high-level data link control

Multiple access and Multiplexing: Random access, controlled access, channelization,


Frequency division multiplexing, Time division multiplexing and other multiplexing techniques.

Switching Techniques and mobile telephone systems: Circuit switching; message switching,
packet switching, virtual circuits, frame relay, generations of mobile telephone systems.

CSE 3202: Data Communication Laboratory


Credits: 1.5 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Laboratory works based on CSE 3201

CSE 3203: Compiler Design


Credits: 3 Pre-Requisites: CSE 3107 Contact Hours: 3 Hours/Week
Introduction: Phases of a compiler (lexical analyzer, syntax analyzer, semantic analyzer,
intermediate code generator, code optimizer, code generator, symbol-table manager & error
handler), overview of C, C++, Java, C# compilers.

Page 22
Lexical analysis: Role, finite automata, from regular expression to NFA, from NFA to DFA.

Syntax analysis: Role, CFG, writing a grammar, top-down parsing, bottom-up parsing, operator
precedence parsing, LR parser, using ambiguous grammar. Symbol table, structure and
management.

Intermediate code generation: Intermediate languages, declarations, assignment statement,


Boolean expression, case statements, back patching, procedure calls.
Code optimization: Principle of source optimization, optimization of basic blocks, loop in flow
graphs, global data flow analysis, iterative solution of data flow equations.
Code generation: Issues in the design of a code generator, target machine, runtime storage
management, basic blocks and flow graphs, register allocation and assignment, dag representation
of basic blocks, peephole optimizations, generating code from dags.

CSE 3204: Compiler Design Laboratory


Credits: 1.5 Pre-Requisites: Nil Contact Hours: 3 Hours/Week

Laboratory works based on CSE 3203

CSE 3205: Parallel and Distributed Processing


Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week

Parallel Processing: Importance, architecture, Hardware and software issues; Architectures for
parallel processing - Classifications
Comparative Study of Different Architectures: Hardware issues in parallel processing,
parallel programming

Distributed Processing: Definition, Impact of distributed processing on organizations, pitfalls in


distributed processing

Forms of Distributed Processing: Function distribution, Hierarchical distributed systems,


Horizontal distributed systems

Strategy: strategies for distributed data processing, control of complexity, problem of


incompatibility, centralization vs. decentralization, cost and benefit analysis

Design of Distributed Data: distributed data, location of data, multiple copies data, conflict
analysis, database management, distributed databases and applications

Page 23
CSE 3207: Digital System Design
Credits: 3 Pre-Requisites: CSE 2105 Contact Hours: 3 Hours/Week
Register Transfer Logic: Inter Register Transfer, Arithmetic, Logic and Shift Micro-
Operations, Conditional Control Statements, Fixed-Point Binary data, Overflow, Arithmetic
shifts, Decimal data, Floating-Point data, Non-numeric data, Instruction codes, Design of simple
computer;
Processor Logic Design: Processor Organization, Arithmetic Logic Unit, Design of Arithmetic
Circuit, Design of Logic Circuit, Design of Arithmetic Logic Unit, Status Register, Design of
Shifter, Processor Unit, Design of Accumulator. Design of Multiplier Circuits.

Control Logic Design: Control Organization, Hardwired control, Micro-program Control,


Control of Processor Unit, PLA Control, Micro-program Sequencer;

Computer Design: System Configuration, Computer Instructions, Timing and Control,


Execution of Instructions, Design of Computer Registers, Design of Control. Register Load and
Inter Register Transfer; Bus Buffer and Memory Cycle of Microcomputers;

Computer Design (Simple as Possible): Architecture, Instruction Set, Programming, Fetch


Cycle, Execution Cycle.

CSE 3210: Technical Writing and Seminar Laboratory


Credits: 1.5 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Introduction to technical writing, Introduction to LATEX, Writing paper, thesis, etc. using
LATEX. Student will work in-groups or individually to review papers assigned by respective
teacher(s) and will present in front of audience.

HUM 3201: Economics and Sociology


Credits: 3 Pre-Requisites: Nil Contact Hours: 3 Hours/Week
Economics: Nature of the economics theory. Some basic concepts - supply, demand and their
elasticities. The relationship among average, margin and total and their derivation. Equilibrium -
stable, straight and dynamic equilibrium. Consumer’s equilibrium-indifference curve, producer’s
equilibrium-isoquant. Production-factors of production, production possibility curve-equilibrium
of a firm, fixed cost and variable cost, the short run and the long run. The cost curves and supply
curves, law of returns, internal and external economics and diseconomies. Economics of
development and planning, basic concept-saving, investment, GNP, NNP. Fiscal policy,
monetary policy and trade policy, some planning tools-capital output ratio, input
analysis.

Page 24
Sociology: Scope, Social evolution and techniques of production, Culture and civilization, Social
structure of Bangladesh. Population and world resources. Oriental and Occidental societies,
Industrial revolution. Family - Urbanization and industrialization, Urban Ecology, Co-operative
and socialist movements, Rural sociology.

CSE 3200: Software Development Project II


Credits: 1.5 Pre-Requisites: CSE 3102 Contact Hours: 2 Hours/Week
Students will develop one/two mini projects with proper documentation as approved by the
departmental academic committee.

CSE 3200: Viva-Voce


Credits: 1.0
Exam committee will take viva-voce based on the courses of third year 1st semester and 2nd
semester.

Page 25

You might also like