are you suprised - ahsanullah university of science and ... · web viewexperiments based on dos,...

Department of Computer Sc. & Engineering, AUST

IntroductionThe department of Computer Science and Engineering, abbreviated CSE, is offering

an undergraduate engineering degree program since the establishment of the university in the year 1995 with a view to offer quality higher education to numerous worthy young fellows as well as to meet the huge demand of highly qualified specialists in the field. The 4-year program is spread over eight semesters with two semesters per academic year. Each semester is of around 20 working weeks containing classes for 15 weeks and preparatory leave with semester final examination for 5 weeks. Apart from the 20 working weeks per semester, the department remains open for clearance/improvement/carryover examinations, result and admission of students in the 1st semester of 1st year and for works related to industrial training etc..

Entry qualification for the program is Higher Secondary Certificate (H.S.C.) with good academic background or A-Level with comparable results or equivalent. Usual intake of students in the department is once in an academic year. Theory classes are held with approximately 50 students per class and each class is divided into three subsections for practical classes. Students graduated from this department have been employed in different prestigious institutions and organizations. Some of them are getting higher studies abroad. Also a number of students of the department have taken transfer to foreign universities.

The department has a good number of full-time faculty with best available exposure to ever-growing horizon of computer science and engineering. Besides, a number of part-time faculties also teach in each semester from other universities, research organizations and industrial establishments for extending experience-rich education.

The program follows an intensive course curriculum containing well-organized courses on basic sciences, computer science, electrical and electronic engineering, computer engineering, management and humanities. Of course, computer science and engineering courses are most emphasized and constitute the bulk of the program (about 70%).

We have six computer labs and two digital electronics labs equipped with modern personal computers and electronic devices in the department for conducting regular sessional (practical) classes. Besides, there is a computer lab for the teachers and there is also a server center equipped with various PC-server systems for providing network facilities to the labs. The department provides email and internet facilities to teachers and students. It also maintains a web site under the address ‘www.aust.edu’.

The department organizes various co-curricular and extra-curricular activities to develop important social and professional faculties in the students. Most common co-curricular activity is the programming competition, which has become regular by this time. The Literary and Debating Club comprising teachers and students organizes various competitions that uphold its objectives, and occasionally publishes journals and souvenirs.

In this booklet semester-wise brief and detailed outlines of the departmental and non-departmental courses have been given. A few other courses may also be offered in addition to the courses shown here. Optional courses described here are offered depending on the availability of teachers and the number of students in the class. Requirements of contact

1

hours and credits have also been summarized in the booklet. Besides, a brief description of the up-to-date rules and regulations regarding examinations, grading system and grade points has been incorporated.

2

Examinations, Grading System and GPA Requirements:

1. The total performance of a student in a given course will be based on:

(i) Continuous assessment (attendance, class performance, quizzes and/or assignments etc.).

(ii) Semester final examination.

(iii) Clearance examination (for clearance of carryover/ uncleared courses), if any.

(iv) Improvement examination, if any.

2. The continuous assessment and the semester final examination will form regular examination system while the clearance examination and the improvement examination will provide additional opportunities to the students.

3. The distribution of marks between the continuous assessment and the semester final examination will be as follows:

(i) Class participation (i.e. attendance, class performance etc.).10%

(ii) Quizzes and/or assignments..................................................20%(iii) Semester final examination....................................................70%

Total:.............................................................................................100%The number of quizzes and/or assignments in a course of study shall not exceed n + 1, where n is the number of credits of the course. Evaluation of the performance will be on the basis of the best n quizzes and/or assignments.

4. Clearance examination in a course will be held only for those students who have obtained a grade ‘F’ in the course in regular examinations. Clearance examinations will be held over a period of 1 to 2 weeks at the end of each odd and even semester.

5. Clearance examination in a course will carry 70% of the total marks assigned to the course, the rest 30% will be entered from the record of continuous assessment secured earlier by the student. Whatever is the total mark, a student can earn at best a grade ‘C’ for a course in the clearance examination.6. A student can have a maximum of 2 (two) uncleared or carry over courses in any individual semester with a cumulative maximum of 4 (four) uncleared or carry over courses of different semesters for promotion to the next higher semester. Such students can clear the backlog of uncleared or carry over courses in the clearance/ improvement examinations of the relevant odd or even semesters of lower levels than those they are currently in. The examination and grading will be in the same manner as clearance examination.

7. If the total number of uncleared or carry courses in any semester exceeds 4 (four) for a student, he/she can proceed to the next semester only after improving his/her standing by reducing the total number of the uncleared or carry courses within the allowable limit of 4 (four). This will cost the student at least one academic year. In the mean time, the student can try to clear some of his/her uncleared courses by taking the relevant clearance examinations. He/She can also re-register in the course/courses previously taken by him/her in the semester he/she failed and attend the classes with a view to improve his/her learning. However, the grade/grades obtained in the re-

3

registered course/courses will be considered for calculating his/her Grade Point Average (G.P.A) and his/her previous passing grade/ grades will be kept as a record for chronological sequence.

8. For the purpose of grade improvement, a student obtaining a grade lower than ‘B’ in a course can sit in the relevant improvement examination by cancelling his/her earlier passing grade of the course. The improvement examination in a course will carry 70% of the total marks assigned to the course and like the clearance examination the rest of the marks will be entered from the record of the continuous assessment secured earlier by the student. Whatever is the total mark of the improvement examination, a student will be allowed to earn at best a grade ‘B’ for the course. Further, a student in a 4 year degree program can try to improve his/her grades in a maximum of 4 (four) courses while a student of Architecture who goes through a 5 year program, can do the same in a maximum of 5 (five) courses.

9. All 4 year degree programs at the AUST will require completion of all degree requirements within a maximum period of 7 years. The 5 year bachelor of Architecture degree program will require completion of all degree requirements within a maximum period of 8 years. Failure to complete all degree requirements within the given time frame will disqualify a student from further continuation of his study at the AUST.

