Go Back   2019-2020-2021 StudyChaCha > StudyChaCha Discussion Forum > General Topics




  #2  
Old June 2nd, 2014, 05:35 PM
Sashwat's Avatar
Super Moderator
 
Join Date: Jun 2011
Default Re: BCA Course Gauhati University

The Gauhati University was established in 1948.

The Gauhati University is approved by UGC.

It offers several courses.

Here you are looking for admission in BCA at Gauhati University , so I am providing following information about BCA Program:

Eligibility Criteria for BCA
Students must pass in 12th Class from any recognized Board.

Duration: 3 Years

Gauhati University BCA Syllabus

SEMESTER I
1.1. Introduction to Computer Fundamentals and Programming.(5-1-0-6)
1.2. Communicative English.(4-2-0-6)
1.3. Basic Electronics (5-1-0-6)
1.4. Mathematics – I (5-1-0-6)
1.5. Laboratory (0-0-6-6)
1.6. Bridge course (for students coming from other than the Science
stream)

SEMESTER II
2.1. Data Structure and Algorithm (5-1-0-6)
2.2. Computer Based Accounting and Financial Management. (5-1-0-6)
2.3. Mathematics – II (5-1-0-6)
2.4. ICT Hardware (4-2-0-6)
2.5. Laboratory (0-0-6-6)
2.6. Environmental Studies

SEMESTER III
3.1. Operating System (5-1-0-6)
3.2. Computer Organization and Architecture. (5-1-0-6)
3.3. Database Management System. (5-1-0-6)
3.4. Object Oriented Programming (5-1-0-6)
3.5. Laboratory (0-0-6-6)

