Sunteți pe pagina 1din 24

Swami Ramanand Teerth Marathwada University, Nanded

Third Year U.G. Program in Computer Science & Engineering


Effective from 2016-17
SOFTWARE ENGINEERING

Teaching Scheme L: 3 T: 0

Evaluation MSE ESE Minimum Passing Marks


Scheme 20 Marks 80 Marks 40%

Course Objectives:
1. To study current software engineering practices to develop software systems.
2. To understand software design and architecture documents.

3. To apply approaches for verification and validation including static analysis, and
reviews.
4. To explore the role of project management including planning, scheduling, risk
management.

Course Contents:

Unit I: Introduction to Software Engineering (07 Hrs)


Professional software development, Software engineering ethics, Software process models,
Process activities, Coping with change, The rational unified process, Agile methods, Plan-
driven and agile development, Extreme programming, Agile project management, Scaling
agile methods.

Unit II: Requirements Engineering (07 Hrs)


Functional and non-functional requirements, The software requirement document,
Requirement specification, Requirement engineering processes, Requirements elicitation and
analysis, Requirement validation, Requirement management, System modeling: Context
models, interaction models, Structural models, Behavioral models, Model-driven
engineering.

Unit III: Design Engineering (06 Hrs)


Architectural design decisions, Architectural views, Architectural patterns, Application
architectures, Design and implementation: Object-oriented design using the UML, Design
patterns, Implementation issues, Open source development

3
Unit IV: Software Testing (07 Hrs)
Development testing, Test-driven development, Release testing, User testing, Software
evolution: Evolution processes, Program evolution dynamics, Software maintenance, Legacy
system management.

Unit V: Project Management (06 Hrs)


Risk management, Managing people, Teamwork, Project Planning: Software pricing, Plan-
driven development, Project scheduling, Agile planning, Estimation techniques.

Unit VI: Quality Management (07 Hrs)


Software quality, Software standards, Reviews and inspections, Software measurement and
metrics, Change management, Version management, System building, Release management,
Process improvement : Process, Process improvement , Process analysis, Process change, The
CMMI process improvement framework.

Outcomes: By the end of this course, students will be able to:


1. Investigate and improve the specification of a software system.
2. Design system, component of process to meet desired needs within realistic constraints.

3. Identify, formulate and solve engineering problems.

4. Conduct standard tests and measurements.

Text Books

1. “Software Engineering”, by Ian sommerville 9 th Ed, Addison-Wesley 2011, ISBN