10. Letter grades and the corresponding grade-points will be awarded in accordance with the

provision shown below:

Numerical Grade Letter GradeGrade Point

80% or above A+ 4.0075% to less than 80% A 3.7570% to less than 75% A- 3.5065% to less than 70% B+ 3.2560% to less than 65% B 3.0055% to less than 60% B- 2.7550% to less than 55% C+ 2.5045% to less than 50% C 2.2540% to less than 45% D 2.00Less than 40% F 0.00

Extraordinary Course Status Letter Grade

Continuation XWithdrawn WExemption E

NOTE:

If any grade of project and thesis/sessional of a student is not available in time due to any genuine reason, the student may apply to the Head of the Department for continuation in the subsequent

4

semester within a week after the result is published. In this case, the student may be marked with a letter grade ‘X’ against the course/courses in the tabulation sheet/ grade card/ transcript. However, he/she may not be allowed to attend any examination of the subsequent semester unless his/her grade of the course is available at least one month before the semester final examination of the subsequent semester. In any case, he/she will not be eligible for a scholarship/award.

11. Each course has certain credits that describe its weight. A theory course that assumes n average weekly contact hours is said to have n credits, but a sessional course of the same contact hours is said to have n/2 credits. A student’s performance is measured by the sum of the credits the student has completed satisfactorily and the weighted average of the grade points (Cumulative Grade Point Average, abbreviated CGPA) that he/she has maintained. Calculation of Grade Point Average (GPA) and CGPA can be explained as follows:

Suppose a student has completed five courses in a semester and obtained the following grades:

Courses Credits Grades Grade PointsCourse 1 3 A+ 4.00Course 2 3 B 3.00Course 3 3 A 3.75Course 4 2 B+ 3.25Course 5 1 A- 3.50Course 6 3 F 0.00

Then his/her GPA for the semester will be computed as follows:

GPA =

=

= 3.52

On the other hand CGPA will be computed as follows:

CGPA =

12. Students will be considered to be making normal progress towards a degree if their CGPA for all works attempted is not less than 2.20. Students who fail to maintain this minimum rate of progress may be placed on academic probation.

13. The status of academic probation is a reminder/warning to the student that satisfactory progress towards graduation is not being made. The minimum period of probation is one semester

Courses with the grade F are not considered completed

5

but the usual period is one academic year. The probation is extended for additional semesters until the student achieves a CGPA of 2.20 or better.

14. A student on academic probation who fails to maintain a CGPA of at least 2.20 during two consecutive academic years may be suspended from the University. If it is the first suspension, it may be withdrawn by the concerned Head of the Department on receipt of an application from the student and on being satisfied that the student will make every effort from then on to improve his/her performance, but this can only be done after the student has gone through at least a full semester of suspension. However, a second suspension will be regarded as final and absolute.

15. All students are expected to attend classes regularly. The University authority believes that attendance is necessary for effective learning. The first responsibility of a student is to attend classes regularly and one is required to attend at least 60% of all classes held in every course.

16. A student failing in any sessional/practical/studio work will have to repeat the semester. While repeating a semester for the said reason, a student may be exempted from registering in the course/courses of the semester in which he/she obtained a grade ‘C’ or better.

17. The Free Tuition Award is made in every semester on the basis of the grade points earned in the subjects of the immediate previous semester. If there is a tie, the decision is given on the basis of actual marks obtained by the students. Students having carry over subject/ subjects of the immediate previous semester are not considered for the award.

The authority may also award Half-Free Tuition Award to the students whose results are considered to be equally brilliant.

6

BRIEF OUTLINE OF UNDERGRADUATE PROGRAM IN

COMPUTER SCIENCE & ENGINEERING

YEAR – 1, SEMESTER – 1

Course No. Course Title Contact Hours/Week Theory-Lab

Credit Hours

PHY 105 Physics 4 – 0 4.0PHY 106 Physics Lab 0 – 3 1.5

CHEM 105 Chemistry 3 – 0 3.0 MATH 105 Mathematics –I (Differential Calculus

& Co-ordinate Geometry)3 – 0 3.0

CSE 101 Programming Language–I 4 – 0 4.0CSE 102 Programming Language–II Lab 0 – 3 1.5CSE 107 Fundamentals of Computer 3 – 0 3.0CSE 108 Fundamentals of Computer Lab 0 – 3/2 0.75

Total: 17 7.5 20.75Total Contact Hours: 24.5

ttt

YEAR – 1, SEMESTER - 2


Credit Hours

HUM 101 English & Economics 4 – 0 4.0EEE 107 Basic Electrical Engineering 4 – 0 4.0EEE 108 Basic Electrical Engineering Lab 0 – 3 1.5

MATH 109 Mathematics–II (Integral Calculus & Ordinary Differential Equations)

3 – 0 3.0

ME 104 Engineering Drawing 0 – 3/2 0.75CSE 100 Software Development–I 0 – 3/2 0.75CSE 103 Discrete Mathematics 3 – 0 3.0CSE 105 Programming Language–II 3 – 0 3.0CSE 106 Programming Language–II Lab 0 – 3 1.5

Total: 17 9 21.5Total Contact Hours: 26

ttt

7



Credit Hours

EEE 211 Electronic Devices & Circuits 4 – 0 4.0EEE 212 Electronic Devices & Circuits Lab 0 – 3 1.5

MATH 201 Mathematics–III (Complex variable, Laplace transforms and Statistics)

4 – 0 4.0

CSE 201 Numerical Methods 3 – 0 3.0CSE 203 Data Structures 3 – 0 3.0CSE 204 Data Structures Lab 0 – 3/2 0.75CSE 205 Digital Logic Design 3 – 0 3.0CSE 206 Digital Logic Design Lab 0 – 3 1.5CSE 212 Assembly Language Programming 0 – 3 1.5


YEAR – 2, SEMESTER- 2


Credit Hours

EEE 209 Electrical Drives & Instrumentation 4 – 0 4.0EEE 210 Electrical Drives & Instrumentation