SEMESTER IV
4.1. Microprocessor and Assembly Language Programming. (5-1-0-6)
4.2. Software Engineering (5-1-0-6)
4.3. Programming in Java (5-1-0-6)
4.4. Automata Theory and Languages (5-1-0-6)
4.5. Laboratory (0-0-6-6)
SEMESTER V
5.1. Management Information System (5-1-0-6)
5.2. Web Technology (5-1-0-6)
5.3. Computer Networks. (5-1-0-6)
5.4. Computer Oriented Numerical Methods and Statistical techniques
(5-1-0-6)
5.5. Laboratory ((0-0-6-6)
SEMESTER VI
6.1. Elective – I
6.2. Elective – II
6.3. System Administration using Linux (2-1-3-6)
6.4. Project Work (0-0-6-12)
Courses for Elective I
6.1.1. Queuing Theory and Optimization (5-1-0-6)
6.1.2. Data Warehousing and Data Mining (5-1-0-6)
6.1.3. GUI Programming (2-1-3-6)

Courses for Elective II
6.2.1. Computer Graphics (5-1-0-6)
6.2.2. Database Design and Programming (2-1-3-6)
6.2.3. Compiler Design (5-1-0-6)


2.2 COMPUTER BASED ACCOUNTING AND FINANCIAL MANAGEMENT
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Part : I Accounting Marks: 30
Introduction - Definition, function, objective, need, advantage, events and transaction, double entry system of book keeping.
Books of accounts - classification of books of accounts, meaning of journal, journalizing of transactions, ledger and ledger posting, closing of books of accounts and preparation of trial balance.
Cash book - single column, double column and triple column; depreciation.
Financial statements - Trading, Profit and Loss Account and Balance Sheet.

Part: II Marks: 25
1. Introduction – Versions of Tally, Features of Tally, ERP Features, Data Directory, and Tally switching between screen areas.
2. Company creation:-Create/ Alter/Select/Close/Delete.

Introduction on F11 features & F12 configuration.
3. Basic Accounting: - Accounting Info Ledger/Group (Single & Multiple) Create/Display/Alter/Delete.
4. Accounting Voucher:- Types of Voucher, Configuring Voucher, Voucher Creation, Entering/Altering & Deleting.
5. Basic of Tally Inventory:-―Integrated A/c with Inventory‖ Create/Display/Alter/(Single & Multiple) : Group, Category, Godown, Units (Simple/Compound)
6. Invoicing :-Purchase & Sales in Invoice format, Debit Credit notes/Discount/Description
7. Inventory Voucher

Part: III Marks : 25
Advance Accounting
1. Bill wise Details – Transaction wise Bill By Bill for trading & non trading organization
2. Interest Calculation – Simple & Advance parameters Interest calculation on outstanding Balances, use of vouchers class ,Adjustment entries
3. BRS- Simple & Advanced
4. Multiple Currencies – Create of different currencies, voucher entries ,Adjustment entries on forex gain / loss


5. Cost Center & Cost Categories – (By using purchase, Sales, Receipt, Payment voucher) Create / Alter / Display.
6. Advance Inventory- Actual/Different Billed Qty, O‘ Value, Batch wise, Alternate Units, BOM, Price List
7. Budget & Control – Create / Alter, Budget for group / ledger / cost Center.
8. Scenario Mgt – Create / Alter / Delete. Transactions

Printing, Housekeeping & Administration
9. Administration – Security control, Tally Audit.
10. Housekeeping – Group company, Split company Export Data, ODBC.
11. Printing – Company printing option, Setting to a Bill.

Suggested Readings:
1. K.R.Das, K.M. Sinha, K.S.Paul Choudhury, G.G.banik; Accountancy (for H.S. first year); LBS Publication.
2. B.B. Dam; Accountancy (for H.S. first year).
3. A.K.Nadhani, K.K.Nadhani; Implementing Tally - 9; BPB Publication, Delhi.
4. N. Agarwal and S. Agarwal; Comdex Tally - 9 Course Kit (with CD).
5. A.K. Nandhani; Tally - 9, Training Guide, BPB Publication.


2.3 MATHEMATICS – II
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Sets, Relations and Functions: Marks 15

Sets, relations, properties of binary relations, closures of relation, equivalence relations, equivalence classes and partitions. Partial ordering relations and lattices. Functions, one-to-one and onto, principles of mathematical induction.
Graph theory Marks 15

Basic Definition of graph. Connectivity of graph, cut points cycles, Hamiltonian graphs, trees, different characterization of trees, bipartite graph,
Algorithms on graph, Breadth first search, Depth first search
Combinatorics Marks 12

Basic of counting principles, principle of inclusion-exclusion, application of inclusion and exclusion. Pigeonhole principle, generalized Pigeonhole principle and its application, permutations and combinations, permutations with repetitions, combinations with repetitions, permutations of sets with indistinguishable objects.
Matrices : Marks 13

Row and column operations, vectors and matrices, partitioning of matrices, representing relations using matrices, Determinant of a square matrix, minor, cofactor, the Cayley-Hamilton theorem, inverse of a matrix, product form of inverse. Rank of a matrix. Solutions of simultaneous linear equations, existence of solutions, solution by Gaussian elimination, Eigen values and Eigen vectors.
Logic: Marks 15

Connectives, truth tables, Normal forms- CNF, DNF, Converting expressions to CNF and DNF, Theory of inference, Propositional calculus. Boolean Algebra. Predicate calculus (only introduction), predicates and quantifiers.
Vector Space Marks 10

Fields (definition with a few examples), definition and examples of vector spaces.. Properties of linearly independent and dependent set of vectors. Basis and dimension of a vector space. Examples of finite dimensional vector spaces Elementary properties of Rn as a vector space.

Suggested Readings:
1. Elements of Discrete Mathematics, C. L. Liu, Mc-Graw Hill International Ed.
2. Discrete Mathematics and its Applications, K. H. Rosen, Mc-Graw Hill International Ed.
3. Discrete Mathematics structures with applications to Computer Science, J. P. Tremblay and R. Manohar, Mc-Graw Hill

4. Discrete Mathematics, N. Ch.SN Iyengar, K.A. Venkatesh, V. M. Chandrasekaran,
P. S. Arunachalam, Vikash Publishing House Pvt Ltd.

2.4 ICT HARDWARE
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
UNIT I: Evolution of computer system, Modern computer, Classification of computer,Personal Computer hardware: Monitor, Keyboard, Mouse, Scanner, printer, speaker 16 marks

UNIT II: Hard Disk Drive: logical structure and file system, FAT, NTFS. Hard disk tools: Disk cleanup, error checking, de fragmentation, scanning for virus, formatting, installing additional HDD. New trends in HDD. Floppy Disk Drive 16 marks

UNIT III: Optical Media, CDROM, theory of operation, drive speed, buffer, cache, CD-r, CD-RW, DVD ROM, DVD technology, preventive maintenance for DVD and CD drives, New Technologies. Driver installation, Writing and cleaning CD and DVD. 16 marks

UNIT IV: Processor: Intel processor family. Latest trends in processor, Motherboard, Sockets and slots, power connectors. Peripheral connectors. Bus slots, USB, pin connectors. Different kinds of motherboards. RAM, different kinds of RAM. RAM up
gradation. Cache and Virtual Memory concept. 16 marks

UNIT V: SMPS. BIOS. Network Interface Card, network cabling, I/O Box, Switches, RJ 45 connectors, Patch panel, Patch cord, racks, IP address. 16 marks

BOOKS RECOMMENDED :
1. Comdex: Hardware and Networking Course Kit:: DreamTech press
2. PC hardware: A beginners Guide: Ron Gilster: Tata Mc Graw Hill.


2.5 LABORATORY
At least 15 practical assignments covering paper 2.1 (40 marks), 10 assignments covering paper 2.2 (30 marks) and 6 assignments covering paper 2.4 (30 marks) should be done by the students from the list prepared by the UG Committee of Courses and Studies in Computer Science. The assignments are to be selected in such a way that the whole course is covered.

2.6 ENVIRONMENTAL STUDIES
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Unit I: The Multidisciplinary nature of environmental studies 2 lectures
Definition, scope and importance
Need for public awareness
Unit 2: Natural Resources 8 lectures
Renewable and non-renewable resources
Natural resources and associated problems
a) Forest resources: Use and over-exploitation, deforestation, case studies. Timber extraction, mining, dams and their effects on forest and tribal people.
b) Water resources: Use and over utilization of surface and ground water, floods, drought, conflicts over water, dams-benefits and problems.
c) Mineral resources: Use and exploitation, environmental effects of extracting and using mineral resources, case studies.
d) Food resources: World food problems, changes caused by agriculture and overgrazing, effects of modern agriculture, fertilizer-pesticide problem, water logging, salinity, case studies.
e) Energy resources: Growing energy needs, renewable and nonrenewable energy sources, use of alternate energy sources, case studies.
f) Land resources: Land as a resource, land degradation, man induced landslides, soil erosion and desertification.
Role of an individual in conservation of natural resources.
Equitable use of resources for sustainable lifestyles.

