BOX
Tuesday, August 9, 2011
Tuesday, June 14, 2011
NETWORKING EVENING PAPER
Paper consists of 3 sections:
section 1: (20 marks)
Q1: given 32 bit hex value, pass it through E/P table. E/P table was not given.
Q2: RSA algorithm. e = 7, p = 5, q = 11. Message in binary = (1000), find plain-text, cipher-text, d, z
Q3: Given 64 bit hex value, pass it through IP table, IP table was given.
section 2: (26 marks)
- configuration of pvlan with example.
- difference between MAC and one way. Hash value
- explain briefly working of ipsec AH and ESP in tunnel and transport mode. support AH in transport and tunnel mode.
- briefly explain the making of digital signature.
- differentiate the following.
- confusion and diffusion
- private key authority and private key certificate
- circuit level gateway and application level gateway firewall
(few more questions,,, i don't remember..)
section 3: (16 marks)
14 mcq's, 2 fill in the blanks
NOTE: Major part of the paper was from IPSEC.
Q no 1.
given input of binary number : 00001111101010100
32 bit in DEs passing from E/p table
Q no 1 a
input :11223344556677
in hexadecimail PASsing from PC-1 given TABLe !
Q no 2.
Digital signature ?? Explain
Q no. 3
RSA LAB Question , n=55 , p=5, q =11, E= 7
message M =(1000) in binary convert into Ciper txt
Q no 4,
difference b/w
Tunnel mode and transparent mode
Q
no 5.
difference b/w MAC and IPsec
Q no 6
breifly explain about
a.message authentication
tunnel mode
ipsec .
Qno 8
configure PVLAN of its step with example .
Q no 9
MCQ of 20 marks
protected ports . pvlan, MD5 ,RSA , IPSEC ,
Saturday, June 4, 2011
MIS
Monday, May 30, 2011
PC COURSE OUTLINE
Parallel Computing - Course Plan
1. Introduction
What is Parallel Computing, Motivation why Parallel Computing? Link with other technologies.
Module 1 – Instruction Level Parallelism (ILP)
2. MPIS/DLX Architecture
Overview of Processor Architecture , Instruction Set Architecture , Instruction encoding
3. ILP – Instruction Level Parallelism
Overview of MIPS/DLX Pipelining, Structural Hazards, Control Hazards, Data Hazards
4. Pipeline Code Scheduling
Techniques to avoid and remove Pipeline Hazards – Static Code Rescheduling and Loop unrolling
5. Dynamic Code Rescheduling Techniques (Score Boarding, Tomasolo)
6. Code Scheduling on Multi-issue processors
Superscalar and VLIW architecture & code scheduling, comparison with Array and Vector Processors
Module 2 - PRAM ( Parallel Random Access Machines)
7. PRAM Algorithms
Overview of Parallel Random Access Machine, PRAM Models, EREW PRAM Algorithms
8. Analysis of ERCW-PRAM, Algorithms
9. Analysis of CRCW-PRAM Algorithms
10. Analysis of CREW-PRAM Algorithms
Module 3 – Cluster Computing
11. Cluster Computing
Cluster Computing, GRID Computing, Overview of Available tools, Overview of Message Passing Systems & Applications.
12. MPI Cluster – Programming
Overview of Message Passing Interface,
Installation and Configuration of MPI Cluster
13. MPI Programming Examples,
Analysis of MPI Algorithms
14. Implementing PRAM algorithms through MPI
15. Review
Review of the course
Books:
“Fundamentals of Parallel Processing”, Harry F,Gita , Prentice Hall 2003
“Interlocution to Parallel Computing” W.P. Peterson, P.Abenz , Oxford University Press - 2004
“Parallel Scientific Computing in C++ and MPI”, G.E. Karniadakis, Cambridge University Press- 2003
“Distributed and Parallel Computing”, Hesham ElRewini, Manning Greenwich 1998
“Computer Architecture – A Qantitative Approach”, Patterson,Hennessy, Morgan Kaufmann - 2006=
Saturday, May 28, 2011
Friday, May 20, 2011
[CSKU2008-2011a] Course Outline - 601
|
--
<\b> (- \> \> !
Monday, May 16, 2011
STATS ASSIGNMENT 2011 (for repeters and improvers also)
BSCS Section A and B
Assignment III is here
Due Date 15.04.2011 for both Sec A and Sec B
Assignment II is here
Due Date Section A
Section B
Assignment 1
Due Date Section A
Section B
- Define Statistics and discuss application of statistics in various fields of life.
- Explain difference between Population and Sample by giving example
- Describe nominal, ordinal interval and ratio data type by giving examples of each
- Attempt Exercises (chapter 1 )2-5, 9 and 10 of supplementary exercise given on page 11 of reference notes
- Attempt (Chapter 2) supplementary Exercises 39, 41, 48, 46 given on page 51 of reference notes
Thursday, May 5, 2011
[csku2008b] Fw: Final Lab - Inform All
BSCS- 601
Lab Tasks
Multi Threading
isBackground property
Thread Priority
Other implementation aspects discussed in the class
Synchronization
Lock
Interlocked class
Sempahore
Binary semaphore
Counting semaphore
Monitor
.NET Remoting
Application Domain
Context
Serialization
Marshalling
Well Known Singleton
Windows service
All assignments given during the lectures
Please make sure you all these tasks in the lab file on Saturday, May 7 2011 (Final Lab). Timings will be communicated to the respective CR's. No class this week