Lab0 – 3 1.5

MATH 203 Mathematics–IV (Matrices, Vector & Fourier Analysis)

3 – 0 3.0

CSE 200 Software Development–II 0 – 3 1.5 CSE 207 Algorithms 3 – 0 3.0CSE 208 Algorithms Lab 0 – 3/2 0.75CSE 209 Pulse & Digital Electronics 4 – 0 4.0CSE 210 Pulse & Digital Electronics Lab 0 – 3 1.5CSE 213 Computer Architecture–I 3 – 0 3.0


ttt

8



Credit Hours

HUM 201 Accounting & Sociology 4 – 0 4.0CSE 301 Mathematical Analysis for Computer

Science3 – 0 3.0

CSE 303 Database 3 – 0 3.0CSE 304 Database Lab 0 – 3 1.5CSE 307 Microprocessors 3 – 0 3.0CSE 308 Microprocessors Lab 0 – 3 1.5CSE 309 Digital System Design 4 – 0 4.0CSE 310 Digital System Design Lab 0 – 3 1.5




Credit Hours

CSE 300 Software Development–III 0 – 3 1.5CSE 311 Data Communication 3 – 0 3.0CSE 313 Operating System 3 – 0 3.0CSE 314 Operating System Lab 0 – 3/2 0.75CSE 315 Computer Interfacing 3 – 0 3.0CSE 316 Computer Interfacing Lab 0 – 3 1.5CSE 319 Information System Design 3 – 0 3.0CSE 320 Information System Design Lab 0 – 3 1.5CSE 321 Introduction to Theoretical Computer

Science 3 – 0 3.0




Credit Hours

HUM 301 Industrial Management 3 – 0 3.0CSE 400 Project & Thesis 0 – 6 3.0CSE 405 Software Engineering 3 – 0 3.0CSE 401 Computer Networks 3 – 0 3.0

9

CSE 402 Computer Networks Lab 0 – 3 1.5CSE 403 Computer Graphics 3 – 0 3.0CSE 404 Computer Graphics Lab 0 – 3/2 0.75CSE 439 Advanced Database Management 3 – 0 3.0CSE 440 Advanced Database Management

Lab0 – 3 1.5




Credit Hours

CSE 400 Project & Thesis 0 – 6 3.0CSE 407 Artificial Intelligence 3 – 0 3.0CSE 408 Artificial Intelligence Lab 0 – 3 1.5CSE 409 Professionalism in Computing 0 – 3 1.5CSE ….. Option–I 3 – 0 3.0CSE ….. Option–I Lab 0 – 3/2 0.75CSE ….. Option–II 3 – 0 3.0CSE ….. Option–II Lab 0 – 3/2 0.75CSE ….. Option–III 3 – 0 3.0


OPTIONS AVAILABLE

OPTIONS- I


Credit Hours

CSE 413 Pattern Recognition 3 - 0 3.0CSE 414 Pattern Recognition Lab 0 – 3/2 0.75CSE 423 Fault Tolerant Systems 3 – 0 3.0CSE 424 Fault Tolerant Systems Lab 0 – 3/2 0.75CSE 425 Network Programming 3 – 0 3.0CSE 426 Network Programming Lab 0 – 3/2 0.75

10

OPTIONS- II


Credit Hours

CSE 411 Simulation & Modeling 3 – 0 3.0CSE 412 Simulation & Modeling Lab 0 – 3/2 0.75CSE 427 Digital Image Processing 3 – 0 3.0CSE 428 Digital Image Processing Lab 0 –3/2 0.75CSE 429 Compiler Construction 3 – 0 3.0CSE 430 Compiler Construction Lab 0 – 3/2 0.75

OPTIONS- III


Credit Hours

HUM 437 Business Law 3 – 0 3.0CSE 415 Computer Architecture–II 3 – 0 3.0CSE 417 VLSI Design 3 – 0 3.0CSE 419 Computer System Performance 3 – 0 3.0CSE 433 Advance Microprocessor Architecture 3 – 0 3.0

SEMESTER-WISE DISTRIBUTION OF CONTACT HOURS AND CREDITS:

Year Semester Theory Hour /Week

Laboratory Hour/Week

Credits

1 1 17 7.5 20.751 2 17 9 21.52 1 17 10.5 22.252 2 17 10.5 22.253 1 17 9 21.503 2 15 10.5 20.254 1 15 13.5 21.754 2 12 15 19.50

127 85.5 169.75

Total Contact Hours per week: 212.5

Total Credits (minimum): 169.75

11

DETAILED OUTLINE OF DEPARTMENTAL COURSES FOR CSE PROGRAM:

YEAR-1, SEMESTER-1

CSE 101 PROGRAMMING LANGUAGE-I 4 hours per week, 4 Cr.

Introduction to digital computers and programming. Algorithms and flow-chart construction. Information representation in digital computers. Writing, debugging and running programs (including file handling) on various digital computers using C.

CSE 102 PROGRAMMING LANGUAGE - I LAB 3 hours per week, 1.5 Cr.

Laboratory works based on CSE 101.

CSE 107 FUNDAMENTALS OF COMPUTER3 hours per week, 3 Cr.

Number systems, conversion of one system to another, complementation of numbers and arithmetic operations, different types of codes, packed and unpacked BCD, EBCDIC and ASCII code representation of data.

Types of computers, basic principles of analog computation. A brief history of digital computers, Importance of computers & their impact on society, application areas. Different generations of digital computer hardware and software. Types of digital computers, functional units of a typical digital computer, I/O DEVICES and peripherals, types of printers and monitors, mouse & joysticks, VDU, modem, fax, pads, optical and magnetic document readers. Bits, Bytes, Words and memory capacity.

Main memory system- types of ROMs and RAMs. Backing memory systems- floppy and hard disks, memory capacity calculation, stepper motor and its application, processing units and bus systems.

Types of software - system software and application software, programming languages and software packages, modes of computer operation.

