Department of Computer Science and Engineering Master of Technology (Computer Science and Engineering) FIRST SEMESTER Sl. No Subject Code Subjects Name Hours / Week C Exam Marks L T P S CIE SEE Total 1 PCS121C Advanced Algorithms 4 0 0 0 4 50 50 100 2 PCS122C Advances in Operating Systems 3 2 0 0 4 50 50 100 3 PCS123C Mathematical Foundations for Computer Science 4 0 0 0 4 50 50 100 4 PCSXXXE Elective-I 4 0 0 0 4 50 50 100 5 PCSXXXE Elective-II 4 0 0 0 4 50 50 100 6 PCSXXXE Elective-III 4 0 0 0 4 50 50 100 7 PCS124S Seminar 0 4 0 0 2 50 50 100 8 PCS120M Introduction to Computer Science* 4 0 0 0 0 50 50 100 Total 26 04 04 0 26 400 400 800 Legend: L: Lectture, T:Tutorial, P:Practical, S:Self study, C: Credits PCS121C Advanced Algorithms 4 Credits Contact Hours(L-T-P-S) : 4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Analysis and Design of algorithms Course Outcomes: • Explain the major graph algorithms and their analyses. Employ graphs to model engineering problems, when appropriate, and analyze them. • Explain the different ways to analyze randomized algorithms (expected running time, probability of error). Recite algorithms that employ randomization. Explain the difference between a randomized algorithm and an algorithm with probabilistic inputs. • Analyze randomized algorithms. Employ indicator random variables and linearity of expectation to perform the analyses. Recite analyses of algorithms that employ this method of analysis.
38
Embed
FIRST SEMESTER C - Basaveshwar Engineering College, … Syllabus.pdf · ... Midpoint line & circle drawing algorithm, scan-line polygon filling ... clipping operations- Cohen Sutherland
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Department of Computer Science and Engineering
Master of Technology (Computer Science and Engineering)
FIRST SEMESTER
Sl. No
Subject Code Subjects Name
Hours / Week C
Exam Marks L T P S CIE SEE Total
1 PCS121C Advanced Algorithms 4 0 0 0 4 50 50 100
2 PCS122C Advances in Operating Systems
3 2 0 0 4 50 50 100
3 PCS123C Mathematical Foundations for Computer Science
Probabilistic and Randomized Algorithms: Probabilistic Algorithms, randomizing
deterministic algorithms, Monte Carlo and Las Vegas Algorithms, Probabilistic numerical
algorithms, Probabilistic parallel algorithms. NP-Complete Problems: The classes P and NP,
Reducibility, NP- complete problems: Cook’s theorem, Sample NP-complete problems, the
class co-NP, The Classes NC and P-Complete.Approximation Algorithms: Bin Packing,
The Steiner tree problem, the facility location problem.
UNIT-IV
Introduction to parallel algorithms and architectur es: Approaches to the design of
parallel algorithms, Architectural constraints and design of parallel algorithms, Performance
measures of parallel algorithms, parallel sorting. Internet algorithms: Search Engines,
Ranking web pages, Hashing, Caching, content delivery and consistent hashing, Message
security algorithms.
Note: A list of assignments will be provided in the beginning of semester and evaluated for
20 Marks
TEXT BOOKS:
1. T. H Cormen, C E Leiserson, R L Rivest and C Stein: “Introduction to Algorithms” ,
2nd Edition, Prentice-Hall of India, 2002.
2. Kenneth A. Berman and Jerome L. Paul: “Algorithms” , Cengage Learning, 2002.
REFERENCE BOOKS:
1. Ellis Horowitz, Sartaj Sahni, S.Rajasekharan: “Fundamentals of Computer
Algorithms” , 2nd Edition, University Press, 2007.
2. Alfred V. Aho,John E. Hopcroft, J.D.Ullman: “The Design and Analysis of
Computer Algorithms” , Addison-Wesley, 1974.
PCS122C Advances in Operating Systems 4 Credits
Contact Hours(L-T-P-S): 3-2-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Operating System. Course Outcomes:
• Master functions, structures and history of operating systems. • Master understanding of design issues associated with operating systems. • Master various process management concepts including scheduling, synchronization
,deadlocks • Be familiar with multithreading. • Master concepts of memory management including virtual memory. • Master system resources sharing among the users. • Master issues related to file system interface and implementation, disk management. • Be familiar with protection and security mechanisms. • Be familiar with various types of operating systems.
UNIT-I 12 Hrs
Operating System Overview; Operating System Objectives and Functions, The Evolution of
Operating Systems, Major Achievements, Developments Leading to Modern Operating
Systems, Microsoft Windows Overview, Traditional UNIX Systems, Modern UNIX Systems,
Linux. Process Description and Control; What is a Process? Process States, Process
Description, Execution of the Operating System, Security Issues, UNIX SVR4 Process
Management, Threads, SMP, and Microkernels; Processes and Threads, Symmetric
Multiprocessing (SMP), Microkernels, Windows Vista Thread and SMP Management, Linux
Process and Thread Managements.
UNIT-II
12 Hrs Concurrency: Mutual Exclusion and Synchronization; Principles of Concurrency, Mutual
Defense, Dealing with Buffer Overflow Attacks, Windows Vista Security. Distributed
Processing, Client/server and Clusters; Client/server Computing, Distributed Message
Passing, Remote Procedure, Clusters, Windows Vista Clusters Server, Sun Cluster.
Text Book: 1) William Stallings, “Operating Systems: Internals Design and Principles”, 6th edition,
Longman, 2009.
References: 1) Gary Nut, “Operating Systems”, Third Edition, Pearson Education. 2006.
PCS123C Mathematical Foundations for Computer Science 4 Credits
Contact Hours(L-T-P-S) : 4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50
Pre-requisites: Linear Algebra, Graph Theory.
Course Outcomes:
• Compute probabilities by modeling sample spaces and applying rules of permutations and combinations, additive and multiplicative laws and conditional probability.
• Construct the probability distribution of a random variable, based on real-world situations.
• Compute probabilities based on practical situations using the binomial and normal distributions; use the normal distribution to test statistical hypotheses.
• Estimate their complexity, and to understand the theoretical results on which they are based.
• Prove elementary statements concerning the theory of systems of linear equations and Solve application problems of systems of linear equations.
• Prove elementary statements concerning the theory of matrices and determinants.
• Able to define and construct graph theoretical models and solutions to computing problem in various domains of computer science.
UNIT- I
Linear Algebraic and Transidental Equations: Fields; system of linear equations, and its
1. Ulf Troppens, Rainer Erkens and Wolfgang Muller: “Storage Networks Explained”,
Wiley India, 2007
2. Robert Spalding: “Storage Networks The Complete Reference”, Tata McGraw-
Hill, 2003.
REFERENCE BOOKS:
1. Richard Barker and Paul Massiglia: “Storage Area NetworkEssentials A
CompleteGuide to understanding and Implementing SANs”, John Wiley India,
2002.
PCS029E REAL TIME SYSTEMS 4 Credits Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisites: Basics of Computer, Operating System. Course Outcomes:
• Model real-time systems using formal models of timed behavior.
• State properties of timed system behavior.
• Explain various principles underlying automated verification.
• Use tools to assist verification of real-time properties.
• Understand selected verification techniques and know their advantages and
limitations.
• To use different abstraction levels during real-time systems development.
• Analyze scheduling aspects of real-time systems.
• Implement real-time programs on real-time operating systems.
Building Real-Time Applications with Real-Time Programming Languages.
TEXT BOOK:
1) Phillip A. Laplante,' Real- Time Systems Design and Analysis- An Engineer's Handbook,' PHI Publications, Second Edition, 2000 (Chapters 1,3,5; 6,7,8,9,10,11,13,14)
PCS224T Term Paper 2 Credits Contact Hours (L-T-P-S):0-2-2-0 CIE marks : 50
SEE marks : 50
Pre-requisites: Basics of CS Course Outcomes:
• To understand the domain of computing and research.
• To understand the issues and challenges in corresponding domain.
• Capability to analyze the existing solutions
• Explore new innovative solutions
• To improve communication and presentation abilities
• To enhance the technical writing skills.
A term paper is a research paper written by students over an academic term or semester
which accounts for a large amount of a grade and makes up much of the course. Term papers
are generally intended to describe an event or concept or argue a point. There is much overlap
between the terms "research paper" and "term paper". The phrase "term paper" was originally
used to describe a paper (usually a research based paper) that was due at the end of the "term"
- either a semester or quarter, depending on which unit of measure a school used. However,
the term has fallen out of favor. Common usage has "term paper" and "research paper" as
interchangeable, but this is not completely accurate. Not all term papers involve academic
research, and not all research papers are term papers.
PCS321C Soft Computing and Intelligent System 4 Credits Contact Hours (L-T-P-S):4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisite: Basics of Computer Science
Course Outcome:
• Identify and describe soft computing techniques and their roles in building intelligent
machines
• Recognize the feasibility of applying a soft computing methodology for a particular
problem.
• Apply fuzzy logic and reasoning to handle uncertainty and solve engineering
problems.
• Apply neural networks to pattern classification and regression problems.
• Effectively use existing software tools to solve real problems using a soft computing
approach.
• Evaluate and compare solutions by various soft computing approaches for a given
problem.
UNIT I
12 Hours Introduction to intelligent systems and soft computing:
Introduction, Intelligent systems, Knowledge-based systems, Knowledge representation and
processing, soft computing, Problems. Fundamentals of fuzzy logic systems: Introduction
Contact Hours (L-T-P-S):0-2-2-4 CIE marks : 50 Total hours : 24 SEE marks : 50 Pre-requisite: Presentation Skills
Course Outcome:
• Design/Plan Instruction
• Create/Maintain Learning
• Climates
• Implement/Manage Instructions
• Assesses and Communicates Learning Results
• Reflects/EvaluatesTeaching/Learning skills
• Engage in Professional Development
• To organize Knowledge of Content
UNIT I
6 Hrs
Scientific Basis of art of Teaching, andragogy Analysis of Adult learning, Cognitive and Social Learning Theory, Profile of Adult learning. Content Analysis: Categories of Content, facts concepts and theory of content analysis. Preparation of Content map on context. Instructional Objectives and Phases of teaching.
UNIT II
6 Hrs Instructional Planning, Writing Instructional objectives, preparing instructional resources. Types of Objectives : program, course, and classroom objectives. Establishing specific objectives. Planning by level of Instructions. Blooms Taxonomy.
UNIT III
6 Hrs Skills of Teaching : Introduction, Purpose of Introduction. Ways of Introducing a topic. Motivation. Role of motivation, in learning. Skill of explanation, Types of explanation and their requirements. Skill of questioning in class. Reasons of questioning in the class. Teaching in concept of generalization, with illustration of example, types of examples, sequencing of examples
UNIT IV 6 Hrs
Presentation skills, various methods of teaching, Ausubels advanced organization strategy, Bruner’s concept of attainment strategy. Academic standards and student assessment and evaluation : Standards, evaluate student learning , criteria for selecting tests Standardized and non standardized tests strengths and limitation, ABET Standard: For engineering teachers Reference. TEXT BOOK:
1. Strategies for Effective Teaching, Allan C. Ornstein, McGrawHill REFERENCE BOOKS:
1) A Taxonomy for Learning Teaching and Assessing, Lorin W. Anderson and David R. Krathwohl, Pearson Education
2) Andrew W Apple, 1997,Modern Compiler Implementation in C –Cambridge Theory - 2 Credits Practical (Delivery + Material preparation) - 2 Credits Allotment of topics/subject/delivery sessions:
• A student is associated with a subject teacher. • The subject teacher will assign 8 sessions (1 per week) • The teacher will assess the teaching material (including handouts) prior to the delivery. • The teacher will evaluate his delivery for every session and keep records. • The teacher will submit internal evaluation report at the end of semester Conduction of CIE: • Two CIE’s based on theory (30 Marks) • Internal evaluation of teachers (20 Marks 15 CIE Presentation + 5 Marks assignments)
Conduction of SEE: • Theory (50% of Marks) Examination for 100 Marks to be reduced to 25 Marks. • Presentation + report submission (50% of Marks) 50 Marks to be reduced to 25 Marks.
PCS007E DISTRIBUTED SYSTEMS 4 Credits Contact Hours (L-T-P-S) :4-0-0-0 CIE marks : 50 Total hours : 48 SEE marks : 50 Pre-requisite: Database Management System
Course Outcome:
• Define distributed systems (DS) and list the examples of DS such as Internet, intranet,
mobile and ubiquitous computing and need of resource sharing in the web.
• Describe and analyze the challenges of DS, architectures in DS, Internet protocols,
and inter-process communication.
• Describe how the distributed objects will communicate and how the remote method
invocation takes place in distributed objects.
• Describe the support of operating system for communication through processes and
threads and list the security techniques used for safe operation of distributed
communication.
• Explain the working of distributed file servers and distributed shared memory.
• Explain transactions, concurrency control techniques like locking, optimistic
concurrency control etc.
• Describe distributed transactions.
UNIT I 12 Hrs
Characterization of Distributed Systems and System Models: Introduction, Examples of
distributed systems, Resource sharing and the Web, Challenges, Architectural models,
Fundamental models. Networking and Internetworking: Types of Networks, Networks
principles, Internet protocols, Network case Studies (Ethernet, wireless LAN and ATM).
Interprocess Communication: Introduction, The API for the Internet protocols, External data
representation and marshalling, Client-Server communication, Group communication
UNIT II 12 Hrs
Distributed Objects and Remote Invocation : Communication between distributed objects,
Remote procedure call, events and notifications, JAVA RMI case study. Operating System
Support and Security: The Operating system layer, protection, processes and threads,
communication and invocation , operating system architecture, overview of security
techniques, cryptographic algorithms, digital signatures, cryptography pragmatics, case
studies: Needham-Schroeder, Kerberos, SSL and Millicent.
UNIT III 12 Hrs
Distributed File Systems : File service architecture, Sun Network file system, Andrew file
system, Recent advances. Transactions and Concurrency Control : Transactions, nested
transactions, locks, optimistic concurrency control, timestamp ordering, comparison of
concurrency control in distributed transactions, distributed deadlocks, transaction recovery.
Distributed Shared Memory:Design and Implementation issues, sequential consistency and
Ivy, Release consistency and Munin, other consistency models
CASE Studies: COBRA , Mach
TEXT BOOK: 1. George Coulouris, Jean Dollimore, Tim Kindberg: “Distributed Systems, Concept and
Design” , 3rd edition, Pearson Education, 2005.
Reference:
1. Andrew S. Tanenbaum & Marten van Steen, Distributed Systems – Principles and
Paradigms, PHI, 2002.
PCS324M Industrial Workshop Mandatory
Contact Hours (L-T-P-S): 0-4-4-0 CIE marks : 50 SEE marks : 50
Course Outcome:
• Industrial domain experts in computing technologies are invited to deliver
industrial processes and practices and also awareness of hands on skills.
This mode helps students to
• Build ability to apply the knowledge of science and technology, to real world
problems.
• Build an ability to design and develop solutions to industrial problems.
• Identify and formulate the engineering problems.
• Insists an ability to use the techniques, skills, and modern engineering tools
necessary for engineering practice. Thus the tutorial components enhance the
design and implementation aspects of the graduates, contributes to attainment
of programme outcomes.
Every student has to attend a training conducted by the department in collaboration with
industrial experts. CIE will be conducted during the training program. Every student has to
submit a report on training. SEE involves Presentation to Departmental evaluation
committee.
PCS325P Project Phase I
08 Credits
Contact Hours (L-T-P-S): 0-8-8-4 CIE marks : 50 SEE marks : 50
Course Outcomes:
• Facilitates the students to explore their knowledge
• Strengthens their fundamentals and build an ability to identify, formulate, and
solve engineering problems, ability to design and conduct experiments, as well
as to analyze and interpret data,
• Apply the engineering concepts to the real world problems and develop
quality software to meet the societal needs.
• Encourage the students to take up innovative research projects and work for
the solution.
The Phase I include:
1) Deciding the broad area for project work.
2) Sufficient literature Survey (Minimum of 10-15 literatures includes Research papers,
technical reports, white papers, manuals and survey reports.
3) Identification of Issues and defining problem.
4) A report containing summary of survey made covering issues and problem definition
with print outs of all literature documents.
5) Presentation on survey made.
Scheme of Evaluation for Project Phase I
CIE Evaluation
By Guide for Report writing : 50 Marks
SEE Evaluation
Report Evaluation (Survey of minimum of 25 papers of relevant research area) : 25
Marks
Seminar (Presentation) : 25 Marks
TOTAL : 100 Marks
IV SEMESTER
Sl. No
Subject Code
Subjects Name Hours / Week
C Exam Marks
L T P S CIE SEE Total 1 PCS421P Project Phase II 0 12 24 12 24 50 50 100
Total 0 12 24 12 24 50 50 100
CS421P Project Phase II 08 Credits Contact Hours (L-T-P-S): 0-12-24-12 CIE marks : 50 SEE marks : 50
Pre-requisites: Knowledge on project domain and technology. Course Outcomes:
• Facilitates the students to explore their knowledge
• Strengthens their fundamentals and build an ability to identify, formulate, and
solve engineering problems, ability to design and conduct experiments, as well
as to analyze and interpret data,
• Apply the engineering concepts to the real world problems and develop
quality software to meet the societal needs.
• Encourage the students to take up innovative research projects and work for
the solution.
Guidelines for Project Phase II and Scheme of Evaluation
CIE: 50 Marks
Project progress Presentation I 10 Marks Project progress Presentation II 10 Marks Project progress Presentation III 10 Marks Project Presentation IV 10 Marks Report Writing 10 Marks TOTAL 50 Marks
SEE out of 100 Marks: Report Evaluation and Viva voce Examination by three examiners