Thursday 13 December 2012

UGC NET EXam JUNE 2012

1. Consider the following pseudocode segment :
K:=0
for i1:= 1 to n
for i2:= 1 to i1
:
:
:
for im:= 1 to im–1
K:= K+1
The value of K after the execution of this code shall be

(A) C(n + m – 1, m)
(B) C(n – m + 1, m)
(C) C(n + m – 1, n)
(D) C(n – m + 1, n)

For answer its better to put values
Here m denotes number of for loop and n denotes number of iteration. To simplify the problem we take n=3 and m=2 so by implementing the above code in C language, we get the below code

#include<stdio.h>
void main()
{
int i,m,n=3,k=0;
for(i=1;i<=n;i++)
{
for(m=1;m<=i;m++)
{
k=k+1;
}
}
printf("the value for k is %d",k);
}

when the code is executed the value of K=6
For the given answer (A) C(n+m-1,m) = C(3+2-1,2) = C(4,2) => 4C2 => 4!/2!(4!-2!) = 6
2. In Delta Rule for error minimization
(A) weights are adjusted w.r.to change in the output
(B) weights are adjusted w.r.to difference between desired output and actual output
(C) weights are adjusted w.r.to difference between input and output
(D) none of the above

The topic comes in Artificial Neural Networks(ANN). In which it is applied as option B, so i think it is B.
 

3. The concept of pipelining is most effective in improving performance if the tasks being performed in different stages :
(A) require different amount of time
(B) require about the same amount of time
(C) require different amount of time with time difference between any two tasks being same
(D)require different amount of time with time difference between any two tasks being different

Pipelining

build very fast processors. It allows the execution of multiple instruction by overlapping. In an assembly unit every stage has one and only one activity to do. In the same way in a instruction pipeline at every clock cycle one particular step of multiple instruction will be performed. Every instruction has multiple stages. Say at the first clock cycle first step of instruction1 is performed. At the second clock cycle the second step of instruction1 and 1st step of instruction2 would be performed and so on. so if the task requires about same amount of time then only we can arrange the pipelining better without hazards, hence option B is right.
4. What is Granularity ?
(A) The size of database
(B) The size of data item
(C) The size of record
(D) The size of file

A data item can be tuple, relation, database anything, so Granularity will lead to size of an data item.


5. Suppose that a given application is run on a 64-processor machine and that 70 percent of the application can be parallelized. Then the expected performance improvement using Amdahl’ s law is
(A) 4.22
(B) 3.22
(C) 3.32
(D) 3.52

According to Amdahl, if P is the proportion that can be made parallel, then (1-P) is the program which can not made parallel, then the maximum speedup is S = 1/(1-P)+P/N where N refers to the no of processors, and P refers to the proportion that can be parallelized. Here Processor is 64-bit so N=64, and P=74, putting
1/(1 - 0.7) + 0.7/64 = 1/0.3+0.0109375 = 1/0.310975 = 3.215 = 3.22.
6. If two fuzzy sets A and B are given with membership functions
μA(x) = {0.2, 0.4, 0.8, 0.5, 0.1}
μB(x) = {0.1, 0.3, 0.6, 0.3, 0.2}
Then the value of μ complement(A∩B) will be
(A) {0.9, 0.7, 0.4, 0.8, 0.9}
(B) {0.2, 0.4, 0.8, 0.5, 0.2}
(C) {0.1, 0.3, 0.6, 0.3, 0.1}
(D) {0.7, 0.3, 0.4, 0.2, 0.7}

Fuzzy intersection is (min[μA,μB]) , Here complemet asked so answer will be 1-(min[μA,μB])

so, for
Ist value = 1-(min(0.2,0.1)) = 0.9
IInd value = 1-(min(0.4,0.3)) = 0.7
IIIrd value = 1-(min(0.8,0.6)) = 0.4
IVth value = 1-(min(0.5,0.3)) = 0.7
Vth value = 1-(min(0.1,0.2)) = 0.9
So ans is {0.9,0.7,0.4,0.7,0.9} so none of the above is correct.

Saturday 8 December 2012

GATE CS papers solved with explanation

Gateforum :
http://www.gateforum.com/gatepapers/CS-GATE-2012.pdf
http://www.gateforum.com/gatepapers/CS-GATE-2011.pdf
http://gateforum.com/gatepapers/CS-2010.pdf
http://gateforum.com/gatepapers/CS-2009.pdf
http://gateforum.com/gatepapers/CS-2008.pdf
http://gateforum.com/gatepapers/CS-2007.pdf
http://gateforum.com/gatepapers/CS-2006.pdf
http://gateforum.com/gatepapers/CS-2005.pdf
http://gateforum.com/gatepapers/CS-2004.pdf
http://gateforum.com/gatepapers/CS-2003.pdf
http://gateforum.com/gatepapers/CS-2002.pdf
http://gateforum.com/gatepapers/CS-2001.pdf



You can download and read, enjoy

Friday 7 December 2012

Multimedia Technology

Topic

The topic of the course is digital audio and video, different interchange formats, multimedia hardware, multimedia software, multimedia communications, video conference, and multimedia systems. The aim is to teach the basics of multimedia technology and its effects to communications and computation technology.

Staff