0137035152.
2. “Software Engineering – A Practitioner’s Approach” by Roger S. pressman ( 7th
Edition, Tata McGraw Hill Publication, 2010, ISBN: 978-007-126782-3.

Reference Books
1. Pankaj Jalote “An Integrated Approach to Software Engineering”, 3rd Edition, Springer,
2005, ISBN: 038720881X.
2. Mall R., "Fundamentals of Software Engineering", 2nd Edition, Prentice Hall India,
2004, ISBN: 9788120338197.
3. Vliet H., "Software Engineering Principles and Practices", 2nd Edition, John Wiley &
Sons, 2000, ISBN-10: 0471975087.

4
Swami Ramanand Teerth Marathwada University, Nanded
Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
COMPILER DESIGN

Teaching Scheme L:3 T:1

Evaluation MSE ESE Minimum Passing Marks


Scheme 20 Marks 80 Marks 40%

Course Objectives:
1. To emphasis on solving problems, universally encountered in designing a language
translator, regardless of the source or target machine.
2. To understand, design and implement various phases of compiler.
3. To introduce students to the techniques used in designing and writing compiler.

Course Contents:

Unit I: Introduction (06 Hrs)


Introduction: Language Processors, Structure of a Compiler, Compiler Construction Tools,
Analysis and Synthesis Model of Compiler, Cross Compiler, Incremental Model,
Bootstrapping. Lexical Analysis: Role of the Lexical Analyzer, Input Buffering, Specification
of Tokens, Recognition of Tokens, Finite Automata, From Regular Expression to Automata,
Lexical Analyzer Generator Lex, Design of Lexical Analyzer Generator.

Unit II: Syntax Analysis - Top Down Parsing: (07 Hrs)


Introduction, Context Free Grammars(CFG), Concept of parsing, Parsing Techniques ,Top-
Down Parsers : Introduction, Predictive Parsing - Removal of left recursion, Removal of left
factoring, Recursive Descent Parsing, FIRST and FOLLOW ,Predictive LL( 1) grammar,
Nonrecursive Predictive Parsing

Unit III: Syntax Analysis - Bottom Up Parsing: (07 Hrs)


Introduction, Reduction,Handle Pruning,Shift-Reduce Parsing and their Conflicts,
Introduction to LR parsing : LR Parser, SLR(1), LR(1), and LALR(1) Grammars.

Unit IV: Syntax directed definitions & Intermediate code generation : (06 Hrs)
Syntax directed definitions, Inherited and synthesized attributes, Evaluation Order of SDD,
dependency graph, Ordering the Evaluation of Attributes, S-attributed Definition, L-attributed
Definitions, Applications of Syntax -Directed Translations.

Intermediate code generation: Variants of syntax trees, Three address codes, Types and
declarations, Translation of Expression, Type checking, Control flow, Backpatching.

Unit V: Code Optimizations (07 Hrs)

5
Introduction, Machine Independent Optimization, Machine: Various Optimizations: Common
Sub-expressions, Copy propagation, Dead-code elimination, Loop Optimizations, Code
Motion, Induction variables and reduction in strength, Redundant –instruction elimination

Unit VI: Run-Time Memory Management & Code generation: (07 Hrs)
Storage Organization, Stack allocation of space, Access to non local data on the stack, Heap
Management.
Issues in design of code generator, The target language, Addresses in target code, Basic
blocks and flow graphs, Optimizations of Basic Blocks, Peephole Optimization, Register
allocation and assignment.

Outcomes: By the end of this course, students will be able to:


1. Acquire knowledge in different phases and specifying different types of tokens by
lexical analyzer and also able to use the compiler tools like Lex, YACC etc.
2. Acquire the knowledge of modern compiler and its features.
3. Learn the code optimization techniques to improve the performance of a program in
terms of speed & space.

Text Books

1. “Compilers - Principles, Techniques and Tools ”, A.V. Aho, M.S. Lam, Ravi Sethi and J.D.
Ullman, Second Edition, Pearson Education, ISBN 978-81-317-2101-8.
2. “Compiler Design”, Rajkumar Sing Rathor & Sandeep Saxena, S. Chand
Publishing, 2013, ISBN 9788121998505.

Reference Books
1. “Compiler Construction Principles and Practice” Kenneth C. Louden PWS Publishing
Company, 1997 (now a part of Cengage Learning) ISBN 0-534-93972-4
2. “Compiler Design”, O.G. Kakde, Forth Edition, University Science Press, ISBN
8170083831
3. “Compiler Design”, Santanu Chattopadhyay, Prentice Hall of India, 2005, ISBN 81-203-
2725-X
4. “Compiler Construction”, Barret, Bates, 2nd edition Couch, Galgotia, ISBN 09574-
21765.

Swami Ramanand Teerth Marathwada University, Nanded

6
Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
DATA COMMUNICATION

Teaching Scheme L: 4 T:0

Evaluation MSE ESE Minimum Passing Marks


Scheme 20 Marks 80 Marks 40%

Course Objectives
1. To understand basic concepts of data and computer communication as a foundation of
Computer Networks.
2. To learn about basic connecting devices, such as Ethernet, Modems, Cables or other
transmission Mediums.
3. To understand the concept of flow control, error control and protocols in wired and
wireless LAN
4. To provide students with in-depth knowledge of data link layer fundamental such as
error detection, correction and flow control techniques; multiple access control
techniques.

Unit I: Introduction (07 Hrs)


Data Communications, Data Networking, A Communications Model , 3 Data Communications
Networks.
Protocol Architecture: The Need for Protocol Architecture, the TCP/IP Protocol Architecture,
The OSI Model, Standardization within a Protocol Architecture,
Data Transmission: Concepts and Terminology, Analog and Digital Data Transmission,
Transmission Impairments, Channel Capacity

Unit II: Transmission Media (06 Hrs)


Guided Transmission Media, Wireless Transmission, Wireless Propagation, Line-of-Sight
Transmission
Signal Encoding Techniques: Digital Data and Digital Signals , Digital Data and Analog
Signals, Analog Data and Digital Signals, Analog Data and Analog Signals.

Unit III: Digital Data Communication Techniques (07 Hrs)


Asynchronous and Synchronous Transmission, Types of Errors, Error Detection, Error
Correction, Line Configurations
Data Link Control Protocols: Flow Control, Error Control, High-Level Data Link Control
(HDLC).

Unit IV: Multiplexing (06 Hrs)


Frequency-Division Multiplexing, Synchronous Time-Division Multiplexing, Statistical time-
Division Multiplexing, Asymmetric Digital Subscriber Line, xDSL
7
Spread Spectrum: The Concept of Spread Spectrum, Frequency Hopping Spread Spectrum,
Direct Sequence Spread Spectrum, Code-Division Multiple Access

Unit V: Circuit Switching and Packet Switching (07 Hrs)


Switched Communications Networks, Circuit Switching Networks, Circuit Switching
Concepts, Softswitch Architecture, Packet-Switching Principles, X.25, Frame Relay
Local Area Network: Background, Topologies and Transmission Media, LAN Protocol
Architecture, Bridges, Layer 2 and Layer 3 Switches

Unit VI: High-Speed LANs (07 Hrs)


The Emergence of High-Speed LANs, Ethernet, Fiber Channel.
Wireless LANs: Overview of Wireless LAN Technology, IEEE 802.11 Architecture and
Services, IEEE 802.11 Medium Access Control, IEEE 802.11Physical Layer, IEEE 802.11
Security Considerations

Outcomes: By the end of this course, students will be able to:

1. Basics data communication and two lower layers i.e. physical and data link layers.
2. Networking building blocks such as Ethernet, Cables and modems.
3. The conflicting issues and resolution techniques in data transmission.
4. The setting up of a network environment with all the necessary data communication
components, procedure and techniques that make it functional
5. The different types of network topologies and protocols.

Text Books

1. “ Data and computer Communication” ,William Stalling, 8th Edition, Pearson


Education, 2009, ISBN 0-13-243310-9.
2. “ Data Communications and Networking”, Beherouz A. Forouzan, 4th Edition, Tata
McGraw Hill, 2006. ISBN 13: 978-0-07-063414-5

Reference Books
1. "Data Communications and Networks", Godbole A., Tata McGraw-Hill Publications,
ISBN, 0070472971, 9780070472976.
2. "Communication Networks - Fundamental Concepts and Key Architectures", Garcia
L., Widjaja I., 2nd edition, Tata McGraw-Hill, 2000, ISBN-10: 0070228396; ISBN-
13: 978-0070228399.

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering

8
Effective from 2016-17
DATA COMMUNICATION LAB
Teaching Scheme P: 2
Evaluation Continuous Evaluation ESE Minimum Passing Marks
Scheme 30 Marks 70 Marks 40%

Term Work:

1. The instructor will frame programming assignments based on the suggested list of
assignments.
2. Instructors are expected to incorporate variations in list.
3. Students will submit term work in the form of a journal that will include at least 08-10
practical assignments. Each programming assignment will consists of pseudo-
algorithm, program listing with proper documentation and a printout of the output.
4. Practical examination will consist of performance and viva-voce examination based
on the term work.

The assessment will be based on the following –


1. Performance in the practical examination.
2. Record of programs submitted by the candidate.
3. Setting goals higher than expected from the problem statement.
4. Innovation & Creativity.
5. Team building skills.
6. Technical writing skills.

Suggested List of Practical


1. Study of Switches and hubs in your campus.
2. Study of LAN /WAN of your college/ institute campus.
3. Connect two or three computers using wired media (available in your Lab).
4. Data transfer using stop and wait protocol
5. Implement Go-Back-N sender algorithm
6. Implement Go-Back-N receiver algorithm
7. Implement in C linear block codes.
8. Implement in C cyclic codes.
9. Implement in C checksum.
10. Study of Ethernet card.
11. Study of IEEE 802.3 and IEEE 802.11 standards.
12. Study of Fast Ethernet (for ex. 1000Base-CX)
13. Study of the gigabit Ethernet. (1000Base-Sx)
14. Study of Guided media,
15. Study of Coaxial cable
Swami Ramanand Teerth Marathwada University, Nanded
Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
9
UNIX OPERATING SYSTEM

Teaching Scheme L: 3 T: 0

Evaluation MSE ESE Minimum Passing Marks


Scheme 20 Marks 80 Marks 40%

Course Objectives:
1. To understand the basic concepts, design and structure of the UNIX operating system.
2. To implement various system calls.
3. To acquire skills in UNIX Shell programming.
4. To learn basics of UNIX system administration.

Course Contents:

Unit I: Introduction (06 Hrs)


General overview of the system - History, System structure, User perspective, Operating
system services, Assumption about hardware,
Introduction to the KERNEL - Architecture of UNIX OS, Introduction to system concepts,
Kernel data structure, System administration.

Unit II: The Buffer Cache (08 Hrs)


Buffer headers, Structure of the buffer pool, Scenarios for retrieval of a buffer, Reading and
writing disk blocks, Advantages and disadvantages of cache.
Internal Representation of Files: I-nodes, Structure of the regular file, Directories, Conversion
of a pathname to i-node, Super block, I-node assignment to a new file, Allocation of disk
blocks, Other file types.

Unit III: System calls for the file System (06 Hrs)
Open, Read, Write, File and Record Locking, Adjusting the position of FILE I/O-LSEEK,
Close, File Creation, Creation of Special File, Change Directory and Change Root, Change
Owner and Change Mode, Stat and Fstat, Pipes, Dup, Mounting and Un-mounting file
systems, Link, Unlink, File System Abstractions, File system maintenance

Unit IV: The Structure of process (08 Hrs)


Process stages and transitions, layout of system memory, The context of a process, Saving
context of a process, Manipulation of the process address space.
Process Control: Process creation, Signals, Process termination, Awaiting process
termination, Invoking other programs, The user id of a process, The shell, System Boot and
the Init process.

Unit V: Process Scheduling and Time (06 Hrs)


Process Scheduling, System call for time, Clock.
Memory management policies: Swapping, Demand passing, A hybrid system with demand
paging and swapping

Unit VI: The I/O Subsystem (06 Hrs)


Driver interfaces, Disk drives, Terminal drivers, Streams.
10
Inter-Process communication: Processing Tracing, System V IPC, Network communications,
Sockets

Outcomes: By the end of this course, students will be able to:


1. Learn UNIX structure, commands, and utilities.
2. Describe and understand the UNIX file system.
3. Write shell scripts in order to perform shell programming.
4. Acquire knowledge about text processing utilities, process management and system
operation of UNIX.

Text Books
1. Maurice. J. Bach, “The Design of the UNIX operating System”, PHI. ISBN-13: 978-
8120305168.

Reference Books
1. Sumitabha Das, “Unix concepts and administration” 4th Edition – Tata McGraw Hill.
ISBN-13: 978-0070635463.
2. Robert Love, “Linux System Programming” SPD, O’ REILLY. ISBN-13: 978-
9351107729.
3. Richard Stevens, “UNIX Network Programming”, PHI. ISBN-13: 978-0139498763
4. John Muster, “UNIX made easy”, 3rd Edition, TMH Edition. ISBN-
13: 9780072193145.
5. Meeta Gandhi,Rajiv Shah,Tilak Shety,Vijay Mukhi , “The C Odyssey: UNIX-The Open
Boundless C” BPB Publications. ISBN-13: 978-8170291657.

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
UNIX OPERATING SYSTEM LAB

Teaching Scheme P: 2
11
Evaluation Continuous Evaluation ESE Minimum Passing Marks
Scheme 30 Marks 70 Marks 40%

Term Work:

1. The instructor will frame programming assignments based on the suggested list of
assignments.
2. Instructors are expected to incorporate variations in list.
3. Students will submit term work in the form of a journal that will include at least 10
practical assignments. Each programming assignment will consists of pseudo-
algorithm, program listing with proper documentation and a printout of the output.
4. Practical examination will consist of performance and viva-voce examination based
on the term work.

The assessment will be based on the following

1. Performance in the practical examination.


2. Record of programs submitted by the candidate.
3. Setting goals higher than expected from the problem statement.
4. Innovation & Creativity.
5. Team building skills.
6. Technical writing skills.

Suggested List of Assignments:


1. Introduction to shell and execute simple shell programs.
2. To execute Shell programs using Decision making statements.
3. To execute Shell programs using Loop Control statements.
4. Study & demonstration of how the Linux Kernel implements and Manages files.
5. Study & demonstration of User Buffer I/O - Observe practically by writing ‘C’
program.
6. Study and demonstration of Advanced File I/O.
7. Study and demonstration of Unix Process. Management – from process creation to
process termination.
8. Study and Demonstration of the File and Directory Management.
9. Study and demonstration of Memory Management.
10. Study and Demonstration of Signals.
11. Study and configure DHCP server.
12. Study of different RAID levels and configuration of RAID partitions.
13. Configuration of yum.
14. Study and configure FTP server.
15. Study and configure Proxy server / SQUID.

12
Swami Ramanand Teerth Marathwada University, Nanded
Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
CS316: ELECTIVE-II : PYTHON PROGRAMMING

Teaching Scheme L:4 T:0

Evaluation MSE ESE Minimum Passing Marks


Scheme 20 Marks 80 Marks 40%

Course Objectives:
1. Learning a Python language for expressing computations.
2. Learning about the process of writing and debugging a program in Python
3. Understand the principles of object-oriented programming using the logical constructs
of the Python language.

Course Contents:

Unit 1:
Planning the Computer Program: Concept of problem solving, Problem definition, Program
design, Debugging, Types of errors in programming, Documentation. (3L) Techniques of
Problem Solving: Flowcharting, decision table, algorithms, Structured programming
concepts, Programming methodologies viz. top-down and bottom-up programming.

Unit II: (08 Hrs)


Introduction to Python: Introduction to Python interpreter, Byte code compilation,
Python Virtual Machine, Python implementation alternatives- Cpython, Jpython, Ironpython,
How to run Python programs, Running file with command line, Executable scripts.
Types and Operators: Build in types, Python core data types, Strings- Sequence operations,
Immutability, Type specific methods, other ways to code string, Pattern matching. Lists-type
specific operations, Bound checking, Nesting, Comprehensions, Dictionaries mapping
operation, Iteration and optimization

Unit III: Numeric Types (07 Hrs)


Numeric type basics, Numeric literals, Built in numeric literals, Python expression operators-
Mixes operators follow operator precedence, parenthesis group sub expression, Numbers in
action, Statement and syntax- If test and syntax rules, while and for loops, Iterations.
List: Creating lists, Accessing elements of list, Negative list indices, List slicing [Start: end],
List slicing with step size, Python built-in functions for lists, The list operator, List
comprehensions, List methods, List and strings, Splitting a string in list.
13
Unit IV: String (08 Hrs)
Introduction, The index operator, Access characters via negative index, Traversal with
for loop, Traversal with a while loop, The string slicing operator [start: end], string slicing
with step size, various methods of str (String) class, Testing string, Searching substring in a
string, Methods to convert a string to another string, Stripping unwanted characters from a
string, Formatting string.
Functions: Introduction, Arguments and parameters, Positional arguments, Keyword
arguments, Precautions while using keyword arguments, Parameter with default values, The
local scope of variable, The return statement, Returning multiple values.

Unit V: (07 Hrs)


Classes and methods: An introduction to object-oriented programming in Python. How to
create new objects, overload operators, and utilize Python special methods. Basic principles
of object oriented programming: Operator overloading, Polymorphism, Inheritance.

Unit VI: (08 Hrs)


Python- Database Access: MYSQLdb, Installing MYSQLdb, Database connection, Creating
database table, Database operation- Insert, Update, Delete, Commit, Rollback.
Graphical User Interface in Python: GUI Basics, Tkinter widgets- Button, CheckButton,
Frame, Label, Labelframe, RadioButton, Scrollbar, Progress bar.

Outcomes: By the end of this course, students will be able to:


1. Understand the Python program development environment.
2. Understand the principles of Object-oriented programming with well-written modular
code.

3. Solve problems with well-documented programs in the Python language, including


the use of the logical constructs of that language.

Text Books
1. “Python: The Complete Reference” by Martin C. Brown (McGraw Hill Education),
ISBN - 978-0072127188
2. “Learning with Python: How to Think Like a Computer Scientist” by Allen
Downey (Dreamtech Press), ISBN-978-9351198147
3. “Learning Python: Powerful Object-Oriented Programming” by Lutz M (Shroff
publishing Fifth edition) ISBN- 978-935110201
4. “How to Solve It by Computer” by Droomy (Pearson Education; 1 edition), ISBN :
978-8131705629
Reference Books

1. “Head First Python” by Barry Paul (Author) (Shroff publication First edition)ISBN-
978-9350231883

14
2. “Think Python” by Allen B. Downey (Shroff publisher, First edition) ISBN-13: 978-
9350238639

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
PYTHON PROGRAMMING LAB

Teaching Scheme P: 2

Evaluation Continuous Evaluation ESE Minimum Passing Marks


Scheme 30 Marks 70 Marks 40%

Term Work:

1. The instructor will frame programming assignments based on the suggested list of
assignments.
2. Instructors are expected to incorporate variations in list.
3. Students will submit term work in the form of a journal that will include at least 08-10
practical assignments. Each programming assignment will consists of pseudo-
algorithm, program listing with proper documentation and a printout of the output.
4. Practical examination will consist of performance and viva-voce examination based
on the term work.

The assessment will be based on the following –

1. Performance in the practical examination.


2. Record of programs submitted by the candidate.
3. Setting goals higher than expected from the problem statement.
4. Innovation & Creativity.
5. Team building skills.
6. Technical writing skills.

Suggested List of Assignment


1. Getting started with Linux, learn basic commands, and directory structure, execute
files and directory operations.
a. Review redirection, pipes, filters and job control.
b. Review file ownership, file permissions, links and file system hierarchy.
2. Getting started with Python
a. Learn the basic types and control flow statements.
b. Learn about functions - Definition, default arguments, multiple return values,
15
variable arguments.
c. Learn Python’s data structures - lists, dictionaries, and tuples, in detail.

3. Learn to build simple Python apps: Learn about modules, imports, listing module
contents, standard modules.
4. Learn about string formatting and file I/O: Learn about errors, exceptions and
exception handling.
5. Learn to access My SQL databases from Python: Learn the Decimal datatype.
6. Learn Object Oriented Programming in Python: Learn operator overloading and
inheritance.
7. GUI Programming
a. Get started with GTK+.
b. Learn to create widgets and associate callbacks.
c. Learn about packing using boxes and tables.
d. Learn to write simple applications using the GTK+ toolkit.

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
PROFESSIONAL APTITUDE AND
LOGICAL REASONING

Teaching Scheme L: 2

16
Evaluation MSE ESE Minimum Passing Marks
Scheme 20 Marks 80 Marks 40%

Course Objectives:
The students should
1. Develop a deep sense of analysis towards solving a problem
2. Supplement his/her problem solving skills
3. Develop critical thinking
4. Boost his/her ability to work with numbers
5. Augment a student’s attention to detail
6. Enhance their spoken and written English Language

Unit 1 focuses on the enhancement of English Language levels of the students.


Unit 2 focuses on the development of sense of analysis, numerical ability and arithmetical
reasoning.
Unit 3 works on improving the attention to detail and critical reasoning/thinking of the
student. It helps in the improvement of the student’s ability to think creatively and generate
new ideas. It helps develops the ability of students to logically deduct inferences.

Course Contents:

Unit I: English (05 Hrs.)


Sentence completion, Error Correction, Reading Comprehension

Unit II: Quantitative Aptitude (08 Hrs.)


Number Systems, Averages, Percentages, Ratio and Proportion, Time Work and Distance,
Permutations and Combinations, Probability

Unit III: Data Interpretation and Logical Reasoning (07 Hrs.)


Data Analysis, Analytical Puzzles, Verbal Reasoning, Non Verbal Reasoning, Critical
Reasoning

Outcomes: By the end of the course the student should be able to:

1. Identify, construct and compute numerical situations by work with


numbers
2. Conceive and develop a methodology for analyzing and solving a problem
3. Analyze and interpret data
4. Develop and modify attention to detail
5. Define, modify and apply critical thinking to real time situations

17
6. Construct and design a structured approach to solving a given analytical
situation.

This subject will also help in developing the ability to solve situations and problems in exams
such as Common Aptitude Test (conducted by the IIMs), GRE, GMAT and the aptitude part
of GATE.

Text Books
1. “A Modern Approach to Logical Reasoning” by R. S. Agrawal (8th Edition, Chand&
Company Ltd.) ISBN-9971-51-283-1.
2. “High School English Grammar and Composition” by Wren and Martin (Multicolor
Edition, S. Chand& Company Ltd.) ISBN-81-219-2197-X
4. “Magical Book on Quicker Maths” by M Tyra (DSC Publication) ISBN 978-
8190458924

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
PROGRAMMIN LAB - IV

Teaching Scheme L: 2 P: 2

Evaluation Continuous Evaluation ESE Minimum Passing Marks


18
Scheme 30 Marks 70 Marks 40%

Course Objectives:
1. Design and implement object oriented programming design and methods through
creation and use of classes in Java applications and applets.
2. Using Swing package for Advanced GUI Creation
3. Read/Write data to database using JDBC.
4. To learn the client server interactions using socket programming and Remote Method
Invocation (RMI) server.
5. To explain students various Enterprise JavaBean (EJB) concepts including entity
beans, session beans, bean managed persistence (BMP), and container managed
persistence (CMP).

Course Contents:

Unit I: Java Database Connectivity (JDBC) (04 Hrs)


Introduction, Types of JDBC drivers, Configuration of JDBC Connection, JDBC update &
Query operations.

Unit II: Socket Programming (05 Hrs)


Socket Programming and java .net class, TCP/IP and UDP Socket Programming.

Unit III: RMI Programming (06 Hrs)


RMI Development Life Cycle, Implementing an RMI Client and Server.
Servlet: Servlet Overview and Architecture, Servlet and HTTPServlet Interface, Servlet
Life Cycle, Servlet deployment Handling HTTP get Requests, Handling HTTP post
Requests,

Unit IV: Servlet (05 Hrs)


Redirecting Requests to Other Resources, Session Tracking, Cookies, Session Tracking
with HttpSession.

Unit V: Java Server Pages (05 Hrs)


Java Server Pages Overview, A First Java Server Page Example, Implicit Objects,
Scripting, Standard Actions, Directives, Custom Tag Libraries
Unit VI: Enterprise Java Beans (05 Hrs)
Preparing a Class to be a JavaBean, Creating a JavaBean, JavaBean Properties, Types of
beans, State full Session bean, Stateless Session bean, Entity bean

Outcomes: By the end of the course the student should be able to:

1. Document and package a Java application


2. Use many of the new enhancements added to the Java API
3. Use assertions to write robust Java code.
4. Write TCP/IP Client Server applications using sockets.
5. Execute methods on a remote object using RMI.
6. Perform database queries and updates using JDBC.
19
7. Reuse of classes using JAVA Beans.

Text Books
1. “Object-Oriented Programming with JAVA” by Rajkumar buyya,S. Thamarai Selvi,
Xingchen Chu, Tata McGraw Hill Education Private Limited, ISBN13:978-0-07-
066908-6
2. “JAVA How to Program” by Deitel & Deitel,sixth edition, PHI publication, ISBN-81-
203-2800-0.

Reference Books
1. “Java 2 Programming Black Book” by Steven Holzner, Fifth Edition,Paraglyph Press,
Dremtech Press, ISBN-978-81-7722-655-3.
2. “The Complete Reference Java (Seventh Edition)”by Herbert Schildt, 7th Edition,
Tata Mcgrew Hill.

Term Work:

1. Instructor will frame experiments based on the suggested experiments in Advance


JAVA as given below.
2. Instructors are expected to incorporate variations in list.
2. Students will submit Term Work in the form of a journal that will include at least
08-10 experiments from the list given below. Each experiment will consists of pseudo
algorithm, program listing with proper documentation and printout of the output.
3. Practical Examination will consist of Performance and Viva-voice Examination
based on the term work.

The assessment will be based on the following

1. Performance in the practical examination


2. Record of programs submitted by the candidate.
3. Setting goals higher than expected from problem statement.
4. Innovation & Creativity.
5. Team building skills
6. Technical writing skills

Suggested List of Assignments

1. Write a program that connects to a database and retrieves records from table.
2. Write a Java application, which connects to a database and Writes records to
table.
3. Write a java application, which uses CallableStatement to call stored
procedure in java.
4. Write a Java application, which uses PreparedStatement to retrieve records
from a table.
20
5. Write a program in java, which uses ResultSetMetadata.
6. Write a client Server / Program which uses TCP socket.
7. Write a client Server / Program which uses UDP socket.
8. Write a client Server / Program which calls a procedure associated with an object
stored at remote server.
9. Study of a Web server.
a. Installation
b. Configuration
c. Deployment
10. Demonstrate life cycle methods of servelet.
11. Write program using HttpServletRequest/Response objects.
12. Write a program for session management in Servlets using Cookies
13. Write a program for session management in Servlets using HttpSession
14. Write a program for session management in Servlets using Hidden Form Fields.
15. Create a JSP page, which will displays no of hits.
16. Write a program to implement the applications of JavaBeans.

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
PROGRAMMING LAB - V

Teaching Scheme P:2

Evaluation Continuous Evaluation ESE Minimum Passing Marks


Scheme 30 Marks 70 Marks 40%

Term Work:

1. Instructor will frame experiments based on the suggested list of assignments.


2. Students will submit Term Work in the form of a journal that will include at least 4 to
5 practical assignments (2-3 practical assignments from each set of suggested list) of
Compiler Design and 4 to 5 practical assignments of Software Engineering from the
list given below. Each experiment will consists of pseudo-algorithm, program listing
with proper documentation and printout of the output.

21
3. Practical Examination will consist of Performance and Viva-voce Examination based
on the term work.

The assessment will be based on the following

1. Performance in the practical examination


2. Record of programs submitted by the candidate.
3. Setting goals higher than expected from problem statement.
4. Innovation & Creativity.
5. Team building skills
6. Technical writing skills

Suggested List of Assignments

Compiler Design Practicals:


The following Practical Assignments should be completed in Unix/Linux environment.

Execution of the following programs using C-Language :

1. Write a program to implement lexical analyzer.


2. Write a program for conversion of infix expression to prefix and postfix expression.
3. Write a program for implementation of concepts of syntax analysis as a check for
a) Imbalance parenthesis
b) Invalid operator
4. Write a program for implementation symbol table using linear list.