Unit 3: Ecosystems 6 lectures
Concept of an ecosystem
Structure and function of and ecosystem.
Producers, consumers and decomposers
Energy flow in the system
Ecological succession
Food chains, food webs and ecological pyramids
Introduction, types, characteristic features, structure and function of the following ecosystem:-
a) forest ecosystem
b) grassland ecosystem
c) desert ecosystem
d) aquatic ecosystem(ponds, streams, lakes, rivers, oceans, estuaries)


Unit 4: Biodiversity and its Conservation 8 lectures
Introduction- definition, genetics, species and ecosystem diversities
Biogeographical classification of India
Value of biodiversity: consumptive use, productive use, social, ethical, aesthetic and option values.
Biodiversity at global, national and local level.
India as a mega-diversity nation.
Hot-spots of biodiversity
Threats to biodiversity: habitat loss, poaching of wild life, man-wild-life conflicts.
Endangered and endemic species of India.
Conservation of biodiversity: In-situ and ex-situ conservation of biodiversity

Unit 5: Environmental Pollution 8 lectures
Definition
Causes, effects and control measure of
a. air pollution
b. water pollution
c. soil pollution
d. marine pollution
e. noise pollution
f. thermal pollution
g. nuclear pollution
Solid waste management: Causes, effects and control measures of urban and industrial waste.
Role of individual in prevention of pollution
Pollution case studies
Disaster management: floods, earthquake, cyclone and landslides.