Prof. Petri Vuorimaa (tel.  451 4794 , email Petri.Vuorimaa@hut.fi) is the responsible teacher and the main assistant of the course is Jussi Teirikangas (email Jussi.Teirikangas@hut.fi).

Lecture Topics

The preliminary topics and dates of the lectures are (links to the lecture slides will be available later):

21.1 Arrangements (slides & handouts)

  • topic
  • staff
  • general
  • requirements
  • book
  • lectures hours
  • lectures
  • laboratory exercises

28.1 Introduction (slides & handouts)

  • What is multimedia
  • Multimedia systems
  • Quality of service
  • Synchronization & orchestration
  • Standards
  • Convergence
  • Value chain

11.2 Hardware (slides & handouts)

  • Multimedia computers
  • Video and graphics
  • Audio
  • Telephone, video conference, and networks
  • CD and DVD
  • USB and FireWire
  • Processors
  • Video for Windows, DirectX, and ActiveMovie

18.2 Software (slides & handouts)

  • Introduction
  • Browser based software architecture
  • Distributed software
  • Servers
  • Network
  • Terminals

25.2 Audio and Video I (slides & handouts)

  • Introduction
  • Digital audio
  • Psycho acoustics
  • Digital presentation of sound
  • Digital images
  • JPEG

11.3 Audio and Video II (slides & handouts)

  • Video signal
  • Camera sensors
  • Colors
  • Color television
  • Equipment
  • Compression systems
  • Basics of video compression
  • Methods
  • Algorithms

18.3 Interchange Formats (slides & handouts)

  • Introduction
  • Application areas
  • Requirements
  • Track and object model
  • Real-time transfer
  • Different transfer formats
  • Comparison

1.4 Authoring Tools (slides & handouts)

  • Introduction
  • Production process
  • Tools
  • Barriers
  • Development areas

8.4 Communications (slides & handouts)

  • QoS
  • ATM
  • QoS implementations
  • Integrated Services
  • Differentiated Services

22.4 Multicast (slides & handouts)

  • Introduction
  • Group control
  • Routing
  • Real-time transfer and control protocols
  • Resource reservation
  • Session control
  • MBone

29.4 Video Conference (slides & handouts)

  • Introduction
  • Standards
  • Products
  • Internet telephony
  • CTI (Computer Telephony Integration)

6.5 Access Networks (slides & handouts)

  • Introduction
  • Cable television
  • Digital subscriber lines
  • UMTS
  • Digital television
  • Conclusions

Thursday 6 December 2012

Microprocessor and Assembly

Programming Languages

Programming Languages and Their Implementation Pro Instructor : Ruth Anderson
Textbook : The Scheme Programming Language R. Kent Dybvig Third Edition
   

Image Processing

Lecture Notes On Digital Image Processing

Digital Image Processing
Introductions and Fundamentals   Lecture 01
Intensity Transformations and Spatial Filtering  Lecture 02
Filtering in the Frequency Domain  Lecture 03
Image Restoration & Reconstruction  Lecture 04
Morphological Image Processing   Lecture 05
Image Segmentation   Lecture 06
Color Image Processing  Lecture 07
Image Compression   Lecture 08
Wavelet Transform   Lecture 09

Theory of computation


Theory of Computation

Instructor :emanuele Viola

Overview of class.
Slides .PDF, .ODP.


Math primer. Reading: Sipser Chapter 0. Think like the pros, sections 1,2, and 4.4.
Slides .PDF, .ODP.
Regular languages and finite automata. Reading: Sipser Chapter 1.
Slides .PDF, .ODP.

DFAs ,regular operations
closure properties ,non-determinism, equivalence of NFAs and DFAs
regular expressions,equivalence of RE and FA, the pumping lemma
Context-free languages and pushdown automata. Reading: Sipser Chapter 2.
Slides .PDF, .ODP.

-context-free grammars
-ambiguity
-pushdown automata
-equivalence of CFLs and PDAs
-pumping lemma for CFLs
-closure properties
Turing Machines and Computability. Reading: Sipser Chapter 3, 4, 5, and Problem 5.28.
Slides .PDF, .ODP.

-Turing Machine variants
-Church-Turing thesis
-cardinality of infinite sets
-diagonalization
-undecidability
-Halting Problem
-reducibility
-Rice’s theorem
Complexity. Reading: Sipser Chapter 7.
Slides .PDF, .ODP.

Foundations of Computer Science

Graph Theory

Computer Graphics

Software Engineering ppt

Introduction to Software Engineering PPT and PDF SLIDES


Introduction to Software Engineering

Instructor: Steven A.Demurjian

Textbook: C++ programming with design patterns revealed. By Thomasz Müldner. Addison-Wesley
Textbook2:ANSI C Library Reference Guide
Download Slides from here

CSE230 Introductory Overheads (PPT)
FUNDAMENTALS OF SOFTWARE ENGINEERING OVERHEADS
SOFTWARE ARCHITECTURES 
UML: UNIFIED MODELING LANGUAGE 
SOFTWARE SPECIFICATION
  • Reading - The Specification Process: PDF

  • Overheads:  PDF
ASPECT-ORIENTD SOFTWARE DESIGN AND PROGRAMMING
 Overheads (PPT)