Execution of the following programs using LEX tool :


1. Program to count the number of vowels and consonants in a given string.
2. Program to count the number of characters, words, spaces and lines in a given input file.

22
3. Program to count number of
a) Positive and negative integers
b) Positive and negative fractions
4. Program to count the numbers of comment lines in a given C program. Also eliminate
them and copy that program into separate file.
5. Program to implement a complete lexical analyzer for a small language in Lex.
6. Program to count the number of ‘scanf’ and ‘printf’ statements in a C program. Replace
them with ‘readf’ and ‘writf’ statements respectively.
7. Program to recognize a valid arithmetic expression and identify the identifiers and
operators present. Print them separately.
8. Program to recognize whether a given sentence is simpler or compound.
9. Program to recognize and count the number of identifiers in a given input file.

Execution of the following programs using YACC tool:


1. Program to test validity of a sample expression involving operators +, -,* and /.
2. Program to recognize nested IF control statements and display the number of levels of
nesting.
3. Program to recognize a valid variable, which starts with a letter, followed by any number
of letters or digits.
4. Program to evaluate an arithmetic expression involving operators +, -, * and /.
5. Program to recognize strings ' aaab', ' abbb', 'ab' and 'a' using the grammar.
6. Program to recognize the grammar (An B, n >=10 ) .