Unit 6: Social Issues and the Environment: 7 lectures
From unsustainable to sustainable development
Urban problems related to energy
Water conservation, rain water harvesting, watershed management
Resettlement and rehabilitation of people, its problem and concern, case studies.
Environmental ethics: issues and possible solutions
Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and holocaust, case studies.
Waste land reclamation
Consumerism and waste product
Environment protection acts
Air(prevention and control of pollution) acts
Wild life protection act
Forest conservation act
Issues involved in enforcement of environmental legislation, public awareness.


Unit 7: Human Population and the Environment 6 lectures
Population growth, variation among nations
Population explosion- family welfare programme
Environment and human health
Human rights
Value education
HIV/ AIDS
Women and child welfare
Role of information technology in environment and human health
Case studies

Unit 8: Field work 5 lectures
Visit to a local area to document environmental assets- river/forest/grassland/hill/mountain
Visit to a local polluted site- urban/rural/ industrial/ agricultural
Study of common plants, insects, birds
Study of simple ecosystem, ponds, river, hill slopes etc.

Recommended Readings:
(i) Environmental Studies, Anindita Basak; Pearson Education, 2009.

3.1OPERATING SYSTEM
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)

Introduction: Marks:10
What is an operating system, batch systems, multiprogrammed, time-sharing systems, personal-computer systems, parallel systems, distributed systems, real-time systems.

Processes: Marks:10
Process Concept, Thread, design issues of thread, user space thread and kernel space thread. Usage of thread. Process states, Operation on Processes:- creation and termination. Implementation of process:- process table.

Process Synchronization: Marks 10
Race condition, Critical-Section, mutual exclusion. Solution to race condition and synchronization: - disabling interrupt, test-and-set-lock, Peterson's solution, semaphore, mutex, monitor, message passing. Classical problems:- The Dining philosopher, sleeping barber and readers-and-writers (bounded buffer) problems and their solution.

Scheduling: Marks:10
Basic Concepts, preemptive and non preemptive scheduling. Scheduling Algorithms. Types of scheduling: - batch, interactive and real-time. Goals of scheduling algorithms. FCFS, SJF, RR, priority, multiple queues, three-level scheduling.

Deadlocks: Marks:10
System Model, Deadlock Characterization, Methods for Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, Recovery from Deadlock. Banker's algorithm.

Memory management: Marks:10
Multiprogramming. Address binding (relocation), and protection. Swapping. Virtual memory: - logical versus physical address space, paging, page fault, page table and its entries, demand paging, multi level page table, TLB, its entries and working. Page replacement algorithms: - LRU, optimal, NRU, FIFO, second chance, clock, NFU. Working set. What is segmentation, what are its benefits and drawbacks.

File system: Marks:10
What is file, file naming, file types(directory, regular, device), sequential access and random access files, file attributes, operations on file, hierarchical directory structure, path name(relative and absolute), operation on directories, disk layout, disk partition, file system layout, disk block allocation:-contiguous allocation linked list allocation, FAT, i-nodes, directories in UNIX, file system security

I/O management: Marks: 10
Basic principles and overall structure of I/O management subsystem, Device controllers, layers of the I/O subsystem:- interrupt handlers device driver, device independent I/O software and user space I/O software.
Suggested reading:
1. Modern Operating System, Tanenbaum, PHI Publication.
2. Operating System by Galvin, Wileys