Operating systems - objectives and functions, important DOS commands, introduction to Windows, study and use of Word processing & Spreadsheet analysis packages, introduction to DBMS and its applications.

CSE 108 FUNDAMENTALS OF COMPUTER LAB3 hours in alternative week, 0.75 Cr.

Experiments based on DOS, Windows, Word processing and Spreadsheet packages.

12

YEAR-1, SEMESTER-2

CSE 100 SOFTWARE DEVELOPMENT-I3 hours in alternative week, 0.75 Cr.

Students will develop a software in groups / individually using any programming language.

CSE 103 DISCRETE MATHEMATICS3 hours per week, 3 Cr.

Set theory, Elementary number theory, Graph theory, Paths and trees, Generating functions. Algebraic structures. Semigraph. Permutation groups. Binary relations, Functions. Mathematical logic, Prepositional calculus and predicate calculus.

CSE 105 PROGRAMMING LANGUAGE-II3 hours per week, 3 Cr.

Introduction to data structures, Formal specification of syntax, Elements of language theory: Mathematical preliminaries, Formal languages. Structured programming concepts. Survey of features of existing major high-level languages, Appropriate applications using C++.

CSE 106 PROGRAMMING LANGUAGE-II LAB3 hours per week, 1.5 Cr.

Laboratory works based on CSE 105.YEAR-2, SEMESTER-1

CSE 201 NUMERICAL METHODS3 hours per week, 3 Cr.

Computational methods for solving problems in linear algebra, linear programming, nonlinear equations, approximations, iterations, methods of least squares, interpolation, integration and ordinary differential equations.

CSE 203 DATA STRUCTURES3 hours per week, 3 Cr.

Concepts and examples, elementary data objects, elementary data structures, arrays, lists, stacks, queues, graphs, trees, memory management. Sorting and searching, hash techniques.

CSE 204 DATA STRUCTURES LAB3 hours in alternative week, 0.75 Cr.


13

CSE 205 DIGITAL LOGIC DESIGN3 hours per week, 3 Cr.

Number systems and codes. Digital logic: Boolean algebra, De-Morgan's law, logic gates and their truth tables, canonical forms, combinational logic circuits, minimization techniques. Arithmetic and data handling logic circuits, decoders and encoders,. Multiplexers and demultiplexers. Combinational circuit design. Flip-flops. Counters: asynchronous counters, synchronous counters and their applications. TTL, MOS, CMOS, IIL logic gates and their circuits. PLA design. Synchronous and asynchronous logic design: state diagram, Mealy and Moore machines. State minimizations and assignments. Pulse mode logic. Fundamental mode design.

CSE 206 DIGITAL LOGIC DESIGN LAB3 hours per week, 1.5 Cr.


CSE 212 ASSEMBLY LANGUAGE PROGRAMMING3 hours per week, 1.5 Cr.

Machine and Assembly instruction types and their formats. Character representation instruction. Instruction execution. Machine language programming. Instruction sets and their implementations. The Assembly process. Addressing methods. Subroutines, macros and files. I/O programming, interrupts and concurrent processes.

YEAR-2, SEMESTER – 2

CSE 200 SOFTWARE DEVELOPMENT – II3 hours per week, 1.5 Cr.

Students will develop a software in groups or individually using any programming language.

CSE 207 ALGORITHMS3 hours per week, 3 Cr.

Techniques for analysis of algorithms, Methods for the design of efficient algorithms: divide and conquer, greedy method, dynamic programming, back tracking, branch and bound. Basic search and traversal techniques, graph algorithms. Algebraic simplification and transformations, lower bound theory, NP-hard and NP-complete problems.