Software Engineering Practicals:


Do the following for a target system such as Library management system, Railway
Reservation system, student registration for a course, Airline reservation system, payroll
management system etc. in a rational rose environment.
1. Do the Requirement Analysis and Prepare SRS (Software Requirement Specification).
2. Using COCOMO (Constructive Cost Model) model estimate effort.
3. Calculate effort using FP (Function point) oriented estimation model.
4. Analyze the risk related to the project and prepare RMMM (Risk Mitigation, Monitoring,
and Management) plan.
5. Develop time line chart and project table using PERT (Program Evaluation Review
Technique) or CPM (critical path method) project scheduling methods.
23
6. Draw E-R (Entity Relationship) Diagrams, DFD(Dataflow Diagrams), CFD(Control Flow
Diagrams) and structured charts for the project .
7. Draw the UML diagrams for a target system.
a. Analysis diagrams: USE case view
b. OO analysis: discovering classes
c: Interaction diagrams: sequence and collaboration diagrams
d: State Transition Diagram.
e: Component and Deployment diagrams.
8. Design of test cases based on requirement and design
9. Prepare FTR(formal technical reviews)
10. Prepare Version control and change control for software configuration items

Swami Ramanand Teerth Marathwada University, Nanded


Third Year U.G. Program in Computer Science & Engineering
Effective from 2016-17
SEMINAR