3.2 COMPUTER ORGANIZATION AND ARCHITECTURE
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Introduction: Marks:10
Functional units of a computer, basic instructions (zero, one, two, three addresso, interconnection of functional units, bus structure, memory locations, memory addresses, memory operations, instruction and instruction sequencing (straight line sequencing and branching).
Fixed and floating point representation of numbers. Normalized floating point representation and arithmetic operations using normalized floating point numbers. IEEE standard for binary floating point representation
Addressing modes, stack, subroutine, I/O instructions.

Register Transfer Logic: Marks: 12
Introduction, interregister transfer, arithmetic microoperation, logic microoperation, shift microoperation, Conditional control statements, fixed point binary data, instruction code, design of a simple computer.

Processor Logic Design: Marks: 15
Processor organization, design of arithmetic and logic circuit, status register, design of accumulator.

Control Logic Design: Marks 15
Hardware control, microprogrammed control block disgram, symbolic microprogram, microprogrammed CPU organization.

I/O Subsystem: Marks: 13
Program controlled I/O, Interrupts: enabling and disabling interrupts, handling interrupts from multiple sources (priority control), DMA.

Memory Subsystem: Marks: 15
Semiconductor memory, SRAM, DRAM, ROM, speed size and cost, Cache memory, mapping functions.

Suggested Reading:
1. Digital logic and Computer Design, M.Morris Mano, PHI publication
2. Computer Architecture, Hamachar, Vranesic and Zaky.
3. Computer Organization and Architecture; William Stallings, Pearson.


3.3 DATABASE MANAGEMENT SYSTEM
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
File Structure: Marks: 8
Record storage and primary file organization: memory hierarchies and storage devices, Storage of DataBases, Placing file records on disks: Records and its Types, Files, Fixed length records and variable length records, Record Blocking, allocating file blocks on disks, operation on files.

Issues in Physical Design : Concept of indexes
Overview of Database Management System: Marks : 17
Definition of DataBase, Traditional File Approach vs. DBMS approach, Characteristics of the Data Base Approach, DBMS user, Role of a DBA, Advantage of using DBMS, DBMS architecture, Data independence
ANSI/SPARC 3 level architecture.

Relational Models: Marks: 25
Fundamental integrity rules: entity integrity, referential integrity, Relational algebra(Select , Project, Cross ,Product , theta join, equi join, natural join, outer join ),Set Operation
ANSI SQL –92 Standard : DDL, DML, SQL constructs(Select .. From… Where… Group by ….. Having… Order by….), Insert, Delete, Update, View, Definition and use, nested quires, Constraints considers(NOT NULL , UNIQUE, Check Primary key. Foreign key)

Database Design: Marks : 30
Conceptual model, logical model, physical model.
ER model as a tool for conceptual design-entities, attributes and relationships, weak and strong entities, conversion of ER model into relational schema. DFD.
Normalization: informal design guidelines for relational schemas (overview level), functional dependencies, different types of keys. Normal forms (first, second, third, BCNF). Functional dependency diagram and design of relational database from it.

Suggested Reading:
1. Introduction to database management system, C.J. Date
2. Fundamentals of data base management system, Elmasri & Navathe
3. An introduction to Database systems; Bipin C. Desai; Galgotia publications.
4. Database Systems - Concept, Design and Applications; S.K.Singh; Pearson Education.


3.4 OBJECT ORIENTED PROGRAMMING
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Introduction: Marks: 8
What is OOP .Introducing Object-Oriented Approach, Relating to other paradigms. Benefits of OOP and methods.

Basic Terms and Ideas: Marks: 12
Abstraction, Encapsulation, Inheritance, Polymorphism, Review of C, Difference between C and C++ - cin, cout, new, delete operators. Functions in C++: main function, function prototyping, call by reference, return by reference, functions- inline, friend, virtual, library.

Classes and Objects: Marks: 20
Encapsulation, information hiding, abstract data types, Object & classes, attributes, functions, C++ class declaration, member functions, State identity and behavior of an object, static data members and member functions, friend functions, constant member functions. Constructors and destructors, instantiation of objects, Default parameter value, object types, C++ garbage collection, Metaclass/abstract classes.

Operator overloading: Overload unary, binary operators, overloading binary operators using friends, manipulation of strings using operators.

Inheritance: Marks: 15
Inheritance-multilevel, multiple, hierarchical, hybrid, virtual base class, abstract class, Class hierarchy, derivation – public, private & protected, Aggregation, composition vs classification hierarchies.

Polymorphism: Marks: 15
Polymorphism, Categorization of polymorphism techniques: compile time polymorphism, Polymorphism by parameter, run time polymorphism- pointers to derived class, virtual; function, pure virtual function.

Files and Exception Handling: Marks: 10
Persistant objects, Streams and files, Namespaces, Exception handling, Generic Classes.

Suggested Readings:
1. Herbert Schild, ― The complete reference to C++‖, Osborn McGraw Hill
2. R. Lafore, ―Object Oriented Programming using C++‖, Galgotia Publications
3. Ian Graham, ―Object Oriented Methods‖, Addison Wesley..

29
3.5 LABORATORY
At least 12 practical assignments covering paper 3.1( 30 marks), 6 assignments covering paper 3.3 (35 marks) and 12 assignments covering paper 3.4 (35 marks) should be done by the students from the list prepared the UG Committee of Courses and Studies in Computer Science. The assignments are to be selected in such a way that the course is covered.

4.1 MICROPROCESSOR AND ASSEMBLY LANGUAGE PROGRAMMING
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Internal Organization of 8085A microprocessor: Marks:7
User Programmable registers, PC, SP, accumulator, flags, data bus, address bus, control bus, instruction word size, opcode format, data format, memory addressing, I/O addressing, address decoding for memory and I/O.

8085A microprocessor architecture: Marks: 16
Pinout of 8085A microprocessor, multiplexed address/data bus, control and status signal, demultiplexing of control signals, other signals, bus timings, fetch decode and execute cycle, timing diagram for opcode fetch memory read and memory write, interfacing memory and I/O.
Assembly Language Programming in 8085A Microprocessor: Marks: 25
Complete instruction set in detail, programming examples, logic operation, counters and time delays, stack and subroutine, processing arrays, bit manipulation.
Interfacing: Marks: 16
In and OUT instruction, decoding addresses, Interfacing LED, relay, seven segment display, switch, keyboard,.
Interrupts: Marks: 16
Vectored interrupts, interrupt priorities, general purpose programmable peripheral devices, 8255A control and status registers, programming 8255A, introduction to 8279, 8254 and 8237 (block diagrams and basic functions).

Suggested Reading :
1. Microprocessor Architecture, Programming and Application with the 8085 by

Ramesh S.Gaonkar
2. Microprocessor and Microcomputer by B.Ram.


4.2 SOFTWARE ENGINEERING
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Introduction: Marks: 25
Software Processes & Characteristics, Software life cycle
Models ---- Waterfall, Prototype, Evolutionary and Spiral Models
Software Requirements analysis & specifications: Requirement engineering, requirement, elicitation techniques like FAST, QFD, requirements analysis using DFD, Data dictionaries, ER Diagrams, Requirements documentation, Nature of SRS, Characteristics & organization of SRS.

Software Project Planning: Marks: 15
Size Estimation like lines of Code & Function Count, Cost Estimation Models, COCOMO, Risk Management.

Software Design: Marks: 15
Data design, Architectural design, Interface design, Function Oriented Design, Object Oriented Design, Cohesion & Coupling, Classification of Cohesiveness & Coupling,
Software Metrics: different types of project matrics.
Software Testing and Maintenance: Marks: 25
Testing Process, Design of Test Cases, Types of Testing, Functional Testing, Structural Testing, Test Activities, Unit Testing, Integration Testing and System Testing. Debugging Activities
Software Maintenance: Management of Maintenance, Maintenance Process, Reverse Engineering, Software Re-engineering, Configuration Management, Documentation. Software quality Assurance.
CASE tools--- Analysis tools, design tools, SQA tools, software testing tools.

Suggested Readings:
1. Rajeev Mall ―Software Engineering‖ PHI
2. Pressman Roger ― Software Engineering A Practitioners Approach‖ Tata McGraw Hill
3. James F. Peters, Witold Pedrycz ―Software Engineering An Engineering Approach‖


4.3 PROGRAMMING IN JAVA
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)