[[[[[[[CSE 208 ALGORITHMS LAB3 hours in alternative week, 0.75 Cr.

14

Laboratory work based on CSE 207.

CSE 209 PULSE & DIGITAL ELECTRONICS4 hours per week, 4 Cr.

Linear wave shaping: diode wave shaping techniques, clipping and clamping circuits, comparator circuits, switching circuits, pulse transformations, pulse transmission. Pulse generation, monostable, bistable and astable multivibrators, Schmitt trigger; blocking oscillators and time-base circuit. Timing circuits. Simple voltage sweeps, linear current sweeps.

Diode logic gates, transistor switches, transistor gates, MOS gates, Logic Families: TTL, ECL, IIL and CMOS logic with operation details. Propagation delay, product and noise immunity: Open collector and High impedance gates. Electronic circuits for flip-flops, counters and registers, memory systems, PLA's, A/D, D/A converters with applications, S/II circuits LED, LCD and optically coupled oscillators. Non-linear applications of OP AM's. Analogue switches.

CSE 210 PULSE & DIGITAL ELECTRONICS LAB3 hours per week, 1.5 Cr.


CSE 213 COMPUTER ARCHITECTURE-I3 hours per week, 3 Cr.

Information representation and transfer; instruction and data access methods; the control unit: hardwired and microprogrammed; memory organization, I/O systems, channels, interrupts, DMA. Von Neumann SISD organization. RISC and CISC machines.

YEAR –3, SEMESTER - 1

CSE 301 MATHEMATICAL ANALYSIS FOR COMPUTER SCIENCE3 hours per week, 3 Cr.

Math. Preliminaries: sums and products, permutations and factorials, binomial coefficients, harmonic numbers, Fibonacci numbers, generating functions, analysis of algorithms. The O-notation, Euler's summation formula, some asymptotic calculations. Probability Theory: Probability distribution and expectation, Stochastic processes, Discrete-time Markov chain and continuous-time Markov chain. Birth-death process in queuing. Queuing models: M/M/I M/M/C M/G/I, M/D/I, G/M/I solution of networks of queues, closed queuing models and approximate models. Applications of queuing models in computer Science and Engineering.

CSE 303 DATABASE3 hours per week, 3 Cr.

Concepts and methods in database systems. File organization and retrieval. Data manipulation. Query formulation and language. Database models. Data description languages, database integrity and security. Data dictionary/directory systems, Database administration. Database design. Survey of some existing database management systems.

15

CSE 304 DATABASE LAB3 hours per week, 1.5 Cr.


CSE 307 MICROPROCESSORS3 hours per week, 3 Cr.

Introduction to different types of microprocessors. Microprocessor architectures.Instruction set, Interfacing, I/O operations, Interrupt structure, DMA. Microprocessor interface ICs. Advanced microprocessors, Concepts of microprocessor based system design.

CSE 308 MICROPROCESSORS LAB3 hours per week, 1.5 Cr.


CSE 309 DIGITAL SYSTEM DESIGN4 hours per week, 4 Cr.

Design using MSI and LSI components. Design of memory subsystem using SRAM and DRAM. Design of various components of a computer: ALU, memory and control unit (hardwired and microprogrammed). Microprocessor based designs. Computer bus standards. Design using special purpose controllers, floppy disk controllers. Digital control system. Computers in Telecommunication and control.

CSE 310 DIGITAL SYSTEM DESIGN LAB3 hours per week, 1.5 Cr.

Laboratory works based on CSE 309.YEAR-3, SEMESTER – 2

CSE 300 SOFTWARE DEVELOPMENT – III3 hours per week, 1.5 Cr.

Students will work in groups or individually to produce high quality software in different languages. Students will write structured programs and prepare proper documentation.

CSE 311 DATA COMMUNICATION3 hours per week, 3 Cr.

Introduction to modulation techniques: Pulse modulation, pulse amplitude modulation, pulse width modulation and pulse position modulation. TDM, FDM, OOK, FSK, PSK, QPSK. Representation of noise; threshold effects in PCM and FM. Probability of error for pulse systems, concept of channel coding and capacity. Asynchronous and synchronous communication. Hardware interfaces, multiplexers, concentrators and buffers. Communication media, Fiber optics.

CSE 313 OPERATING SYSTEM3 hours per week, 3 Cr.

16

Principles of operating systems; design objectives; sequential processes, concurrent processes, concurrency, functional mutual exclusion, processor cooperation and deadlocks, process management. Control and scheduling of large information processing systems. Resource allocation, dispatching, processor access methods, job control languages. Memory management, memory addressing, paging and store multiplexing. Multiprocessing and time sharing, bath processing Scheduling algorithms, file systems, protection and security; design and implementation methodology, performance evaluation and case studies.

CSE 314 OPERATING SYSTEM LAB3 hours in alternative week, 0.75 Cr.


CSE 315 COMPUTER INTERFACING3 hours per week, 3 Cr.

Interface components and their characteristics, microprocessor I/O. Disks, Drums and Printer’s. Optical displays and sensors. High power interface devices, transducers, stepper motors and peripheral devices.

CSE 316 COMPUTER INTERFACING LAB3 hours per week, 1.5 Cr.


CSE 319 INFORMATION SYSTEM DESIGN3 hours per week, 3 Cr.

Information, general concepts of formal information systems, analysis of information requirements for modern organizations. Modern data processing technology and its application, information system structures, designing information outputs, classifying and coding data, physical storage media considerations, logical data organization, systems analysis, general systems design, detail systems design. Project management and documentation. Group development of an information system project. (Includes all phases of software life cycles from requirement analysis to implementation.)

CSE 320 INFORMATION SYSTEM DESIGN LAB3 hours per week, 1.5 Cr.


CSE 321 INTRODUCTION TO THEORETICAL COMPUTER SCIENCE3 hours per week, 3 Cr.

Introduction to Formal language theory and automata. Turing machines, decidability/ undecidability, recursive function theory, introduction to complexity theory.

YEAR – 4, SEMESTER- 1

CSE 400 PROJECT AND THESIS6 hours per week, 3 Cr.

17

Study of problems in the field of Computer Science and Engineering.

CSE 401 COMPUTER NETWORKS3 hours per week, 3 Cr.

Network architecture- layered architectures and ISO reference model: data link protocols, error control, HDLC, X.25, flow and congestion control, virtual terminal protocol, data security. Local area networks, satellite networks, packed radio networks. Introduction to ARPANET, SNA and DECNET. Topological design and queuing models for network and distributed computing systems.

CSE 402 COMPUTER NETWORKS LAB3 hours per week, 1.5 Cr.


CSE 403 COMPUTER GRAPHICS 3 hours per week, 3 Cr.

Introduction to Graphical data processing. Fundamentals of interactive graphics programming. Architecture of display devices and connectivity to a computer. Implementation of graphics concepts of two dimensional and three-dimensional viewing, clipping and transformations. Hidden line algorithms. Rasher graphics concepts: Architecture, algorithms and other image synthesis methods. Design of interactive graphic conversations.

CSE 404 COMPUTER GRAPHICS LAB3 hours in alternative week, 0.75 Cr.


CSE 405 SOFTWARE ENGINEERING3 hours per week, 3 Cr.

Concepts of software engineering: requirements definition, modularity, structured design, data specification, functional specification, verification, documentation and software maintenance. Software support tools. Software project organization, quality assurance management and communication skills.

CSE 439 ADVANCED DATABASE MANAGEMENT3 hours per week, 3 Cr.

Introduction to Distributed Database, Distributed Database Design, Levels of distributed transparency, Management of transaction, Concurrency control, Reliability, Translation of global queries into fragment Queries, Optimization of Access Strategies, A system for Distributed Databases (SDD-1).

.CSE 440 ADVANCED DATABASE MANAGEMENT LAB3 hours per week, 1.5 Cr.


18


CSE 400 PROJECT AND THESIS6 hours per week, 3 Cr.

Study of problems in the field of Computer Science and Engineering.

CSE 407 ARTIFICIAL INTELLIGENCE3 hours per week, 3 Cr.

Survey of concepts in artificial intelligence. Knowledge representation, search and control techniques. AI machines and features of LISP and PROLOG languages. Problems representation; Search, inference and learning in intelligent systems; Systems for general problems solving, game playing, expert consultation, concept formation and natural language processing: recognition, understanding and translation. Some expert systems.

CSE 408 ARTIFICIAL INTELLIGENCE LAB3 hours per week, 1.5 Cr.


CSE 409 PROFESSIONALISM IN COMPUTING3 hours per week, 1.5 Cr.

Application of the digital computer to the analysis and synthesis of physical, social, cultural, economic and environmental processes and systems. History of computing and effects of computers on society. Study of practical problems emphasizing research and investigation.

OPTIONS AVAILABLE

CSE 413 PATTERN RECOGNITION3 hours per week, 3 Cr.

Introduction to pattern recognition: Features, classification, learning. Statistical methods, structural methods and hybrid methods; Applications to speech recognition, remote sensing and biomedical area. Learning algorithms. Syntactic approach: Introduction to pattern grammars and languages. Parsing techniques. Pattern recognition in computer aided design.

CSE 414 PATTERN RECOGNITION LAB3 hours in alternative week, 0.75 Cr.


CSE 423 FAULT TOLERANT SYSTEMS3 hours per week, 3 Cr.

19

Introduction to Fault Tolerant Systems and Architectures. Fault detection and location in combinational and sequential circuits. Fault test generation for combinational and sequential circuits. Digital simulation as a diagnostic tool.

Automatic test pattern generator, Fault modeling, automatic test equipment, Faults in memory, memory test pattern and reliability. performance monitoring self circuits, Burst error correction and Triple modular redundancy, Maintenance processors.

CSE 424 FAULT TOLERANT SYSTEMS LAB3 hours in alternative week, 0.75 Cr.


CSE 425 NETWORK PROGRAMMING3 hours per week, 3 Cr.

Overview of UNIX networking tools. Details of the different Internetwork-Process Communication (IPC) facilities under UNIX to develop distributed applications. IPC user interfaces: pipes shared memory, message queues, semaphores, sockets, system V Transport Layer Interface (TLI) and Remote Procedure Calls (RPC). Network protocols supported under the UNIX environment: TCP/IP, XNS, SNA, and Net BIOS.

CSE 426 NETWORK PROGRAMMING LAB.3 hours in alternative week, 0.75 Cr.


CSE 411 SIMULATION AND MODELING3 hours per week, 3 Cr.

Simulation methods, model building, random number generator, statistical analysis of results, validation and verification techniques. Digital simulation of continuous systems. Simulation and analytical methods for analysis of computer systems and practical problems in business and practices. Introduction to simulation packages.

CSE 412 SIMULATION AND MODELING LAB3 hours in alternative week, 0.75 Cr.


CSE 427 DIGITAL IMAGE PROCESSING3 hours per week, 3 Cr.

Digital image representation and acquisition; Fourier, Cosine, Walsh and wavelet transforms: linear and nonlinear filtering: image enhancement; morphological filtering.

CSE 428 DIGITAL IMAGE PROCESSING LAB

20

3 hours in alternative week, 0.75 Cr.


CSE 429 COMPILER CONSTRUCTION 3 hours per week, 3 Cr.

The grammar of programming languages, lexical analyzers, code emitters and interpreters. Code optimization: run time support, error management, translator writing systems. A small project.

CSE 430 COMPILER CONSTRUCTION LAB.3 hours in alternative week, 0.75 Cr.


CSE 415 COMPUTER ARCHITECTURE-II3 hours per week, 3 Cr.

Pipelined machines, interleaved memory system, caches. Hardware and architectural issues of parallel machines. Array processors, associative processors, multiprocessors, systolic processors, dataflow computers and interconnection networks. High-level language concept of computer architecture.

CSE 417 VLSI DESIGN3 hours per week, 3 Cr.

Design and analysis techniques for VLSI circuits. Design of reliable VLSI circuits, noise considerations, design and operation of large fan out and fan in circuits, clocking methodologies, techniques for data path and data control design. Simulation techniques. Parallel processing special purpose architectures in VLSI. VLSI layout partitioning, placement routing and wiring in VLSI. Reliability aspects of VLSI design.

CSE 419 COMPUTER SYSTEM PERFORMANCE 3 hours per week, 3 Cr.

Review of system analysis, approaches to system development. Feasibility assessment. Hardware and software acquisition. Procurement workload characterization. Representation of measurement data, instrumentation : software monitors, hardware monitors, capacity planning, bottleneck detection, system and program tuning, simulation and analytical models and their application, case studies.

CSE 433 ADVANCED MICROPROCESSOR ARCHITECTURE3 hours per week, 3 Cr.

A survey of advanced microprocessors : Intel 80X86, Motorola 6800, RISC processors, SPARC, MIPS. Special and advanced features of microprocessor architectures.

21

DETAILED OUTLINE OF NON-DEPARTMENTAL COURSES FOR CSE PROGRAM:

YEAR-1, SEMESTER-1

PHY 105 PHYSICS (HEAT & THERMODYNAMICS, STRUCTURE OF MATTER, WAVES & OSCILLATIONS AND PHYSICAL OPTICS)

4 hours per week, 4 Cr.

Electricity and Magnetism: Static electricity: Charge, Electric field, Electric dipole, Dipole in an electric field, Calculation of electric field from electric dipole. Gauss’s theorem and its application. Current: Current and current density, Drift speed, EMF, RC circuit. Electromagnetism: Ampere’s law, Faraday’s law, Biot-Savart law, Inductance, Calculation of inductance (LR circuit). Magnetism: Intensity of magnetism, Permeability, Susceptibility, Paramagnetic, Diamagnetic and Ferromagnetic substances. States of Matter: Solid, Liquid and Gas, different types of bonds, Inter-atomic force, Conductor, Insulator and semiconductor, Properties of semiconductor, Bands in semiconductor, Energy band description of semiconductor, effect of temperature on semiconductor, P-type and N-type semiconductor, P-N junction.

Structure of Matter: States of Matter: solid, liquid and gas. Classification of solids: amorphous, crystalline, ceramics & polymers. Atomic arrangement in solids, interatomic distances and forces of equilibrium, x-ray diffraction, Bragg's law. Plasticity and elasticity. Distinction between metal, insulator and semi-conductor.

Waves & Oscillations: Oscillations: Simple harmonic motion, damped harmonic oscillations, forced oscillations, resonance vibrations of membranes & columns. Combination & composition of simple harmonic motions, Lissajous' figures. Transverse and longitudinal nature of waves, travelling & standing waves, intensity of wave, energy calculation of progressive & stationary waves, phase velocity, group velocity. Sound waves: velocity of longitudinal wave in a gaseous medium. Doppler effect. Architectural acoustics: Sabine's formula, requisites of a good auditorium.

Physical Optics: Theories of light: Huygen's principles and constructions. Interference of light. Young's double slit experiment, Fresnel bi-prism. Newton's ring, interferometers.Fresnel and Fraunhoffer diffraction, diffraction by single slit, diffraction by double slit, diffraction gratings, polarization, production and analysis of polarized light, optical activity, optics of crystals.

PHY 106 : PHYSICS LAB3 hours per week, 1.5 Cr.

Laboratory works based on PHY 105.

CHEM 105 : CHEMISTRY3 hours per week, 3 Cr.

Atomic structure, quantum numbers, electronic configuration, periodic table. Properties and uses of noble gases. Different types of chemical bonds and their properties. Molecular structure of compounds. Selective organic reactions. Different types of solutions and their compositions. Phase rule, phase diagram of monocomponent system. Properties of dilute solutions. Thermochemistry, chemical kinetics, chemical equilibria. Ionization of water and pH concept. Electrical properties of solution.

22

MATH 105: MATHEMATICS-I (DIFFERENTIAL CALCULUS & CO-ORDINATE GEOMETRY)


Differential Calculus :Limit, Continuity and differentiability, Successive differentiation of various types of function. Liebnitz's theorem. Rolle's theorem, Mean value theorem. Taylor's theorem in finite and infinite forms. Maclaurine's form of remainder's. Expansion of function. Evaluation of indeterminate forms by L'Hospitals rule. Partial differentiation. Euler's theorem. Tangent & Normal. Subtangent and subnormal in Cartesian and polar co-ordinates. Determination of maximum and minimum values of functions and points of inflection. Applications. Curvature. Radius of Curvature, Center of curvature.

Co-ordinate Geometry : Change of Axes: Transformation of co-ordinate Simplification of commissions of curves.

Pair of straight lines: Conditions under which general equations of the second degree may represent a pair of straight lines. Homogeneous equations of second degree. Angle between the pair of lines. Pair of lines joining the origin to the point of intersection of two given curves.

System of circles: orthogonal circles. Radical axes. Radical center, properties of radical axes. Coaxial circles and limiting points, equation of ellipse and hyperbola in Cartesian and polar co-ordinates. Tangent and normal. Pair of tangent. Chord of contact. Chord in terms of its middle points, parametric co-ordinates. Diameters. Conjugate diameters and their properties. Director circles and asymptotes.

YEAR-1, SEMESTER-2

HUM 101 : ENGLISH & ECONOMICS4 hours per week, 4 Cr.

English :Phonetics: manners of articulation of the English words. Vocabulary. English grammar. Constructions of sentences. Grammatical problems. Comprehension, Paragraph writing, Essay writing, Amplification, Report writing, Commercial correspondence and tenders. Short stories written by some well-known classic writers.

Economics:

Definition of Economics. Economics and Engineering.

Principles of Economics:

Micro-economics: The theory of demand and supply and their elasticities. Price determination. Nature of an economics theory, applicability of economic theories to the problems of developing countries. Indifference curve technique. Marginal analysis. Production, production function, types of productivity. Rational region of production of an engineering firm. Concepts of market and market structure. Cost analysis and cost function. Small scale production and large scale production. Optimization, Theory of distribution.

Macro-economics: Savings, investment, employment. National income analysis. Inflation. Monetary policy, Fiscal policy and trade policy with reference to Bangladesh. Economics of development and planning.

23

EEE 107 : BASIC ELECTRICAL ENGINEERING4 hours per week, 4 Cr.

Fundamental electrical concepts and measuring units. D.C voltage, current, resistance and power; Laws of electrical circuits and methods of network analysis; Principles of D.C measuring apparatus; Laws of magnetic fields and methods of solving simple magnetic circuits. Alternating current-instantaneous and r.m.s. current, voltage and power, average power for various combinations of R, L and C circuits; Phasors representation of sinusoidal quantities.

EEE 108 : BASIC ELECTRICAL ENGINEERING LAB3 hours per week, 1.5 Cr.

Laboratory works based on EEE 107.

MATH 109 : MATHEMATICS-II (INTEGRAL CALCULUS & ORDINARY DIFFERENTIAL EQUATIONS)


Integral Calculus : Definitions of integration. Integration by the method of substitution. Integration by parts. Standard integrals. Integration by the methods of successive reduction. Definite integrals, its properties and use in summing series. Walli's formula, improper integrals, Beta function and Gamma function. Area under a plane curve in Cartesian and polar Co-ordinates. Trapezoidal rule. Simpson's rules. Parametric and pedal equations Intrinsic equation. Volumes of solids of revolution. Area of surface of revolution.

Ordinary Differential Equations :Degree and order of ordinary differential equation. Formation of differential equations. Solutions of first order differential equations by various methods. Solutions of general linear equations of second and higher order with constant co-efficient. Solution of homogeneous linear equations. Applications. Solution of differential equations of the higher order when the dependent and independent variables are absent. Solution of differential equation by the method based on the factorization of the operations.

ME 104: ENGINEERING DRAWING 3 hours in alternative week, 0.75 Cr.

Introduction : Instrument and their uses, first and third angel projections; Orthographic drawings; Isometric views; Mission lines & views; Sectional views and conventional practices. Auxiliary views.

24

YEAR-2, SEMESTER-1

EEE 211 : ELECTRONIC DEVICES AND CIRCUITS4 hours per week, 4 Cr.

Semiconductors: Junction diode characteristics; Operation and small signal models of diodes. Circuit application of diodes. Bipolar transistor: characteristics, BJT biasing and thermal stabilization; CE, CB, CC configurations, small signal low frequency h-parameter model, hybrid-pi model. Amplifiers: voltage and current amplifiers. Operational amplifiers. Oscillators. Differential input and outpour impedance, off-set null adjustments, frequency response and noise. Introduction to JEET, MOSFET, PMOS, NMOS and CMOS : biasing and application in switching circuits. Silicon controlled rectifier (SCR), TRIAC, DIAC, UJT : characteristics and application. Introduction to rectifiers, active filters, regulated power supply. Introduction to IC fabrication techniques.

EEE 212 : ELECTRONIC DEVICES AND CIRCUITS LAB3 hours per week, 1.5 Cr.


MATH 201 : MATHEMATICS-III(COMPLEX VARIABLE, LAPLACE TRANSFORMS AND STATISTICS)4 hours per week, 4 Cr.

Complex Variable :Complex number system. General functions of a complex variable. limits and continuity of a function of complex variable and related theorems. Complex differentiation and the Cauchy-Riemann equations. Mapping by elementary functions. Line integral of a complex functions. Cauchy's integral theorem. Cauchy's integral formula. Liouville's theorem. Taylor's and Lament's theorem. Singular points. Residue. Cauchy's residue theorem. Evaluation of residues. Contour integration. Conformal mapping.

Laplace transforms:Definition. Laplace transforms of some elementary functions. Sufficient conditions for existence of Laplace transforms. Inverse Laplace transforms. Laplace transforms of derivatives. The unit step function. Periodic function. Some special equations by Laplace transforms. Evaluation of improper integrals.

Statistics :Frequency distribution. Mean, median, mode and other measures of central tendency. Standard deviation and other measures of dispersion. Moments, skewness and kurtosis. Elementary probability theory and discontinuous probability distribution, e.g. binomial, poison and negative binomial. Continuous probability distributions, e.g. normal and exponential. Characteristics distributions. Hypothesis testing and regression analysis.

25

YEAR-2, SEMESTER-2

EEE 209: ELECTRICAL DRIVES AND INSTRUMENTATION4 hours per week, 4 Cr.

Introduction to three phase circuits, alternators and transformers, principles of operation of DC, synchronous induction, universal, and stepper motors. Thyristor and microprocessor based speed control of motors.

Instrumentation amplifiers: differential, logarithmic and chopper amplifiers. Frequency and voltage measurements using digital techniques. Recorders and display devices, spectrum analyzers and logic analyzers. Data acquisition and interfacing to microprocessor base systems. Transducers: terminology, types, principles and application of photovoltaic, piezoelectric, thermoelectric, variable reactance and opto-electronic transducers. Noise reduction in instrumentation.

EEE 210 : ELECTRICAL DRIVES AND INSTRUMENTATION LAB3 hours per week, 1.5 Cr.


MATH203: MATHEMATICS-IV (MATRICES, VECTORS AND FOURIER ANALYSIS)3 hours per week, 3 Cr.

Matrices: Definition of matrix, Different types of matrices. Algebra of matrices. Adjoint and inverse of a matrix. Rank and elementary transformations of matrices. Normal and canonical forms. Solution of linear equations. Matrix polynomials. Eigenvalues and eigenvectors.

Vectors :Scalars and vectors, equality of vectors. Addition and subtraction of vectors. Multiplication of vectors by scalars. Scalar and vector product of two vectors and their geometrical interpretation. Triple products and multiple products. linear dependence and independence of vectors, Differentiation and integration of vectors together with elementary applications. Differentiation line, surface and volume integrals. Gradient, divergence and curl of point functions. Various formulae. Gauss's theorem, Stroke's theorem, Green's theorem.

Fourier Analysis :Real and complex form Finite transform. Fourier integral. Fourier transforms and their uses in solving boundary value problems.

YEAR –3, SEMESTER- 1

HUM 201 : ACCOUNTING & SOCIOLOGY4 hours per week, 4 Cr.

Accounting :

Principles of accounting: accounts, transactions, the accounting procedures and financial elements. Cost in general: objectives and classifications. Overhead costing. Cost sheet under job costing. Operating costing and process costing. Marginal costing: tools and techniques, cost-volume-profit analysis, Relevant costing:

26

analyzing the profitability within the firm, guidelines for dicision making. Long-run Planning and control: capital budgeting.Sociology : Scope : Some basic concepts. 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.


HUM 301: INDUSTRIAL MANAGEMENT 3 hours per week, 3 Cr.

Introduction: evolution, management function, organization and environment. Organization: theory and structure, coordination, span of control, authority delegation, groups, committee and task force, manpower planning.

Personnel management: scope, importance, need hierarchy, motivation, job redesign, leadership, participative management, training, performance appraisal, wages & incentives, informal groups, organizational change and conflict.

Cost & financial management: Elements of costs and products depreciation, break-even analysis, investment analysis, benefit cost analysis.

Management accounting: Cost planning and control, budget & budgetary control, development planning process.

Marketing management : management of innovation and changes, technology life cycle, case studies.


HUM 437 : BUSINESS LAW (optional)3 hours per week, 3 Cr.

Some basic concepts of government and politics. Functions, organs and forms of modern state and government; Socialism, Fascism, Marxism, U.N.O. Government and politics of Bangladesh. Some major administrative systems of developed countries. Local self-government.

Principles of law of contract. Company law: law regarding formation, incorporation, management and winding up of companies. Labor law: law in relation to wages hours, health, safety and other condition to work. The trade union legislation arbitration. The policy of the state in relation to labor. The Factory Act (1965). Law of compensation (1965).

27

are you suprised - ahsanullah university of science and ... · web viewexperiments based on dos,...

Documents