Seminar PPTs and Reports

For M.Tech CS VTU 1st and 2nd sem find the topics along with the report and ppts done by the students of M.Tech CS VTU:


Detection of Packet Dropping in Wireless Sensor Networks (by Amitha Ashok Minache- Acharya Institute of Technology)
            
DISCRIMINATION OF ENGLISH TO OTHER INDIAN LANGUAGES FOR OCRSYSTEM  (by Amitha Ashok Minache- Acharya Institute of Technology)        

How to download?

some more to soon follow....
subscribe to get notified

Please comment.......          

Image Credit

15:05 - By Rajshekar Targar 1

VTU M.Tech CS Question Papers

                              M.Tech VTU CS 3rd Sem Previous Question Papers



                              M.Tech VTU CS 2nd Sem Previous Question Papers


Please comment....... 

15:00 - By Rajshekar Targar 1

M.Tech 1st sem CS Syllabus (pdf)

M. Tech in Computer Science and Engineering I SEMESTER COMPUTER NETWORKS

Subject Code: 12SCS11                                                                           I.A. Marks : 50

Hours/Week : 04                                                                                    Exam Hours: 03

Total Hours : 52                                                                                      Exam Marks: 100

1. Review of Basic Concepts: Building a Network; Requirements- Connectivity, Cost-Effective Resource Sharing, Support for Common Services; Network Architecture- Layering and Protocols, OSI Architecture, Internet Architecture; Performance- Bandwidth and Latency, Delay× Bandwidth Product, High-Speed Networks.

2. Direct link networks: Hardware Building Blocks-nodes, links; error Detection- Two-Dimensional Parity, Internet checksum Algorithm, cyclic Redundancy Check; reliable Transmission- Stop-and-Wait, Sliding Window, Concurrent Logical Channels; Rings (802.5, FDDI) –Token Ring Media Access Control, Token Ring Maintenance, FDDI.

3. Packet Switching: Switching and forwarding – Datagrams,Virtual Circuit Switching, Source Routing; Bridges and LAN Switches – Learning Bridges, Spanning Tree Algorithm, Broadcast and Multicast, Limitations of Bridges; cell switching (ATM) – Cells, Segmentation and Reassembly, Virtual Paths, Physical Layers for ATM.

Image credit

4.  Internetworking:  Simple  internetworking  (IP)  –  What  Is  an  Internetwork?,  Service  Model,  Global  Address, Datagram Forwarding in IP, Address Translation(ARP),  Host Configuration(DHCP),  Error Reporting(ICMP),  Virtual Networks and Tunnels; Routing – Network as a Graph, distance Vector(RIP), Link State(OSPF), Metrics, Routing for Mobile Hosts, Global Internet – Subnetting, Classless Routing(CIDR), Interdomain Routing(BGP), Routing Areas, IP Version 6(IPv6).

5. End –to-End Protocols: Simple demultiplexer (UDP); Reliable byte stream (TCP) – End-to-End Issues, Segment Format, Connection Establishment and Termination, Sliding Window Revisited, Triggering Transmission, Adaptive Retransmission, Record Boundaries, TCP Extensions, Alternative Design Choices.

6.  Congestion  Control  and  Resource  Allocation:  Issues  in  resource  allocation  –  Network  Model,  Taxonomy, Evaluation  Criteria;  Queuing  discipline  –  FIFO,  Fair  Queuing;  TCP  Congestion  Control  –  Additive Increase/Multiplicative    Decrease,   Slow   Start,   Fast   Retransmit   and   Fast   Recovery;   Congestion-Avoidance mechanisms – DECbit, Random Early Detection (RED), Source-Based Congestion Control.

7. Applications: Traditional applications – Electronic Mail (SMTP, MIME, IMAP), World Wide Web (HTTP), Name Service (DNS), Network management (SNMP); Web services – Custom APPLICATION Protocols (WSDL, SOAP), A Generic application Protocol (REST).

The above is sample. Click on Download to get the complete 

syllabus

                       DOWNLOAD

                                                    How to download?

Please comment....... 

19:47 - By Rajshekar Targar 0

M.Tech 2nd sem CS Syllabus (pdf)

 M. Tech in Computer Science and Engineering II Semester

Formal Models in Computer Science

Subject Code : 12SCS21                                                                                      IA Marks : 50

No of Lecture Hrs/Week : 4                                                                                Exam hours : 3

Total No of Lecture Hours : 52                                                                            Exam Marks : 100

1. Propositional Logic

Declarative  sentences,  Natural  deduction,  Propositional  logic  as  a  formal  language,  Semantics  of propositional logic, Normal forms.

Image credit

2. Predicate Logic

The need for a richer language,  Predicate logic as a formal language, Proof theory of predicate logic, Semantics of predicate logic, Undecidability of predicate logic, Micromodels of software.

3. Verification by Model Checking

Motivation  for verification,  Linear-time  temporal  logic, Model checking,  Branching-time  logic, CTL*

and the expressive powers of LTL and CTL.

4. Program Verification

Need for specifying and verifying code, A framework for software verification, Proof calculus for partial correctness and total correctness, Programming by contract.

5. Introduction to Z: Basic concepts; Z notation in Propositional logic and Predicate logic.

Laboratory Work:

1. Design, develop and run a program in ALLOY (or in any equivalent  system)  to model a Software Package Dependency System. Make suitable assumptions regarding the system. The model should allow checking to see if prerequisites in the form of libraries or other packages are present for all components in the system

2. Design, develop and run a program in NuSMV (or in any equivalent system) to model and solve the

Mutual Exclusion problem.

3. Design, develop and run a program in NuSMV (or in any equivalent system) to model and simulate the

Alternate Bit Protocol.

4. Design, develop and run a program in NuSMV (or in any equivalent system) to model and solve the planning problem of Ferry Man.

5. Design, develop and run a program in NuSMV (or in any equivalent system) to model and solve the

Dining Philosophers Problem.

Text Books:

1. Michael Huth and Mark Ryan: Logic in Computer Science, 2nd Edition, Cambridge University Press,

2004.

2. Jim Woodcock , Jim Davies: Using Z Specification, Refinement and Proof, Prentice Hall, 1996. (Online Edition: http://www.usingz.com/text/online/)

The above is sample. Click on Download to get the complete 

syllabus

                       DOWNLOAD

                 
                                                       How to download?

Please comment....... 

19:46 - By Rajshekar Targar 0