Teaching Scheme

Evaluation Continuous Evaluation ESE Minimum Passing Marks


Scheme 50 Marks - 40%

Objectives:

1. To assess the ability of the student to study and present a Seminar on a topic of current
relevance in Computer Science & Engineering.
2. To assess the debating capability of the student in presenting a seminar on a technical
topic.
3. To train students to express and present ideas with self-confidence and courage.

Evaluation criteria

24
The Seminar is to be carried out in a batch of maximum two students. Seminar should be
delivered by individual student using multimedia presentation and report should be submitted
preferably using Latex. The assessment will be based on the following:

 Literature Survey
 Quality of Topic Selected & Preparation of Report
 Presentation Skills
 Discussion (with Audience)
 Final Report
 Participation (including Regularity)

General suggestions and expectations / guidelines

 The Seminar topics should be related to Computer Science & Engineering, and may
be of interdisciplinary nature.
 Textual topics will not be permitted.
 References for the topics should be from recent standard journals / magazines /
conference of IEEE or any other professional societies of Computer Science &
Engineering.
 A topic should have at least 2 references.
 The Reference paper should not be reproduced exactly as the Seminar report.
 Topics already taken by students in the previous years will not be permitted.
 The students must arrange regular meetings with the guide and present progress of
Seminar work.
 A Spiral bound Seminar report to be prepared as per the guidelines and format given