UNIT-I Marks : 40
Java language basics: Basic features, Java virtual machine concepts. Data types:- primitive data types and variables. Java Key words, integer and floating point data type, character and Boolean types, declaring and initialization variables. Java operators, Expressions, Statements-- selection statements, control statements, iterative statements, jump statements.

Classes & Objects: Creating objects, assigning object reference variables. Introducing methods.

Arrays:- Static methods, Constructors, Overloading constructors., Strings, and Vector.
This Keyword , Using object as parameters:- argument passing, returning objects.
Method Overloading , garbage collection , the Finalize() method.
Inheritance and Polymorphism- Inheritance basics, access control, multilevel inheritance, method overriding, abstract classes, polymorphism, Final keyword.
Multithreaded programming,

I/O in Java :- I/O basics, Streams and stream classes , reading from and writing to console, reading and writing files

UNIT – II Marks : 10
Java applets: The Applet Class, Applet Architecture, An Applet skeleton: initialization and termination, handling events, HTML Applet Tag, Control.

UNIT – III Marks : 10
Networking : Socket overview -- datagram socket and TCP/IP based server socket, Internet Addressing --- DNS, UR. Event handling Drivers in Java.

UNIT – IV Marks : 20
Java Database Connectivity: Establishing a connection( JDBC, ODBC connectivity) , transactions with database.

