MCA First Semester 2019-2020

DEPARTMENT OF COMPUTER SCIENCE

MANIPUR UNIVERSITY

MCA First Semester Syllabus

Paper Code Title Hour & Credit Full Mark

L-T-P Total Internal Externa
H/W Credits l
MCA-101B Mathematical Foundation of Computer Science 3-1-0 4 25 75
MCA-102B Computer Programming and problem solving in C 3-1-0 4 25 75
MCA-103B Computer Organization & Architecture 3-1-0 4 25 75
MCA-104B UNIX & Shell Programming 3-1-0 4 25 75
MCA-105B Fundamentals of Web Technologies 3-1-0 4 25 75
MCA-106B Programming Lab I 0-1-6 4 25 75
Semester Total 600

NB : Minimum Credit required : 4

Total Hours : 4(L/T)×4(weeks)×4(months)=64 Hrs
30 Hrs of Practical =1 Credit
15 Hrs of Lecture/Tutorial=1 Credit
 MCA First Semester 2019-2020

Subject : Mathematical Foundation of Computer Science

Subject Code : MCA-101B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour
Unit -I :Set Theory:- 6+2=8 Hours
Sets and Subsets, set operations and the laws of Set theory, counting and Venn diagrams,
cardinality-countable and uncountable sets.
Unit -II :Relations and Functions :- 7+2=9 Hours
Cartesian products and relations. Computer representation of relations -diagraphs, Hasse diagrams,
zero-one matrices . Partial orders, equivalence relation and partitions. Functions-injective,
surjective, bijective. The Pigeon-hole principle, composition of functions and inverse functions.
Unit -III :Fundamentals of Logic :- 7+2=9 Hours
Basic connectives and Truth tables, Logic equivalence- The laws of logic, Logical implication-
Rules of inference, Predicate Calculus; Predicate and Quantifiers. Definitions and Proofs of
Theorems.
Unit -IV :Properties of integers:- 6+2=8 Hours
Mathematical Induction, Well ordering principle-Mathematical induction, Recursive definitions.
Unit -V :Algebraic Structures, Codding theory and Rings :- 8+2=10 Hours
Groups, Subgroups, Monoids, Submonoids, Normal subgroups, Homomorphisms, Isomorphism
and Cyclic groups.
Elements of coding theory, the Hamming metric, the parity check and generator matrices.
Unit -VI : Lattices and Boolean Algebra :- 7+3=10 Hours
Lattice and its properties, Axiomatic definition of Boolean Algebra as algebraic structure ; Duality ;
Basic results; Boolean Algebra of truth values; Applications (switching circuits, decision tables).
Unit-VII 7+3=10 Hours
Matrices and system of linear equations, operation of matrices; Solution of system of linear
equations using matrix method. Eigen values, eigen vectors, diagonalisation of matrices.
Text Book
1. Ralph P Grimaldi, “Discrete & Combinatorial Mathematics,” 5th Edition, Pearson
Education, 2004.
Reference Books
1. Alan Doerr, Kenneth Levasseur : “Applied Discrete Structures for Computer Science”,
Galgotia Publications Pvt. Ltd.
2. Kenneth H Rosen, “Discrete Mathematics & its Applications," 7th edition, McGraw-Hill,
2010
 MCA First Semester 2019-2020

Subject : Computer Programming and problem solving in C

Subject Code : MCA-102B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour
Unit -I: Overview :- 7+2=9 Hours
Algorithms, Flow Charts, Variables, Data types, Constants, Declarations, Operators, Precedence,
Associativity, Order of evaluation, Type conversion, Storage classes, Programming Examples
Unit -II :Input and output statements:- 7+2=9 Hours
scanf, getchar, gets, printf, putchar, puts; Control Statements – if, else-if, switch, Control Structures
– while, for, do-while, break and continue, goto, Programming Examples
Unit -III :Arrays:- 7+2=9 Hours
Single dimension, Two dimensional, Multi dimensional Arrays, Strings, Programming Examples
Unit -IV :Functions:- 7+3=10 Hours
Categories of functions, Pointers, Pointer arithmetic, Call by value, Pointer Expression, Pointer as
function arguments, , recursion, Passing arrays to functions, passing strings to functions, Call by
reference, Functions returning pointers, Pointers to functions, Programming Examples
Unit -V :Structures and Unions:- 7+2=9 Hours
defining, declaring, initialization, accessing, comparing, operations on individual members; array
of structures, structures within structures, structures and functions, pointers and structures, bit
fields, Programming Examples
Unit -VI:Files:- 6+3=9 Hours
defining, opening, closing, input and output operations, error handling, random access; Command
line arguments;
Unit -VII:Dynamic Memory Allocation:- 7+2=9 Hours
definition, malloc, calloc, realloc, free, dynamic arrays
Preprocessor – definition, macro substitution, file inclusion, compiler control directives,
Programming Examples
Text Books
1. Programming in ANSI C, Balaguruswamy, Tata McGraw-Hill, 6th Edn.
2. The C Programming Language, Brian W Kernighan, Dennis M Rtchie, PHI, 2nd Edn.
Reference Books
1. Programming with C, Byron Gottfried, Tata McGraw-Hill edition
2. Simplifying C, Harshal Arolkar, Sonal Jain, Wiley Publications
3. Head First C, David Griffiths, & Dawn Griffiths, O’Riley.
4. C Programming, Dr. Vishal M Lichade, Dreamtech press. 2nd Edn.
 MCA First Semester 2019-2020