by the department
 The guides are advised to check for the formatting of the presentation and seminar
report.
 Students must submit a report well before the end of the semester.

Format of Seminar Report


1. Use the A4 paper size (21cm x 29.7cm). All printed material including text,
illustrations, and charts, must be kept within a print area. Top and bottom margins are

25
1.0 Inch and 1.0 Inch, respectively, left and right margins are 1.5 Inch and 1.0 Inch
respectively. All text must be in a one column format. Text must be fully justified.
2. Chapter title: The Chapter title (on the first page of chapter) should centered, and in
Times 16-point, boldface type. Capitalize the first letter of nouns, pronouns, verbs,
adjectives, and adverbs; do not capitalize articles, co-ordinate conjunctions, or
prepositions.
3. Text: Type main text in Times 12-point, 1.5-spaced.Do not use double-spacing. All
paragraphs should be indented 1 pica (12 point or 0.5 Inch). Be sure text should be
fully justified - that is, flush left and flush right. There should be no blank space
between paragraphs. Use boldface and italic to emphasize important
words/Equations.
4. Figures and Tables: Figure captions should be below the figures; table captions
should be above the tables. Avoid placing figures and tables before their mentioning
in the text. Use the abbreviation “Fig. 1,” even at the beginning of a sentence.
5. Equations: Number the equations consecutively with equation numbers in
parentheses flush with the right margin, as in (1). Use parentheses to avoid
ambiguities in the denominator. Punctuate equations with commas or periods when
they are part of a sentence. Be sure that the symbols in your equation have been
defined before the equation appears or immediately. Equations must be typed using
Equation Editors.
6. References: References are important to the reader; therefore, each citation must be
complete and correct. List and number all bibliographical references in Times 12-
point, single- spaced, at the end of your paper. When referenced in the text, enclose
the citation number in square brackets, for example [1].
Example: [1] A.B.Name1 and C. Name2, “Paper title,” IEEE Journal, vol., no. , month,
Year, page
[2] A.B.Name, Book Title, Editor, City: Year, pages.
[3] D.E.Name, “Title,” in Proceedings of the IEEE Conference, Year, IEEE
CODE Number, pages.
7. Page No. : Print page Number at the bottom center of the page.

26

S-ar putea să vă placă și