Suggested Reading
1. Programming in Java, E. Balaguruswamy, Tata Mc-Graw Hill.
2. Patrik Naughton & Herbert Schildt ― The complete reference java‖


4.4 AUTOMATA THEORY AND LANGUAGES
Total marks: 100 (Semester end examination - 80, Internal assessment - 20)
Finite Automata Marks: 14
DFA, NFA, NFA with ε-moves. Equivalence of DFA and NFA. Reduction of the number of states in a finite automata.

Regular Languages and Regular Grammar Marks: 15
Concept of languages and grammar. Regular expressions. Connection between regular expressions and regular languages. Regular grammars, Right and Left-Linear Grammars. Equivalence between Regular languages and Regular grammars.

Properties of Regular Languages Marks: 12
Closure under simple set operations- union, intersection, concatenation, complementation and star-closure. Decision algorithms for emptiness, finiteness and infiniteness, equality. Proof of non-regularity using Pigeonhole principle and using pumping lemma for regular languages.

Context Free languages Marks: 15
Context-free grammars, leftmost and rightmost derivations, derivation trees. Parsing and Ambiguity in grammars and languages. Simplification of Context free Grammars- removing useless productions, empty-productions and unit-productions. Normal forms- Chomsky and Greibach normal forms.

Pushdown Automata Marks: 12
Definition and language accepted (acceptance by empty stack and final state and their equivalence). Pushdown Automata and Context free languages. Deterministic PDA and Deterministic Context free Languages.

Properties of Context free Languages Marks: 12
Pumping Lemma for CFL. Using Pumping Lemma to show certain languages not to be Context free. Closure properties of CFL – closure under union, concatenation and star-closure. and showing that CFLs are not closed under intersection and complementation. Decision algorithms for emptiness, finiteness and infiniteness.

Suggested Reading
1. An introduction to Formal Languages and Automata, Peter Linz, Narosa.
2. Introduction to Automata Theory, Languages and Computation, Hopcroft and Ullman, Addison Wesley.
3. K. L. P. Mishra, N. Chandrasekaran; Theory of Computer Science (Automata, Languages and Computation), P. H. I.

Contact Details
Gauhati University
National Highway 37, Gopinath Bordoloi Nagar,
Jalukbari, Guwahati, Assam 781014 ‎
Ph: 0361 270 0311

Map
Attached Files Available for Download
File Type: pdf Gauhati University BCA Syllabus.pdf (755.2 KB, 28 views)
__________________
Answered By StudyChaCha Member
Reply With Quote Quick reply to this message
Reply


Reply to this Question / Ask Another Question
Your Username: Click here to log in

Message:
Options

Forum Jump


All times are GMT +6.5. The time now is 09:59 PM.


Powered by vBulletin® Version 3.8.11
Copyright ©2000 - 2020, vBulletin Solutions, Inc.
Search Engine Friendly URLs by vBSEO 3.6.0 PL2

1 2 3 4 5 6 7 8 9