Subject : Computer Organization & Architecture

Subject Code : MCA-103B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour

Unit-I :Number System:- 7+3=10 Hours

Binary, Octal and Hexadecimal. Positive and negative numbers; Fixed point and floating point
quantities.
Arithmetic operations: Addition, subtraction etc.
Character Code: ASCII, EBCDIC and Unicode.
Redundant coding for error detection and correction: Concept of Hamming distance, parity
codes, Hamming codes, block codes, Cyclic redundancy codes.
Unit-II :Boolean Algebra:- 7+2=9 Hours
Boolean variables and functions-canonical and standard forms, truth table, minimisation of boolean
function.
Unit-III: Karnaugh map:- 7+2=9 Hours
Simplification of Boolean function using Karnaugh map – octet, quad, pair mappings; with two,
three, and four variable functions; using don't care functions.
Unit-IV :Combinational logic circuits:- 7+2=9 Hours
AND, OR, NOT, NAND, NOR, X-OR gates and tri-state buffer; implementation of Boolean
functions using logic gates; Multiplexers, decoders, encoders, simple arithmetic and logic circuits.
Unit-V: Sequential Circuits:- 7+2=9 Hours
filp-flops, triggering of flip-flops, registers, shift registers and counters (asynchronous and
synchronous).
Unit-VI :Semiconductor memory:- 7+2=9 Hours
RAM, ROM; magnetic core and surface memory- disk, drum, tape; Solid state disk, Flash memory;
Access time and cost considerations; concepts of volatility, random access, serial access, direct
access, online and backup storage.
Unit-VII : CPU Block Diagram:- 6+3=9 Hours
Simple functional block diagram of a CPU with its relevant units. Generations of digital computers.

Reference Books:
1. Mano, M.M.: “Digital Logic and Computer Design”, Pearson, 2004.
2. Rajaraman, V., Radhakrishan: “ An Introduction to Digital Computer Design,” 4th edition,
PHI(EEE).
 MCA First Semester 2019-2020

3. Mano, M.M.: “Computer System Architecture,” 3rd edition, Pearson.

4. Hamacher, Vranesic, Zaky, “Computer Organization”, 5th Tata McGraw-Hill.
5. Albert Paul Malvino & Jerald Brown: “Digital Computer Electronics,” 3rd edition, McGraw-
Hill.
 MCA First Semester 2019-2020

Subject : UNIX & Shell Programming

Subject Code : MCA-104B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour

Unit-I: Introduction to UNIX :- 7+3=10 Hours

Introduction, History, Architecture, Experience the Unix environment, Basic commands ls, cat, cal,
date, calendar, who, printf, tty, stty, uname, passwd, echo, tput, bc, script, spell and ispell, UNIX
File System: The file, what’s in a filename? The parent-child relationship, pwd, the Home directory,
absolute pathnames, using absolute pathnames for a command, cd, mkdir, rmdir, Relative
pathnames, The UNIX file system.
Unit -II :Introduction to the Shell:- 7+2=9 Hours
Introduction to Shell Scripting, Shell Scripts, read, Command Line Arguments, Exit Status of a
Command, The Logical Operators && and ||, exit, if, and case conditions, expr, sleep and wait,
while, until, for, $, @, redirection. The here document, set, trap, Sample Validation and Data Entry
Scripts.
Unit –III: Basic File Attributes:- 6+3=9 Hours
Is – l, the –d option, File Permissions, chmod, Security and File Permission, users and groups,
security level, changing permission, user masks, changing ownership and group, File Attributes,
More file attributes: hard link, symbolic link, umask, find
Unit -IV :Simple Filters:- 7+2=9 Hours
Pr, head, tail, cut, paste, sort, uniq, tr commands, Filters using Regular Expression : grep & sedgrep,
Regular Expression, egrep, fgrep, sed instruction, Line Addressing, Inserting and Changing Text,
Context addressing, writing selected lines to a file, the –f option, Substitution, Prosperities of
Regular Expressions Context addressing, writing selected lines to a file, the –f option, Substitution,
Properties of Regular Expressions
Unit –V : Awk-Advanced Filters:- 7+2=9 Hours
Simple awk Filtering, Splitting a Line into Fields, printf, the Logical and Relational Operators,
Number Processing, Variables, The –f option, BEGIN and END positional Parameters, get line,
Built-in variables, Arrays, Functions, Interface with the Shell, Control Flow, Advanced Shell
Programming, The sh command, export, cd, the Command, expr, Conditional Parameter
Substitution, Merging Streams, Shell Functions, eval, Exec Statement
Unit -VI :The Process:- 7+2=9 Hours
Process basics, PS, internal and external commands, running jobs in background, nice, at and batch,
cron, time commands, cpio, tar, Customizing the Environment : System Variables, profile, sty,
PWD, Aliases, Command History, On-line Command Editing
 MCA First Semester 2019-2020

Unit -VII :System Administration :- 7+2=9 Hours

Essential System Administration root, administrator’s privileges, startup & shutdown, managing
disk space, Maintaining security, partition and file systems, fdisk, mkfs, mounting and unmounting
file systems, fsck, init, sync.

Text Book:
1. Unix Concepts and applications, 4th edition, Sumitabha Das, Tata McGraw Hill,
Reference Book:
1. “Unix Shell Programming”, Yashwant Kanetkar,
2. “Beginning Shell Scripting”, Eric Foster -Johnson, John C Welch, Micah Anderson, Wrox
publication.
3. “Introduction to UNIX” by M G Venkatesh Murthy.
4. Your UNIX-The Ultimate Guide, Sumitabha Das, Tata McGraw Hill,
 MCA First Semester 2019-2020

Subject : Fundamentals of Web Technologies

Subject Code : MCA-105B
Credit : 4 Class Hour : (L-3+ T-1+ P-0=4)/ week
Lecture Hours (L) : 48 Tutorial Hour (T) : 16
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 03
Unit L+T Hour

Unit - I :Fundamentals:- 6 +3=9 hours

Internet, WWW, Web browsers and Web servers, URLs, MIME, HTTP, Security, Cyber laws.
Web Foundations:Evolution of the Web, Peek into the History of the Web, Internet Applications,
Networks, TCP/IP, Higher Level Protocols, Important Components of the Web, Web search
Engines, Application Servers.

Unit -II :Introduction to XHTM:- 7+2=9 hours

Basic Syntax, Standard structure, Elements, Attributes, Images, Hypertext Links, Lists, Tables,
Forms, Frames, Iframes, Symbols

Unit - III :Cascading Style sheets:- 7+2=9 hours

Introduction, Levels of style sheets, Style specification formats, Selector forms, Property value
forms, Font properties, List properties, Color, Alignment of text, The box model, Background
images, The <span> and <div> tags, Conflict resolution.

Unit -IV :The Basics of JavaScript:- 7+2=9 hours

Overview of JavaScript, Object orientation and JavaScript, Syntactic characteristics, Primitives,
operations and expressions, Screen output and keyboard input, Control statements, Object creation
and modification, Arrays, Functions, Constructors, Pattern matching using regular expressions,
Errors in scripts, Examples.

Unit -V :JavaScript and HTML Documents:- 7+2=9 hours

The JavaScript execution environment, The Document Object Model (DOM), Elements access in
JavaScript, Events and Event handling, Handling events from body elements, handling Event from
Text Box and password elements, the DOM2 event model, the navigator object, DOM tree traversal
and modification.

Unit -VI :Dynamic Documents with JavaScript:- 7+3=10 hours

Introduction, Positioning Elements, Moving Elements, Elements visibility, changing colors and
fonts, dynamic content, stacking Elements, locating the mouse cursor, reacting to a mouse click,
slow movement of elements, dragging and dropping Elements.
 MCA First Semester 2019-2020

Unit -VII: Introduction to XM:- 7+2=9 hours

Introduction, Syntax, Document structure, Document type definitions, Namespaces, XML schemas,
displaying raw XML documents, displaying XML documents with CSS, XSLT style sheets, XML
processors, Web services.,

TEXT BOOK
1. Robert. W. Sebesta, "Programming the World Wide Web”, Pearson Education (VTU 4th
Edn.).
2. M. Srinivasan: Web Technology Theory and Practice, Pearson Education,

REFERENCES
1. Jeffrey C. Jackson, "Web Technologies--A Computer Science Perspective", Pearson
Education.
Chris Bates: Web Programming Building Internet Applications, Wiley India.Internet Technology
and Web Design, Instructional Software Research and Development (ISRD) Group, Tata McGraw
Hill.

Subject : Programming Lab I

Subject Code : MCA-106B
Credit : 4 Class Hour : (L-0+ T-1+ P-6=7)/ week
Tutorial Hours (T) : 16 Practical Hour (P) : 96
Exam Marks: 75 I.A. Marks : 25
Exam Hours: 04
Unit T+P Hour

1. Problems are based on MCA-102B as Group A 8+48=56 Hours

2. MCA-104B & MCA-105B as Group B. 8+48=56 Hours
In the examination each student should perform two experiments; one from each group.
Selection should be on lottery basis.