SAP Portal | SAP ABAP | Training | SAP JOBS | Technical | Functional | Tutorial | Articles

WWW.CTET.NIC.IN | Central Teacher Eligibility Test - CTET Announcement 2012

2011-11-23T22:42:00.000+05:30

1. Please read the instructions and procedures carefully before you start filling the Online Application Form.

2. Application Procedure: The online submission of particulars may be made at website www.ctet.nic.in. The candidates should supply all the required details while filling up the online form. On submission of details, a Confirmation page with Registration No. shall be generated. Candidates are required to take printout of Confirmation page and paste photograph, sign in the space earmarked for the purpose. The confirmation Page is to be sent by Registered/Speed Post to CBSE (NOT BY COURIER) to “ The Assistant Secretary (CTET Unit), Central Board of Secondary Education, ‘Shiksha Sadan’, 17, Rouse Avenue, New Delhi – 110002” along with original Demand Draft (if fee paid by Demand Draft) for further processing so as to reach latest by 30.11.2011 . Application received beyond this date will not be accepted. Payment can be made as follows by Credit/Debit Card or Demand Draft in favour of the Secretary, Central Board of Secondary Education, Delhi drawn in any Nationalized Bank payable at Delhi. Write your Name, Address, Mobile No. and Registration No. on the back of the demand draft.

3. Examination Fees
Fee Amount in Rs.

General / OBC Category Rs. 500 /- (Five hundered)

SC / ST / Differently Abled Category Rs. 250 /- (Two hundered Fifty)

4.Application can be submitted Online during 01.11.2011 to 25.11 .2011.

5.Payment of Fee could be made by Demand Draft or Credit/Debit Card.

Steps to be followed if fee paid through Demand Draft

If you want to remit the fee by Demand Draft, get ready before filling application form.

Demand Draft in favour of the Secretary, Central Board of Secondary Education, Delhi drawn in any Nationalized Bank payable at Delhi. Write your Name, Address, Mobile No. and Registration No. on the back of the demand draft.

Logon to the CTET website, fill the application form, note down the registration number which would be generated by system that is required for making the payment of fee.
Fill the details of Demand Draft.

Take a printout of Confirmation Page and complete as per the instruction given above.

Steps to be followed if fee paid through Credit/Debit Card

Keep the details of Credit/Debit Card (VISA/MasterCard) ready.

Logon to the CTET website, fill the application form, note down the registration number which would be generated by system that is required for making the payment of fee.

Make the payment through Credit Card and note down the payment receipt number, after successful payment of fee.

Take a printout of Confirmation Page and complete as per the instruction given above.

Note : Bank will charge 2% service/processing charges and service tax as applicable on transaction made by Credit card.

Anna University Chennai - Semester Eight Curriculam With Solutions

2011-04-09T09:41:00.002+05:30

Anna university chennai : : chennai – 600 025
affiliated institutions
b.tech. (8 semester) information technology
curriculum – r 2008
semester vi
(applicable to the students admitted from the academic year 2008–2009 onwards)
code no. Course title l t p c
theory
it2351 network programming and management 3 0 0 3
cs2353 object oriented analysis and design 3 0 0 3
it2352 cryptography and network security 3 1 0 4
it2353 web technology 3 0 0 3
it2354 embedded systems 3 0 0 3
elective i 3 0 0 3
practical
it2357 web technology lab 0 0 3 2
cs2357 object oriented analysis and design lab 0 0 3 2
cs2307 network lab 0 0 3 2
total 18 1 9 25
semester vii
(applicable to the students admitted from the academic year 2008–2009 onwards)
code no. Course title l t p c
theory
it2401 service oriented architecture 3 0 0 3
it2402 mobile communication 3 0 0 3
cs2401 computer graphics 3 0 0 3
it2403 software project management 3 0 0 3
elective ii 3 0 0 3
elective iii 3 0 0 3
practical
it2406 service oriented architecture lab 0 0 3 2
cs2405 computer graphics lab 0 0 3 2
total 18 0 6 22
2
semester viii
(applicable to the students admitted from the academic year 2008–2009 onwards)
code no. Course title l t p c
theory
elective iv 3 0 0 3
elective v 3 0 0 3
practical
it2451 project work 0 0 12 6
total 6 0 12 12
list of electives
semester vi – elective i
code no. Course title l t p c
ma2264 numerical methods 3 1 0 4
ma2265 discrete mathematics 3 1 0 4
it2021 business process model 3 0 0 3
it2022 software requirement engineering 3 0 0 3
it2023 digital image processing 3 0 0 3
it2024 user interface design 3 0 0 3
cs2022 visual programming 3 0 0 3
cs2032 data warehousing and data mining 3 0 0 3
semester vii – elective ii
code no. Course title l t p c
cs2303 theory of computation 3 1 0 4
cs2029 advanced database technology 3 0 0 3
it2031 electronic commerce 3 0 0 3
it2032 software testing 3 0 0 3
it2033 bio informatics 3 0 0 3
it2034 adhoc sensor network 3 0 0 3
3
semester vii – elective iii
code no. Course title l t p c
cs2351 artificial intelligence 3 0 0 3
it2041 enterprise resource planning 3 0 0 3
it2042 information security 3 0 0 3
it2043 knowledge management 3 0 0 3
cs2063 grid computing 3 0 0 3
cs2041 c# and .net framework 3 0 0 3
semester viii – elective iv
code no. Course title l t p c
it2050 principles of compiler design 3 0 0 3
it2051 knowledge engineering 3 0 0 3
ge2021 professional ethics in engineering 3 0 0 3
ge2071 intellectual property rights 3 0 0 3
it2052 management information system 3 0 0 3
it2053 software design 3 0 0 3
cs2053 soft computing 3 0 0 3
semester viii – elective v
code no. Course title l t p c
ge2022 total quality management 3 0 0 3
ge2072 indian constitution and society 3 0 0 3
it2061 system modeling and simulation 3 0 0 3
cs2035 natural language processing 3 0 0 3
cs2056 distributed systems 3 0 0 3
ge2023 fundamentals of nanoscience 3 0 0 3
it2064 speech signal processing 3 0 0 3
4
it2351 network programming and management lt p c
3 0 0 3
unit i elementary tcp sockets 9
introduction to socket programming – overview of tcp/ip protocols –introduction to
sockets – socket address structures – byte ordering functions – address conversion
functions – elementary tcp sockets – socket, connect, bind, listen, accept, read, write,
close functions – iterative server – concurrent server.
Unit ii application development 9
tcp echo server – tcp echo client – posix signal handling – server with multiple
clients – boundary conditions: server process crashes, server host crashes, server
crashes and reboots, server shutdown – i/o multiplexing – i/o models – select function
– shutdown function – tcp echo server (with multiplexing) – poll function – tcp echo
client (with multiplexing).
Unit iii socket options, elementary udp sockets 9
socket options – getsocket and setsocket functions – generic socket options – ip socket
options – icmp socket options – tcp socket options – elementary udp sockets – udp
echo server – udp echo client – multiplexing tcp and udp sockets – domain name
system – gethostbyname function – ipv6 support in dns – gethostbyadr function –
getservbyname and getservbyport functions.
Unit iv advanced sockets 9
ipv4 and ipv6 interoperability – threaded servers – thread creation and termination –
tcp echo server using threads – mutexes – condition variables – raw sockets – raw
socket creation – raw socket output – raw socket input – ping program – trace route
program.
Unit v simple network management 9
snmp network management concepts – snmp management information – standard
mib’s – snmpv1 protocol and practical issues – introduction to rmon, snmpv2 and
snmpv3.
Total = 45 periods
text books:
1. W. Richard stevens, “unix network programming vol-i”, second edition, pearson
education, 1998.
2. Mani subramaniam, “network management: principles and practice“, addison
wesley”, first edition, 2001.
References:
1. D.e. Comer, “internetworking with tcp/ip vol- iii”, (bsd sockets version), second
edition, pearson education, 2003.
2. William stallings, “snmp, snmpv2, snmpv3 and rmon 1 and 2”,third edition,
addison wesley, 1999.
5
cs2353 object oriented analysis and design l t p c
3 0 0 3
objectives:
to learn basic oo analysis and design skills through an elaborate case study.·
to use the uml design diagrams·
to apply the appropriate design patterns·
unit i 9
introduction to ooad – what is ooad? – what is uml? What are the united
process(up) phases - case study – the nextgen pos system, inception -use case
modeling - relating use cases – include, extend and generalization.
Unit ii 9
elaboration - domain models - finding conceptual classes and description classes –
associations – attributes – domain model refinement – finding conceptual class
hierarchies- aggregation and composition- uml activity diagrams and modeling
unit iii 9
system sequence diagrams - relationship between sequence diagrams and use cases
logical architecture and uml package diagram – logical architecture refinement - uml
class diagrams - uml interaction diagrams
unit iv 9
grasp: designing objects with responsibilities – creator – information expert – low
coupling –controller – high cohesion – designing for visibility - applying gof design
patterns – adapter, singleton, factory and observer patterns.
Unit v 9
uml state diagrams and modeling - operation contracts- mapping design to code -uml
deployment and component diagrams
total = 45 periods
text book:
1. Craig larman,"applying uml and patterns: an introduction to object-oriented analysis
and design and iterative development”, third edition, pearson education, 2005
references:
1. Mike o’docherty, “object-oriented analysis & design: understanding system
development with uml 2.0”, john wiley & sons, 2005.
2. James w- cooper, addison-wesley, “java design patterns – a tutorial”, 2000.
3. Micheal blaha, james rambaugh, “object-oriented modeling and design with uml”,
second edition, prentice hall of india private limited, 2007
4. Erich gamma, richard helm, ralph johnson, john vlissides,“design patterns:
elements of reusable object-oriented software”, addison-wesley, 1995.
6
it2352 cryptography and network security l t p c
3 1 0 4
unit i 9
security trends – attacks and services – classical crypto systems – different types of
ciphers – lfsr sequences – basic number theory – congruences – chinese
remainder theorem – modular exponentiation – fermat and euler's theorem – legendre
and jacobi symbols – finite fields – continued fractions.
Unit ii 9
simple des – differential cryptoanalysis – des – modes of operation – triple des –
aes – rc4 – rsa – attacks – primality test – factoring.
Unit iii 9
discrete logarithms – computing discrete logs – diffie-hellman key exchange –
elgamal public key cryptosystems – hash functions – secure hash – birthday attacks -
md5 – digital signatures – rsa – elgamal – dsa.
Unit iv 9
authentication applications – kerberos, x.509, pki – electronic mail security – pgp,
s/mime – ip security – web security – ssl, tls, set.
Unit v 9
system security – intruders – malicious software – viruses – firewalls – security
standards.
Total = 60 periods
text books:
1. Wade trappe, lawrence c washington, “ introduction to cryptography with coding
theory”, 2nd ed, pearson, 2007.
2. William stallings, “crpyptography and network security principles and practices”,
pearson/phi, 4th ed, 2006.
References:
1. W. Mao, “modern cryptography – theory and practice”, pearson education, second
edition, 2007.
2. Charles p. Pfleeger, shari lawrence pfleeger – security in computing third edition –
prentice hall of india, 2006
7
it2353 web technology lt p c
3 0 0 3
unit i 9
web essentials: clients, servers, and communication. The internet-basic internet
protocols -the world wide web-http request message-response message-web
clients web servers-case study. Markup languages: xhtml. An introduction to html
history-versions-basic xhtml syntax and semantics-some fundamental html
elements-relative urls-lists-tables-frames-forms-xml creating html documents
case study.
Unit ii 9
style sheets: css-introduction to cascading style sheets-features-core syntax-style
sheets and html style rle cascading and inheritance-text properties-box model
normal flow box layout-beyond the normal flow-other properties-case study. Client-
side programming: the javascript language-history and versions introduction
javascript in perspective-syntax-variables and data types-statements-operators-
literals-functions-objects-arrays-built-in objects-javascript debuggers.
Unit iii 9
host objects : browsers and the dom-introduction to the document object model dom
history and levels-intrinsic event handling-modifying element style-the document
tree-dom event handling-accommodating noncompliant browsers properties of
window-case study. Server-side programming: java servlets- architecture -overview-a
servelet-generating dynamic content-life cycle-parameter data-sessions-cookies-
url rewriting-other capabilities-data storage servelets and concurrency-case study-
related technologies.
Unit iv 9
representing web data: xml-documents and vocabularies-versions and declaration -
namespaces javascript and xml: ajax-dom based xml processing event-oriented
parsing: sax-transforming xml documents-selecting xml data:xpath-templatebased
transformations: xslt-displaying xml documments in browsers-case study-
related technologies. Separating programming and presentation: jsp technology
introduction-jsp and servlets-running jsp applications basic jsp-javabeans classes
and jsp-tag libraries and files-support for the model-view-controller paradigm-case
study-related technologies.
Unit v 9
web services: jax-rpc-concepts-writing a java web service-writing a java web
service client-describing web services: wsdl- representing data types: xml
schema-communicating object data: soap related technologies-software
installation-storing java objects as files-databases and java servlets.
Total = 45 periods
text book:
1. Jeffrey c.jackson, "web technologies--a computer science perspective", pearson
education, 2006.
8
references:
1. Robert. W. Sebesta, "programming the world wide web", fourth edition, pearson
education, 2007.
2. Deitel, deitel, goldberg, "internet & world wide web how to program", third
edition, pearson education, 2006.
3. Marty hall and larry brown,”core web programming” second edition, volume i
and ii, pearson education, 2001.
4. Bates, “developing web applications”, wiley, 2006.
It2354 embedded systems l t p c
3 0 0 3
unit i embedded computing 9
challenges of embedded systems – embedded system design process. Embedded
processors – 8051 microcontroller, arm processor – architecture, instruction sets and
programming.
Unit ii memory and input / output management 9
programming input and output – memory system mechanisms – memory and i/o
devices and interfacing – interrupts handling.
Unit iii processes and operating systems 9
multiple tasks and processes – context switching – scheduling policies – interprocess
communication mechanisms – performance issues.
Unit iv embedded software 9
programming embedded systems in assembly and c – meeting real time constraints –
multi-state systems and function sequences. Embedded software development tools –
emulators and debuggers.
Unit v embedded system development 9
design issues and techniques – case studies – complete design of example embedded
systems.
Total = 45 periods
text books:
1. Wayne wolf, “computers as components: principles of embedded computer
system design”, elsevier, 2006.
2. Michael j. Pont, “embedded c”, pearson education , 2007.
References:
1. Steve heath, “embedded system design”, elsevier, 2005.
2. Muhammed ali mazidi, janice gillispie mazidi and rolin d. Mckinlay, “the 8051
microcontroller and embedded systems”, pearson education, second edition, 2007.
9
it2357 web technology lab l t p c
0 0 3 2
list of experiments
1.create a web page with the following using html
i) to embed an image map in a web page
ii) to fix the hot spots
iii) show all the related information when the hot spots are clicked.
2. Create a web page with all types of cascading style sheets.
3. Client side scripts for validating web form controls using dhtml
4. Write programs in java to create applets incorporating the following features:
create a color palette with matrix of buttons·
set background and foreground of the control text area by selecting a color from·
color palette.
In order to select foreground or background use check box control as radio·
buttons
to set background images·
5. Write programs in java using servlets:
to invoke servlets from html forms·
to invoke servlets from applets·
6. Write programs in java to create three-tier applications using jsp and databases
for conducting on-line examination.·
for displaying student mark list. Assume that student information is available in a·
database which has been stored in a database server.
7. Programs using xml – schema – xslt/xsl
8. Program using dom / sax
9. Programs using ajax
10. Consider a case where we have two web services- an airline service and a travel
agent and the travel agent is searching for an airline. Implement this scenario using
web services and data base.
Total = 45 periods
requirement for a batch of 30 students
s. No. Description of equipment quantity required
1.
Hardware:
pentium iv with 2 gb ram,
160 gb hard disk,
monitor 1024 x 768 colour
60 hz.
30 nodes
2.
Software:
windows /linux operating system
jdk 1.6(or above)
ajax
oracle 9i(or above version) / microsoft
access
30 user license
10
cs2357 object oriented analysis and design lab l t p c
0 0 3 2
objective:
to develop a mini-project following the 12 exercises listed below.
1. To develop a problem statement.
2. Develop an ieee standard srs document. Also develop risk management and
project plan (gantt chart).
3. Identify use cases and develop the use case model.
4. Identify the business activities and develop an uml activity diagram.
5. Identity the conceptual classes and develop a domain model with uml class
diagram.
6. Using the identified scenarios find the interaction between objects and represent
them using uml interaction diagrams.
7. Draw the state chart diagram.
8. Identify the user interface, domain objects, and technical services. Draw the
partial layered, logical architecture diagram with uml package diagram notation.
9. Implement the technical services layer.
10. Implement the domain objects layer.
11. Implement the user interface layer.
12. Draw component and deployment diagrams.
Total = 45 periods
suggested domains for mini-project.
1. Passport automation system.
2. Book bank
3. Exam registration
4. Stock maintenance system.
5. Online course reservation system
6. E-ticketing
7. Software personnel management system
8. Credit card processing
9. E-book management system
10. Recruitment system
11. Foreign trading system
12. Conference management system
13. Bpo management system
suggested software tools
argouml, eclipse ide, visual paradigm, visual case, and rational suite
requirement for a batch of 30 students
s. No. Description of equipment quantity
required
1. Software tools
argouml, eclipse ide, visual
paradigm, visual case, and rational
suite
30 user license
2. Pc’s 30
11
cs2307 network lab l t p c
0 0 3 2 1. Programs using tcp sockets (like date and time server & client, echo server &
client, etc..)
2. Programs using udp sockets (like simple dns)
3. Programs using raw sockets (like packet capturing and filtering)
4. Programs using rpc
5. Simulation of sliding window protocols
experiments using simulators (like opnet)
6. Performance comparison of mac protocols
7. Implementing routing protocols
8. Performance comparison of routing protocols
9. Study of udp performance
10. Study of tcp performance.
Total = 45 periods
requirement for a batch of 30 students
s.no. Description of equipment quantity
required
1. Software
c++ compilerØ
j2sdk (freeware)Ø
linuxØ
ns2/glomosim/opnetØ
(freeware)
30
2. Hardware
pcsØ
30 nos.
12
it2401 service oriented architecture l t p c
3 0 0 3
objectives:
to gain understanding of the basic principles of service orientation·
to learn service oriented analysis techniques·
to learn technology underlying the service design·
to learn advanced concepts such as service composition, orchestration and·
choreography
to know about various ws-* specification standards·
unit i 9
roots of soa – characteristics of soa - comparing soa to client-server and distributed
internet architectures – anatomy of soa- how components in an soa interrelate -
principles of service orientation
unit ii 9
web services – service descriptions – messaging with soap –message exchange
patterns – coordination –atomic transactions – business activities – orchestration –
choreography - service layer abstraction – application service layer – business
service layer – orchestration service layer
unit iii 9
service oriented analysis – business-centric soa – deriving business services- service
modeling - service oriented design – wsdl basics – soap basics – soa composition
guidelines – entity-centric business service design – application service design – taskcentric
business service design
unit iv 9
soa platform basics – soa support in j2ee – java api for xml-based web services
(jax-ws) - java architecture for xml binding (jaxb) – java api for xml registries
(jaxr) - java api for xml based rpc (jax-rpc)- web services interoperability
technologies (wsit) - soa support in .net – common language runtime - asp.net
web forms – asp.net web services – web services enhancements (wse)
unit v 9
ws-bpel basics – ws-coordination overview - ws-choreography, ws-policy, wssecurity
total = 45 periods
text books:
1. Thomas erl, “service-oriented architecture: concepts, technology, and design”,
pearson education, 2005.
References:
1. Thomas erl, “soa principles of service design “(the prentice hall service-oriented
computing series from thomas erl), 2005.
2. Newcomer, lomow, “understanding soa with web services”, pearson education,
2005.
3. Sandeep chatterjee, james webber, “developing enterprise web services, an
architect’s guide”, pearson education, 2005.
4. Dan woods and thomas mattern, “enterprise soa designing it for business
innovation” o’reilly, first edition, 2006
13
it2402 mobile communication l t p c
3 0 0 3
unit i wireless communication 7
cellular systems- frequency management and channel assignment- types of handoff
and their characteristics, dropped call rates & their evaluation -mac – sdma – fdma –
tdma – cdma – cellular wireless networks
unit ii wireless networks 9
wireless lan – ieee 802.11 standards – architecture – services – mobile ad hoc
networks- wifi and wimax - wireless local loop
unit iii mobile communication systems 11
gsm-architecture-location tracking and call setup- mobility management- handover-
security-gsm sms –international roaming for gsm- call recording functions-subscriber
and service data mgt –-mobile number portability -voip service for mobile networks –
gprs –architecture-gprs procedures-attach and detach procedures-pdp context
procedure-combined ra/la update procedures-billing
unit iv mobile network and transport layers 9
mobile ip – dynamic host configuration protocol-mobile ad hoc routing protocols–
multicast routing-tcp over wireless networks – indirect tcp – snooping tcp – mobile
tcp – fast retransmit / fast recovery – transmission/timeout freezing-selective
retransmission – transaction oriented tcp- tcp over 2.5 / 3g wireless networks
unit v application layer 9
wap model- mobile location based services -wap gateway –wap protocols – wap
user agent profile- caching model-wireless bearers for wap - wml – wmlscripts - wta
- imode- syncml.
Total = 45 periods
text books:
1. Jochen schiller, “mobile communications”, second edition, pearson education, 2003.
2. William stallings, “wireless communications and networks”, pearson education,
2002.
References:
1. Kaveh pahlavan, prasanth krishnamoorthy, “principles of wireless networks”, first
edition, pearson education, 2003.
2. Uwe hansmann, lothar merk, martin s. Nicklons and thomas stober, “principles of
mobile computing”, springer, 2003.
3. C.k.toh, “adhoc mobile wireless networks”, first edition, pearson education, 2002.
14
cs2401 computer graphics l t p c
3 0 0 3
unit i 2d primitives 9
output primitives – line, circle and ellipse drawing algorithms - attributes of output
primitives – two dimensional geometric transformation - two dimensional viewing –
line, polygon, curve and text clipping algorithms
unit ii 3d concepts 9
parallel and perspective projections - three dimensional object representation –
polygons, curved lines, splines, quadric surfaces,- visualization of data sets - 3d
transformations – viewing -visible surface identification.
Unit iii graphics programming 9
color models – rgb, yiq, cmy, hsv – animations – general computer animation,
raster, keyframe - graphics programming using opengl – basic graphics primitives –
drawing three dimensional objects - drawing three dimensional scenes
unit iv rendering 9
introduction to shading models – flat and smooth shading – adding texture to faces –
adding shadows of objects – building a camera in a program – creating shaded objects
– rendering texture – drawing shadows.
Unit v fractals 9
fractals and self similarity – peano curves – creating image by iterated functions –
mandelbrot sets – julia sets – random fractals – overview of ray tracing –
intersecting rays with other primitives – adding surface texture – reflections and
transparency – boolean operations on objects
total = 45 periods
text books:
1. Donald hearn, pauline baker, computer graphics – c version, second edition,
pearson education,2004.
2. F.s. Hill, computer graphics using opengl, second edition, pearson
education,2003.
Reference:
1. James d. Foley, andries van dam, steven k. Feiner, john f. Hughes, computer
graphics- principles and practice, second edition in c, pearson education, 2007.
It2403 software project management l t p c
3 0 0 3
unit i introduction to software project management 9
project definition – contract management – activities covered by software project
management – overview of project planning – stepwise project planning.
Unit ii project evaluation 9
strategic assessment – technical assessment – cost benefit analysis –cash flow
forecasting – cost benefit evaluation techniques – risk evaluation.
15
unit iii activity planning 9
objectives – project schedule – sequencing and scheduling activities –network
planning models – forward pass – backward pass – activity float – shortening project
duration – activity on arrow networks – risk management – nature of risk – types of
risk – managing risk – hazard identification – hazard analysis – risk planning and
control.
Unit iv monitoring and control 9
creating framework – collecting the data – visualizing progress – cost monitoring –
earned value – priortizing monitoring – getting project back to target – change
control – managing contracts – introduction – types of contract – stages in contract
placement – typical terms of a contract – contract management – acceptance.
Unit v managing people and organizing teams 9
introduction – understanding behavior – organizational behaviour: a background –
selecting the right person for the job – instruction in the best methods – motivation
– the oldman – hackman job characteristics model – working in groups – becoming
a team –decision making – leadership – organizational structures – stress –health
and safety – case studies.
Total = 45 periods
text book:
1. Bob hughes, mikecotterell, “software project management”, third edition, tata
mcgraw hill, 2004.
References:
1. Ramesh, gopalaswamy, "managing global projects", tata mcgraw hill, 2001.
2. Royce, “software project management”, pearson education, 1999.
3. Jalote, “software project manangement in practive”, pearson education, 2002.
It2406 service oriented architecture lab l t p c
0 0 3 2
1. Develop at least 5 components such as order processing, payment processing,
etc., using .net component technology.
2. Develop at least 5 components such as order processing, payment processing,
etc., using ejb component technology.
3. Invoke .net components as web services.
4. Invoke ejb components as web services.
5. Develop a service orchestration engine (workflow) using ws-bpel and
implement service composition. For example, a business process for planning
business travels will invoke several services. This process will invoke several
airline companies (such as american airlines, delta airlines etc. ) to check the
airfare price and buy at the lowest price.
6. Develop a j2ee client to access a .net web service.
7. Develop a .net client to access a j2ee web service.
Total = 45 periods
16
list of equipments:
hardware:
cpu:- (as server) processor (core 2 quad or equivalent) with good speed,
2gbram, 300gbhdd
software:
1).net framework (ms academic alliance)
(or)
express edition
2) j2ee framework free download
3) os – windows or linux
cs2405 computer graphics lab l t p c
0 0 3 2
1. Implementation of bresenhams algorithm – line, circle, ellipse.
2. Implementation of line, circle and ellipse attributes.
3. Two dimensional transformations - translation, rotation, scaling, reflection,
shear.
4. Composite 2d transformations.
5. Cohen sutherland 2d line clipping and windowing
6. Sutherland – hodgeman polygon clipping algorithm.
7. Three dimensional transformations - translation, rotation, scaling.
8. Composite 3d transformations.
9. Drawing three dimensional objects and scenes.
10. Generating fractal images.
Total = 45 periods
list of equipments:
1) turbo c
2) visual c++ with opengl
3) any 3d animation software like 3dsmax, maya, blender
ma2264 numerical methods l t p c
3 1 0 4
unit i solution of equations and eigenvalue problems 9
solution of equation –fixed point iteration: x=g(x) method - newton’s method – solution
of linear system by gaussian elimination and gauss-jordon method– iterative method -
gauss-seidel method - inverse of a matrix by gauss jordon method – eigen value of a
matrix by power method and by jacobi method for symmetric matrix.
Unit ii interpolation and approximation 9
lagrangian polynomials – divided differences – interpolating with a cubic spline –
newton’s forward and backward difference formulas.
Unit iii numerical differentiation and integration 9
differentiation using interpolation formulae –numerical integration by trapezoidal and
simpson’s 1/3 and 3/8 rules – romberg’s method – two and three point gaussian
quadrature formulae – double integrals using trapezoidal and simpsons’s rules.
17
unit iv initial value problems for ordinary differential
equations 9
single step methods: taylor series method – euler method for first order equation –
fourth order runge – kutta method for solving first and second order equations –
multistep methods: milne’s and adam’s predictor and corrector methods.
Unit v boundary value problems in ordinary and partial
differential equations 9
finite difference solution of second order ordinary differential equation – finite difference
solution of one dimensional heat equation by explicit and implicit methods – one
dimensional wave equation and two dimensional laplace and poisson equations.
L : 45 , t : 15 ,total = 60 periods
text books:
1. Veerarjan, t and ramachandran, t. ‘numerical methods with programming in ‘c’
second editiion, tata mcgraw-hill publishing.co.ltd. (2007).
2. Sankara rao k, ‘numerical methods for scientisits and engineers’ – 3rd editiion
printice hall of india private ltd, new delhi, (2007).
References:
1. Chapra, s. C and canale, r. P. “numerical methods for engineers”, 5th edition, tata
mcgraw-hill, new delhi, 2007.
2. Gerald, c. F. And wheatley, p.o., “applied numerical analysis”, 6th edition, pearson
education asia, new delhi, 2006.
3. Grewal, b.s. And grewal,j.s., “ numerical methods in engineering and science”, 6th
edition, khanna publishers, new delhi, 2004
ma2265 discrete mathematics l t p c
3 1 0 4
unit i logic and proofs 9 + 3
propositional logic – propositional equivalences-predicates and quantifiers-nested
quantifiers-rules of inference-introduction to proofs-proof methods and strategy
unit ii combinatorics 9+3
mathematical inductions-strong induction and well ordering-.the basics of counting-the
pigeonhole principle –permutations and combinations-recurrence relations-solving
linear recurrence relations-generating functions-inclusion and exclusion and
applications.
Unit iii graphs 9 + 3
graphs and graph models-graph terminology and special types of graphs-representing
graphs and graph isomorphism-connectivity-euler and hamilton paths
unit iv algebraic structures 9 + 3
algebraic systems-semi groups and monoids-groups-subgroups and homomorphisms-
cosets and lagrange’s theorem- ring & fields (definitions and examples)
18
unit v lattices and boolean algebra 9+3
partial ordering-posets-lattices as posets- properties of lattices-lattices as algebraic
systems –sub lattices –direct product and homomorphism-some special lattices-
boolean algebra
total: 60 periods
text books:
1. Kenneth h.rosen, “discrete mathematics and its applications”, special indian
edition, tata mcgraw-hill pub. Co. Ltd., new delhi, (2007). (for the units 1 to 3,
sections 1.1 to 1.7 , 4.1 & 4.2, 5.1 to 5.3, 6.1, 6.2, 6.4 to 6.6, 8.1 to 8.5)
2. Trembly j.p and manohar r, “discrete mathematical structures with applications to
computer science”, tata mcgraw–hill pub. Co. Ltd, new delhi, 30th re-print
(2007).(for units 4 & 5 , sections 2-3.8 & 2-3.9,3-1,3-2 & 3-5, 4-1 & 4-2)
references:
1. Ralph. P. Grimaldi, “discrete and combinatorial mathematics: an applied
introduction”, fourth edition, pearson education asia, delhi, (2002).
2. Thomas koshy, ”discrete mathematics with applications”, elsevier publications,
(2006).
3. Seymour lipschutz and mark lipson, ”discrete mathematics”, schaum’s outlines,
tata mcgraw-hill pub. Co. Ltd., new delhi, second edition, (2007).
It2021 business process model l t p c
3 0 0 3
unit i organizational structure 9
types of business organizations-organizational structures-definition-complexity-
formulization-size-technology-culture-forms and outcomes-explanations of
structures-it industry and organizational structures-processes of organizations-case
studies
unit ii process flow measurement 9
process flow measures - flow rate - flow time - inventory - flow-time analysis - process
flow chart - flow-time measurement - cpm - managing flow-time - flow-rate and capacity
analysis - resources and resource pools - flow-rate measurement - process capacity -
inventory analysis
unit iii process flow variability 9
managing flow variability - safety inventory - demand forecasts and forecast errors -
optimal services level - lead time demand variability - safety capacity - service processes
and performance measures - queueing process - buffer capacity - synchronization and
capacity and demand - process control and capability - performance variability - process
capability measurement and improvement - product and process design - process
synchronization and improvement
unit iv business process reengineering 9
introduction to business process re-engineering (bpr)-meaning-types-process-
impetrative for survival-strategic approach-implementing business process reengineering-
methodology and steps-indian scenario of implementing bpr-case
studies
19
unit v bpr and it industry 9
bpr and information technology process-people view and perspectives-empowering
people through it-managing change in the global environment-bpr rediscovering
indian paradigm-need of reengineering-case studies
total = 45 periods
textbooks:
1. Richard h.hall, "organizations - structures, processes and outcomes”, pearson
education, 2004
2. Ravi anupindi et. Al., "managing business process flows", pearson education,
1999.
3. M.s.jayaraman et. Al, “business process reengineering”, tata mc graw hill
publications, 2001
references:
1. Gareth jones, “organizational theory, design and change”, pearson education, 4th
edition, 2004
2. John jeston and johan nelis, "business process management", elsevier, 2006.
It2022 software requirement engineering l t p c
3 0 0 3
unit i introduction 9
introduction - requirements problem – requirements management – requirements
and software life cycle-software team.
Unit ii analysing the prolem 9
the five steps in problem analysis– business modeling – systems engineering of
software intensive systems – understanding user and stakeholders needs – features of
a product or system –interviewing – requirements workshops- brain storming and idea
reduction- storyboarding
unit iii defining the system 9
use case primer-organizing requirement information-vision document-product
management-managing scope-establishing project scope-managing customer
unit iv refining the system definition 9
software requirement-refining the use cases-developing the supplementary
specification- ambiguity and specificity -technical methods for specifying requirements
unit v building the right system 9
from use cases to implementation-from use cases to test cases-tracing
requirements-managing change-assessing requirements quality in iterative
development-agile requirement methods.
Total = 45 periods
text book:
1. Leffingwell, d., widrig, d., “managing software requirements a use case approach”,
second edition, pearson education, 2003.
20
references:
1. Swapna kishore, rajesh naik, “software requirements and estimation”, tata
mcgraw hill, 2001
2. K.weigers, software requirements, microsoft press, 1999.
3. Ian sommerville and p sawyer, “requirements engineering a good practice guide”,
wiley india, 1997
it2023 digital image processing l t p c
3 0 0 3
unit i fundamentals of image processing 9
introduction – steps in image processing systems – image acquisition – sampling and
quantization – pixel relationships – colour fundamentals and models, file formats,
image operations – arithmetic, geometric and morphological.
Unit ii image enhancement 9
spatial domain gray level transformations histogram processing spatial filtering –
smoothing and sharpening. Frequency domain : filtering in frequency domain – dft,
fft, dct – smoothing and sharpening filters – homomorphic filtering.
Unit iii image segmentation and feature analysis 9
detection of discontinuities – edge operators – edge linking and boundary detection –
thresholding – region based segmentation – morphological watersheds – motion
segmentation, feature analysis and extraction.
Unit iv multi resolution analysis and compressions 9
multi resolution analysis : image pyramids – multi resolution expansion – wavelet
transforms.
Image compression : fundamentals – models – elements of information theory – error
free compression – lossy compression – compression standards.
Unit v applications of image processing 9
image classification – image recognition – image understanding – video motion
analysis – image fusion – steganography – digital compositing – mosaics – colour
image processing..
Total = 45 periods
text books :
1. Rafael c.gonzalez and richard e.woods, “digital image processing” second edition,
pearson education, 2003.
References:
1. Milan sonka, vaclav hlavac and roger boyle, “image processing, analysis and
machine vision”, second edition, thomson learning, 2001
2. Anil k.jain, “fundamentals of digital image processing”, phi, 2006.
3. Sanjit k. Mitra, & giovanni l. Sicuranza, “non linear image processing”, elsevier,
2007.
4. Richard o. Duda, peter e. Hof, david g. Stork, “pattern classification” wiley
student edition, 2006.
21
it2024 user interface design l t p c
3 0 0 3
unit i introduction 8
human–computer interface – characteristics of graphics interface –direct manipulation
graphical system – web user interface –popularity –characteristic & principles.
Unit ii human computer interaction 10
user interface design process – obstacles –usability –human characteristics in design
– human interaction speed –business functions –requirement analysis – direct –
indirect methods – basic business functions – design standards – system timings –
human consideration in screen design – structures of menus – functions of menus–
contents of menu– formatting – phrasing the menu – selecting menu choice–
navigating menus– graphical menus.
Unit iii windows 9
characteristics– components– presentation styles– types– managements–
organizations– operations– web systems– device– based controls characteristics–
screen – based controls – operate control – text boxes– selection control–
combination control– custom control– presentation control.
Unit iv multimedia 9
text for web pages – effective feedback– guidance & assistance–
internationalization– accesssibility– icons– image– multimedia – coloring.
Unit v windows layout– test 9
prototypes – kinds of tests – retest – information search – visualization –
hypermedia – www– software tools.
Total = 45 periods
text books:
1. Wilbent. O. Galitz ,“the essential guide to user interface design”, john wiley&
sons, 2001.
2. Ben sheiderman, “design the user interface”, pearson education, 1998.
References:
1. Alan cooper, “the essential of user interface design”, wiley – dream tech ltd.,
2002.
Cs2022 visual programming l t p c
3 0 0 3
unit i 9
windows programming fundamentals – mfc – windows – graphics – menus – mouse
and keyboard – bitmaps – palettes – device-independent bitmaps
unit ii 9
controls – modal and modeless dialog – property – data i/o – sound – timer
unit iii 9
memory management – sdi – mdi – mfc for advanced windows user interface – status
bar and toolbars – tree view – list view – threads
22
unit iv 9
odbc – mfc database classes – dao - dlls – working with images
unit v 9
com fundamentals – activex control – atl – internet programming
total = 45 periods
text book:
1. Richard c.leinecker and tom archer, “visual c++ 6 programming bible”, wiley
dreamtech press, 2006.
References:
1. Lars klander, “core visual c++ 6”, pearson education, 2000
2. Deital, deital, liperi and yaeger “visual v++ .net how to program” , pearson
education, 2004.
Cs2032 data warehousing and data mining lt p c
3 0 0 3
unit i data warehousing 10
data warehousing components –building a data warehouse –- mapping the data
warehouse to a multiprocessor architecture – dbms schemas for decision support –
data extraction, cleanup, and transformation tools –metadata.
Unit ii business analysis 8
reporting and query tools and applications – tool categories – the need for
applications – cognos impromptu – online analytical processing (olap) – need –
multidimensional data model – olap guidelines – multidimensional versus
multirelational olap – categories of tools – olap tools and the internet.
Unit iii data mining 8
introduction – data – types of data – data mining functionalities – interestingness of
patterns – classification of data mining systems – data mining task primitives –
integration of a data mining system with a data warehouse – issues –data
preprocessing.
Unit iv association rule mining and classification 11
mining frequent patterns, associations and correlations – mining methods – mining
various kinds of association rules – correlation analysis – constraint based
association mining – classification and prediction - basic concepts - decision tree
induction - bayesian classification – rule based classification – classification by
backpropagation – support vector machines – associative classification – lazy
learners – other classification methods - prediction
unit v clustering and applications and trends in data mining 8
cluster analysis - types of data – categorization of major clustering methods - kmeans
– partitioning methods – hierarchical methods - density-based methods –grid
based methods – model-based clustering methods – clustering high dimensional data
- constraint – based cluster analysis – outlier analysis – data mining applications.
Total = 45 periods
23
text books:
1. Alex berson and stephen j. Smith, “ data warehousing, data mining & olap”, tata
mcgraw – hill edition, tenth reprint 2007.
2. Jiawei han and micheline kamber, “data mining concepts and techniques”, second
edition, elsevier, 2007.
References:
1. Pang-ning tan, michael steinbach and vipin kumar, “ introduction to data mining”,
person education, 2007.
2. K.p. Soman, shyam diwakar and v. Ajay “, insight into data mining theory and
practice”, easter economy edition, prentice hall of india, 2006.
3. G. K. Gupta, “ introduction to data mining with case studies”, easter economy
edition, prentice hall of india, 2006.
4. Daniel t.larose, “data mining methods and models”, wile-inter science, 2006.
Cs2303 theory of computation l t p c
3 1 0 4
unit i automata 9 + 3
introduction to formal proof – additional forms of proof – inductive proofs –finite
automata (fa) – deterministic finite automata (dfa) – non-deterministic finite
automata (nfa) – finite automata with epsilon transitions.
Unit ii regular expressions and languages 9 + 3
regular expression – fa and regular expressions – proving languages not to be
regular – closure properties of regular languages – equivalence and minimization of
automata.
Unit iii context-free grammars and languages 9 + 3
context-free grammar (cfg) – parse trees – ambiguity in grammars and languages –
definition of the pushdown automata – languages of a pushdown automata –
equivalence of pushdown automata and cfg– deterministic pushdown automata.
Unit iv properties of context-free languages 9 + 3
normal forms for cfg – pumping lemma for cfl – closure properties of cfl – turing
machines – programming techniques for tm.
Unit v undecidabality 9 + 3
a language that is not recursively enumerable (re) – an undecidable problem that is
re – undecidable problems about turing machine – post’s correspondence problem –
the classes p and np
l: 45 t:15 total = 60 periods
text books:
1. J.e. Hopcroft, r. Motwani and j.d. Ullman, “introduction to automata theory,
languages and computations”, second edition, pearson education, 2007.
References:
1. H.r. Lewis and c.h. Papadimitriou, “elements of the theory of computation”,
second edition, pearson education, 2003.
24
2. Thomas a. Sudkamp,” an introduction to the theory of computer science,
languages and machines”, third edition, pearson education, 2007.
3. Raymond greenlaw an h.james hoover, “ fundamentals of theory of computation,
principles and practice”, morgan kaufmann publishers, 1998.
4. Micheal sipser, “introduction of the theory and computation”, thomson brokecole,
1997.
5. J. Martin,“introduction to languages and the theory of computation”, 3rd
edition,tata mc graw hill, 2007
cs2029 advanced database technology l t p c
3 0 0 3
unit i relational model issues 9
er model - normalization – query processing – query optimization - transaction
processing - concurrency control – recovery - database tuning.
Unit ii distributed databases 9
parallel databases – inter and intra query parallelism – distributed database
features – distributed database architecture – fragmentation – distributed query
processing – distributed transactions processing – concurrency control – recovery –
commit protocols.
Unit iii object oriented databases 9
introduction to object oriented data bases - approaches - modeling and design -
persistence – query languages - transaction - concurrency – multi version locks –
recovery – postgres – jasmine –gemstone - odmg model.
Unit iv emerging systems 9
enhanced data models - client/server model - data warehousing and data mining -
web databases – mobile databases- xml and web databases.
Unit v current issues 9
rules - knowledge bases - active and deductive databases - multimedia databases–
multimedia data structures – multimedia query languages - spatial databases.
Total = 45 periods
text book:
1. Thomas connolly and carlolyn begg, “database systems, a practical approach to
design, implementation and management”, third edition, pearson education 2003.
References:
1. R. Elmasri, s.b. Navathe, “fundamentals of database systems”, fifth edition,
pearson education, 2006.
2. Abraham silberschatz, henry f. Korth, s. Sudharshan, “database system
concepts”, fifth edition, tata mcgraw hill, 2006.
3. C.j.date, a.kannan, s.swamynathan, “an introduction to database systems”,
eighth edition, pearson education, 2006.
25
it2031 electronic commerce l t p c
3 0 0 3
unit i introduction 9
traditional commerce and e commerce – internet and www – role of www – value
chains – strategic business and industry value chains – role of e commerce.
Unit ii infrastructure for e commerce 9
packet switched networks – tcp/ip protocol script – internet utility programmes –
sgml, html and xml – web client and servers – web client/server architecture –
intranet and extranets.
Unit iii web based tools for e commerce 9
web server – performance evaluation - web server software feature sets – web server
software and tools – web protocol – search engines – intelligent agents –ec software –
web hosting – cost analysis
unit iv security 9
computer security classification – copy right and intellectual property – electronic
commerce threats – protecting client computers – electronic payment systems –
electronic cash – strategies for marketing – sales and promotion – cryptography –
authentication.
Unit v intelligent agents 9
definition and capabilities – limitation of agents – security – web based marketing –
search engines and directory registration – online advertisements – portables and info
mechanics – website design issues.
Total = 45 periods
text books:
1. Ravi kalakota, “ electronic commerce”, pearson education,
2. Gary p schneider “electronic commerce”, thomson learning & james t peny
cambridge usa, 2001.
3. Manlyn greenstein and miklos “electronic commerce” mcgraw-hill, 2002.
References:
1. Efraim turvan j.lee, david kug and chung, “electronic commerce” pearson
education asia 2001.
2. Brenda kienew e commerce business prentice hall, 2001.
It2032 software testing l t p c
3 0 0 3 unit i introduction 9
testing as an engineering activity – role of process in software quality – testing as a
process – basic definitions – software testing principles – the tester’s role in a
software development organization – origins of defects – defect classes – the defect
repository and test design – defect examples – developer/tester support for
developing a defect repository.
26
unit ii test case design 9
introduction to testing design strategies – the smarter tester – test case design
strategies – using black box approach to test case design random testing –
requirements based testing – positive and negative testing -–– boundary value
analysis – decision tables - equivalence class partitioning state-based testing– causeeffect
graphing – error guessing - compatibility testing – user documentation testing –
domain testing using white–box approach to test design – test adequacy criteria –
static testing vs. Structural testing – code functional testing - coverage and control flow
graphs – covering code logic – paths – their role in white–box based test design –
code complexity testing – evaluating test adequacy criteria.
Unit iii levels of testing 9
the need for levels of testing – unit test – unit test planning –designing the unit
tests. The test harness – running the unit tests and recording results – integration
tests – designing integration tests – integration test planning – scenario testing –
defect bash elimination -system testing – types of system testing - acceptance testing –
performance testing - regression testing – internationalization testing – ad-hoc testing -
alpha – beta tests – testing oo systems – usability and accessibility testing
unit iv test management 9
people and organizational issues in testing – organization structures for testing teams –
testing services - test planning – test plan components – test plan attachments –
locating test items – test management – test process - reporting test results – the
role of three groups in test planning and policy development – introducing the test
specialist – skills needed by a test specialist – building a testing group.
Unit v controlling and monitoring 9
software test automation – skills needed for automation – scope of automation – design
and architecture for automation – requirements for a test tool – challenges in automation
- test metrics and measurements –project, progress and productivity metrics – status
meetings – reports and control issues – criteria for test completion – scm – types of
reviews – developing a review program – components of review plans– reporting
review results. – evaluating software quality – defect prevention – testing maturity
model
total = 45 periods
text books:
1. Srinivasan desikan and gopalaswamy ramesh, “ software testing – principles and
practices”, pearson education, 2006.
2. Aditya p.mathur, “foundations of software testing”, pearson education,2008.
References:
1. Boris beizer, “software testing techniques”, second edition,dreamtech, 2003.
2. Elfriede dustin, “effective software testing”, first edition, pearson education, 2003.
3. Renu rajani, pradeep oak, “software testing – effective methods, tools and
techniques”, tata mcgraw hill, 2004.
27
it2033 bioinformatics l t p c
3 0 0 3
unit i 9
introduction to molecular biology – the genetic material – gene structure – protein
structure – chemical bonds – molecular biology tools – genomic information content
unit ii 9
data searches – simple alignments – gaps – scoring matrices – dynamic programming –
global and local alignments – database searches – multiple sequence alignments
patterns for substitutions – estimating substitution numbers – evolutionary rates –
molecular clocks – evolution in organelles
unit iii 9
phylogenetics – history and advantages – phylogenetic trees – distance matrix methods
– maximum likelihood approaches – multiple sequence alignments – parsimony –
ancestral sequences – strategies for faster searches – consensus trees – tree
confidence – comparison of phylogenetic methods – molecular phylogenies
unit iv 9
genomics – prokaryotic genomes: prokaryotic gene structure – gc content - gene
density – eukaryotic genomes: gene structure – open reading frames – gc content –
gene expression – transposition – repeated elements – gene density
unit v 9
amino acids – polypeptide composition – secondary structure – tertiary and quaternary
structure – algorithms for modeling protein folding – structure prediction – predicting
rna secondary structures proteomics – protein classification – experimental techniques
– inhibitors and drug design – ligand screening – nmr structures – empirical methods
and prediction techniques – post-translational modification prediction
total = 45 periods
text book:
1. D. E. Krane and m. L. Raymer, “fundamental concepts of bioinformatics”, pearson
education, 2003.
References:
1. Arthur m. Lesk, “introduction to bioinformatics”, second edition, oxford university
press, 2005.
2. T. K. Attwood, d. J. Parry-smith, and s. Phukan, “introduction to bioinformatics”,
pearson education, 1999.
3. Vittal r. Srinivas, “bioinformatics – a modern approach”, prentice-hall of india pvt.
Ltd., 2005.
It2034 adhoc sensor network l t p c
3 0 0 3
unit i routing 9
cellular and ad hoc wireless networks – issues of mac layer and routing – proactive,
reactive and hybrid routing protocols – multicast routing – tree based and mesh
based protocols – multicast with quality of service provision.
28
unit ii quality of service 9
real-time traffic support – issues and challenges in providing qos – classification of
qos solutions – mac layer classifications – qos aware routing protocols – ticket
based and predictive location based qos routing protocols
unit iii energy management ad hoc networks 9
need for energy management – classification of energy management schemes –
battery management and transmission power management schemes – network layer
and data link layer solutions – system power management schemes
unit iv mesh networks 9
necessity for mesh networks – mac enhancements – ieee 802.11s architecture –
opportunistic routing – self configuration and auto configuration - capacity models –
fairness – heterogeneous mesh networks – vehicular mesh networks
unit v sensor networks 9
introduction – sensor network architecture – data dissemination – data gathering –
mac protocols for sensor networks – location discovery – quality of sensor networks
– evolving standards – other issues – recent trends in infrastructure less networks
total = 45 periods
text book:
1. C. Siva ram murthy and b.s.manoj, “ad hoc wireless networks – architectures and
protocols’, pearson education, 2004
references:
1. Feng zhao and leonidas guibas, “wireless sensor networks”, morgan kaufman
publishers, 2004.
2. C.k.toh, “adhoc mobile wireless networks”, pearson education, 2002.
3. Thomas krag and sebastin buettrich, ‘wireless mesh networking’, o’reilly
publishers, 2007.
Cs2351 artificial intelligence l t p c
3 0 0 3
aim
to learn the basics of designing intelligent agents that can solve general purpose
problems, represent and process knowledge, plan and act, reason under uncertainty and
can learn from experiences
unit i problem solving 9
introduction – agents – problem formulation – uninformed search strategies – heuristics
– informed search strategies – constraint satisfaction
unit ii logical reasoning 9
logical agents – propositional logic – inferences – first-order logic – inferences in firstorder
logic – forward chaining – backward chaining – unification – resolution
29
unit iii planning 9
planning with state-space search – partial-order planning – planning graphs – planning
and acting in the real world
unit iv uncertain knowledge and reasoning 9
uncertainty – review of probability - probabilistic reasoning – bayesian networks –
inferences in bayesian networks – temporal models – hidden markov models
unit v learning 9
learning from observation - inductive learning – decision trees – explanation based
learning – statistical learning methods - reinforcement learning.
Total = 45 periods
text book:
1. S. Russel and p. Norvig, “artificial intelligence – a modern approach”, second
edition, pearson education, 2003.
References:
1. David poole, alan mackworth, randy goebel, ”computational intelligence : a
logical approach”, oxford university press, 2004.
2. G. Luger, “artificial intelligence: structures and strategies for complex problem
solving”, fourth edition, pearson education, 2002.
3. J.nilsson, “artificial intelligence: a new synthesis”, elsevier publishers, 1998.
It2041 enterprise resource planning l t p c
3 0 0 3
unit i erp and technology 10
introduction – related technologies – business intelligence – e-commerce and ebusiness
– business process reengineering – data warehousing – data mining –
olap – product life cycle management – scm – crm
unit ii erp implementation 10
implementation challenges – strategies – life cycle – pre-implementation tasks –
requirements definition – methodologies – package selection – project teams –
process definitions – vendors and consultants – data migration – project management
– post implementation activities.
Unit iii erp in action & business modules 8
operation and maintenance – performance – maximizing the erp system – business
modules – finance – manufacturing – human resources – plant maintenance –
materials management – quality management – marketing – sales, distribution and
service.
Unit iv erp market 9
marketplace – dynamics – sap ag – oracle – peoplesoft – jd edwards – qad inc –
ssa global – lawson software – epicor – intutive.
30
unit v 8
enterprise application integration – erp and e-business – erp ii – total quality
management – future directions – trends in erp.
Total = 45 periods
text books:
1. Alexis leon, “erp demystified”, tata mcgraw hill, second edition, 2008.
2. Mary sumner, “enterprise resource planning”, pearson education, 2007.
References:
1. Jim mazzullo,”sap r/3 for everyone”, pearson,2007.
2. Jose antonio fernandz, “ the sap r /3 handbook”, tata mcgraw hill, 1998.
3. Biao fu, “sap bw: a step-by-step guide”, first edition, pearson education, 2003.
It2042 information security l t p c
3 0 0 3
aim
to study the critical need for ensuring information security in organizations
objectives
to understand the basics of information security·
to know the legal, ethical and professional issues in information security·
to know the aspects of risk management·
to become aware of various standards in this area·
to know the technological aspects of information security·
unit i introduction 9
history, what is information security ?, critical characteristics of information, nstissc
security model, components of an information system, securing the components,
balancing security and access, the sdlc, the security sdlc
unit ii security investigation 9
need for security, business needs, threats, attacks, legal, ethical and professional
issues
unit iii security analysis 9
risk management : identifying and assessing risk, assessing and controlling risk
unit iv logical design 9
blueprint for security, information security poicy, standards and practices, iso
17799/bs 7799, nist models, visa international security model, design of security
architecture, planning for continuity
unit v physical design 9
security technology, ids, scanning and analysis tools, cryptography, access control
devices, physical security, security and personnel
total = 45 periods
31
text book:
1. Michael e whitman and herbert j mattord, “principles of information security”, vikas
publishing house, new delhi, 2003
references:
1. Micki krause, harold f. Tipton, “ handbook of information security management”,
vol 1-3 crc press llc, 2004.
2. Stuart mc clure, joel scrambray, george kurtz, “hacking exposed”, tata mcgraw-
hill, 2003
3. Matt bishop, “ computer security art and science”, pearson/phi, 2002.
It2043 knowledge management l t p c
3 0 0 3
unit i knowledge management 9
km myths – km life cycle – understanding knowledge – knowledge, intelligence –
experience – common sense – cognition and km – types of knowledge – expert
knowledge – human thinking and learning.
Unit ii knowledge management system life cycle 9
challenges in building km systems – conventional vrs km system life cycle (kmsls)
– knowledge creation and knowledge architecture – nonaka’s model of knowledge
creation and transformation. Knowledge architecture.
Unit iii capturing knowledge 9
evaluating the expert – developing a relationship with experts – fuzzy reasoning and
the quality of knowledge – knowledge capturing techniques, brain storming – protocol
analysis – consensus decision making – repertory grid- concept mapping –
blackboarding.
Unit iv knowledge codification 9
modes of knowledge conversion – codification tools and procedures – knowledge
developer’s skill sets – system testing and deployment – knowledge testing –
approaches to logical testing, user acceptance testing – km system deployment
issues – user training – post implementation.
Unit v knowledge transfer and sharing 9
transfer methods – role of the internet – knowledge transfer in e-world – km system
tools – neural network – association rules – classification trees – data mining and
business intelligence – decision making architecture – data management – knowledge
management protocols – managing knowledge workers.
Total = 45 periods
text book:
1. Elias.m. Award & hassan m. Ghaziri – “knowledge management” pearson education
2003.
References:
1. Guus schreiber, hans akkermans, anjo anjewierden, robert de hoog, nigel
shadbolt, walter van de velde and bob wielinga, “knowledge engineering and
management”, universities press, 2001.
2. C.w. Holsapple, “handbooks on knowledge management”, international handbooks
on information systems, vol 1 and 2, 2003
32
cs2063 grid computing l t p c
3 0 0 3
unit i concepts and architecture 9
introduction-parallel and distributed computing-cluster computing-grid computing-
anatomy and physiology of grid-review of web services-ogsa-wsrf.
Unit ii grid monitoring 9
grid monitoring architecture (gma) - an overview of grid monitoring systems- gridi
ce – jamm -mds-network weather service-r-gma-other monitoring systems-
ganglia and gridmon
unit iii grid security and resource management 9
grid security-a brief security primer-pki-x509 certificates-grid security-grid
scheduling and resource management-scheduling paradigms- working principles of
scheduling -a review of condor, sge, pbs and lsf-grid scheduling with qos.
Unit iv data management and grid portals 9
data management-categories and origins of structured data-data management
challenges-architectural approaches-collective data management services-federation
services-grid portals-first-generation grid portals-second-generation grid portals.
Unit v grid middleware 9
list of globally available middlewares - case studies-recent version of globus toolkit
and glite - architecture, components and features.
Total = 45 periods
text book:
1. Maozhen li, mark baker, the grid core technologies, john wiley & sons ,2005.
References:
1. Ian foster & carl kesselman,the grid 2 – blueprint for a new computing infrascture
morgan kaufman – 2004.
2. Joshy joseph & craig fellenstein, “grid computing”, pearson education 2004.
3. Fran berman,geoffrey fox, anthony j.g.hey, “grid computing: making the global
infrastructure a reality”, john wiley and sons, 2003.
Cs2041 c# and .net framework l t p c
3 0 0 3
unit i 9
review of oop concepts - overview of .net framework - basic elements of c# -
program structure and simple input and output operations – operators and
expressions – statements – arrays and structures.
Unit ii 9
inheritance - namespace – polymorphism – interface and overloading – multiple
inheritance – property – indexes – delegates – publish/subscribe design patterns-
operator overloading-method overloading
33
unit ii i 9
c# concepts for creating data structures - file operation – file management systems –
stream oriented operations- multitasking – multithreading – thread operation –
synchronization.
Unit iv 9
working with xml – techniques for reading and writing xml data - using xpath and
search xml - ado.net architecture – ado.net connected and disconnected models
– xml and ado.net – simple and complex data binding– data grid view class.
Unit v 9
application domains – remoting – leasing and sponsorship - .net coding design
guidelines –assemblies – security – application development – web services -
building an xml web service - web service client – wsdl and soap – web service
with complex data types – web service performance.
Total = 45 periods
text books:
1. S. Thamarai selvi and r. Murugesan “a textbook on c# “, pearson education,2003.
2. Stephen c. Perry “ core c# and .net”, pearson education,2006.
References:
1. Jesse liberty, “programming c#”, second edition, o’reilly press, 2002.
2. Robinson et al, “professional c#”, fifth edition, wrox press, 2002.
3. Herbert schildt, “the complete reference: c#”, tata mcgraw hill, 2004.
4. Andrew troelsen, “c# and the .net platform”, a! Press, 2003.
5. Thuan thai and hoang q. Lam, “. Net framework essentials”, second edition,
o’reilly, 2002.
It2050 principles of compiler design l t p c
3 0 0 3
unit i basics of compilation 9
compilers – analysis of source program – phases of a compiler – grouping of phases –
compiler construction tools – lexical analyzer: token specification -token recognition-
a language for specifying lexical analyzer– top down parser : table implementation of
predictive parser - bottom-up parser : slr(1) parser - parser generators.
Unit ii type checking and runtime environments 9
syntax directed definitions – construction of syntax trees – type systems – specification
of a simple type checker - equivalence of type expressions – type conversions –
attribute grammar for a simple type checking system – runtime environments: source
language issues – storage organization – storage allocation strategies – parameter
passing.
Unit iii intermediate code generation 9
intermediate languages – declarations – assignment statements – boolean expressions
– case statements – backpatching – procedure calls.
34
unit iv code generation 9
issues in the design of a code generator – the target machine – runtime storage
management – basic blocks and flow graphs – next-use information – a simple code
generator – register allocation and assignment – the dag representation of basic
blocks – generating code from dag – dynamic programming code generation algorithm
– code-generator generators.
Unit v code optimization 9
principal sources of optimization – peephole optimization – optimization of basic blocks
– loops in flow graphs – introduction to global data flow analysis – iterative solution of
data flow equations – code improving transformations – dealing with aliases.
Total = 45 periods
text book:
1. Alfred v. Aho, ravi sethi, jeffrey d. Ullman. “compilers principles, techniques and
tools”. Pearson education, 2008.
References:
1. Steven s. Muchnick, “advanced compiler design implementation”, morgan koffman,
1997.
2. Charles n. Fischer, richard j. Leblanc, “crafting a compiler with c”, benjamin
cummings, 1991.
3. Allen holub, “compiler design in c”, prentice hall of india, 1990.
It2051 knowledge engineering l t p c
3 0 0 3
unit i introduction 9
key concepts – why knowledge representation and reasoning – language of first
order logic – syntax, semantics pragmatics – expressing knowledge – levels of
representation – knowledge acquisition and sharing – sharing ontologies – language
ontologies –language patterns – tools for knowledge acquisition
unit ii resolution and reasoning 9
proportional case – handling variables and qualifies – dealing with intractability –
reasoning with horn clauses - procedural control of reasoning – rules in production –
description logic - vivid knowledge – beyond vivid.
Unit iii representation 9
object oriented representations – frame formalism – structured descriptions –
meaning and entailment - taxonomies and classification – inheritance – networks –
strategies for defeasible inheritance – formal account of inheritance networks.
Unit iv defaults, uncertainty and expressiveness 9
defaults – introduction – closed world reasoning – circumscription – default logic
limitations of logic – fuzzy logic – nonmontonic logic – theories and world –
semiotics – auto epistemic logic - vagueness – uncertainty and degrees of belief –
noncategorical reasoning – objective and subjective probability.
35
unit v actions and planning 9
explanation and diagnosis – purpose – syntax, semantics of context – first order
reasoning – modal reasoning in context – encapsulating objects in context – agents
– actions – situational calculus – frame problem – complex actions – planning –
strips – planning as reasoning – hierarchical and conditional planning.
Total = 45 periods
text book:
1. Ronald brachman, hector levesque “knowledge representation and reasoning “,
the morgan kaufmann series in artificial intelligence 2004
references:
1. John f. Sowa, “ knowledge representation: logical, philosophical, and
computational foundations”, 2000
2. Arthur b. Markman, “knowledge representation”, lawrence erlbaum associates,1998
ge2021 professional ethics in engineering l t p c
3 0 0 3
unit i engineering ethics 9
senses of ‘engineering ethics’ – variety of moral issues – types of inquiry – moral
dilemmas – moral autonomy – kohlberg’s theory – gilligan’s theory – consensus and
controversy – professions and professionalism – professional ideals and virtues –
uses of ethical theories
unit ii engineering as social experimentation 9
engineering as experimentation – engineers as responsible experimenters – research
ethics - codes of ethics – industrial standards - a balanced outlook on law – the
challenger case study
unit iii engineer’s responsibility for safety 9
safety and risk – assessment of safety and risk – risk benefit analysis – reducing
risk – the government regulator’s approach to risk - chernobyl case studies and
bhopal
unit iv responsibilities and rights 9
collegiality and loyalty – respect for authority – collective bargaining – confidentiality
– conflicts of interest – occupational crime – professional rights – employee rights –
intellectual property rights (ipr) - discrimination
unit v global issues 9
multinational corporations – business ethics - environmental ethics – computer ethics -
role in technological development – weapons development – engineers as managers
– consulting engineers – engineers as expert witnesses and advisors – honesty –
moral leadership – sample code of conduct.
Total = 45 periods
text books:
1. Mike martin and roland schinzinger, “ethics in engineering”, mcgraw hill, new york,
2005.
2. Charles e harris, michael s pritchard and michael j rabins, “engineering ethics –
concepts and cases”, thompson learning, 2000.
36
references:
1. Charles d fleddermann, “engineering ethics”, prentice hall, new mexico, 1999.
2. John r boatright, “ethics and the conduct of business”, pearson education, 2003
3. Edmund g seebauer and robert l barry, “fundamentals of ethics for scientists and
engineers”, oxford university press, 2001.
4. Prof. (col) p s bajaj and dr. Raj agrawal, “business ethics – an indian perspective”,
biztantra, new delhi, 2004.
5. David ermann and michele s shauf, “computers, ethics and society”,
oxford university press, (2003)
ge2071 intellectual property rights (ipr) l t p c
3 0 0 3
unit i 9
introduction – invention and creativity – intellectual property (ip) – importance –
protection of ipr – basic types of property (i). Movable property - immovable property
and - intellectual property.
Unit ii 9
ip – patents – copyrights and related rights – trade marks and rights arising from
trademark registration – definitions – industrial designs and integrated circuits –
protection of geographical indications at national and international levels – application
procedures..
Unit iii 9
international convention relating to intellectual property – establishment of wipo –
mission and activities – history – general agreement on trade and tariff (gatt) –
trips agreement.
Unit iv 9
indian position vs wto and strategies – indian ipr legislations – commitments to
wto-patent ordinance and the bill – draft of a national intellectual property policy –
present against unfair competition.
Unit v 9
case studies on – patents (basumati rice, turmeric, neem, etc.) – copyright and related
rights – trade marks – industrial design and integrated circuits – geographic indications
– protection against unfair competition.
Total = 45 periods
text book:
1. Subbaram n.r. “handbook of indian patent law and practice “, s. Viswanathan
printers and publishers pvt. Ltd., 1998.
References:
1. Eli whitney, united states patent number: 72x, cotton gin, march 14, 1794.
2. Intellectual property today: volume 8, no. 5, may 2001, [www.iptoday.com].
3. Using the internet for non-patent prior art searches, derwent ip matters, july 2000.
Www.ipmatters.net/features/000707_gibbs.html.
37
it2052 management information system l t p c
3 0 0 3
unit i information system and organization 9
matching the information system plan to the organizational strategic plan – identifying
key organizational objective and processes and developing an information system
development – user role in systems development process – maintainability and
recoverability in system design.
Unit ii representation and analysis of system structure 9
models for representing systems: mathematical, graphical and hierarchical
(organization chart, tree diagram) – information flow – process flow – methods and
heuristics – decomposition and aggregation – information architecture – application of
system representation to case studies.
Unit iii systems, information and decision theory 9
information theory – information content and redundancy – classification and
compression – summarizing and filtering – inferences and uncertainty – identifying
information needed to support decision making – human factors – problem
characteristics and information system capabilities in decision making.
Unit iv information system application 9
transaction processing applications – basic accounting application – applications for
budgeting and planning – other use of information technology: automation – word
processing – electronic mail – evaluation remote conferencing and graphics – system
and selection – cost benefit – centralized versus decentralized allocation mechanism.
Unit v development and maintenance of information systems 9
systems analysis and design – system development life cycle – limitation – end user
development – managing end users – off– the shelf software packages – outsourcing –
comparison of different methodologies.
Total = 45 periods
text book:
1. Laudon k.c, laudon j.p, brabston m.e, “management information systems -
managing the digital firm”, pearon education, 2004.
References:
1. Turban e.f, potter r.e, “introduction to information technology”; wiley, 2 004.
2. Jeffrey a.hoffer, joey f.george, joseph s. Valachich, “modern systems analysis and
design”, third edition, prentice hall, 2002.
It2053 software design l t p c
3 0 0 3
unit i general design fundamentals 9
the nature of design process – objectives – building models – constructs, design
qualities – assessing the design – design viewpoints for software – the object model –
classes and objects – complexity – classification – notation – process – pragmatics.
38
unit ii structured system analysis and design 9
structured design – design principles – problem partitioning and hierarchy –
abstraction, modularity – top-down and bottom-up strategies – transformation of a
dfd to a structure chart – transform analysis – transaction analysis – coupling –
cohesion – multiple types of cohesion in a module – data design – normalization –
denormalization – procedural design.
Unit iii object oriented analysis and design 9
overview of object oriented analysis – shaler/mellor – coad/ yourdon – rumbaugh –
booch – uml – use case – conceptual model – behaviour – class analysis patterns –
overview – diagrams – aggregation – uml – diagrams – collaboration – sequence –
class – design patterns and frameworks – comparison with other design methods –
managing analysis and design – evaluation testing – coding – maintenance – metrics.
Unit iv software design 9
the architecture concepts – design methods – design patterns – rationale for
methods – design processes and strategies – design by template – designing with
patterns – stepwise refinement – incremental design – prototyping – dsdm –
structured systems analysis and structured design – jsp – jsd.
Unit v case studies 9
domain name system – email – world wide web (http) – simple network
management protocol – file transfer protocol – security – mutimedia applications.
Total = 45 periods
references:
1. David budgen, "software design", second edition, pearson education, 2004.
2. R. S. Pressman, "software engineering", fifth edition, mcgraw hill inc., 2001.
3. Steve mcconnell, "code complete ", word power publishers, 2001.
4. Ed downs, peter clare, jan coe, "structured system analysis and design methods
application and context ", prentice hall, 1998.
5. A. G. Suteliffe, "human computer interface design ", second edition macmillan,
1995.
Cs2053 soft computing l t p c
3 0 0 3
unit i fuzzy set theory 10
introduction to neuro – fuzzy and soft computing – fuzzy sets – basic definition and
terminology – set-theoretic operations – member function formulation and
parameterization – fuzzy rules and fuzzy reasoning – extension principle and fuzzy
relations – fuzzy if-then rules – fuzzy reasoning – fuzzy inference systems –
mamdani fuzzy models – sugeno fuzzy models – tsukamoto fuzzy models – input
space p artition ing and fuzzy modelin g.
Unit ii optimization 8
derivative-based optimization – descent methods – the method of steepest descent –
classical newton’s method – step size determination – derivative-free optimization –
genetic algorithms – simulated annealing – random search – downhill simplex
search.
39
unit iii artificial intelligence 10
introduction, knowledge representation – reasoning, issues and acquisition:
prepositional and predicate calculus rule based knowledge representation symbolic
reasoning under uncertainity basic knowledge representation issues knowledge
acquisition – heuristic search: techniques for heuristic search heuristic classification -
state space search: strategies implementation of graph search search based on
recursion patent-directed search production system and learning.
Unit iv neuro fuzzy modeling 9
adaptive neuro-fuzzy inference systems – architecture – hybrid learning algorithm –
learning methods that cross-fertilize anfis and rbfn – coactive neuro fuzzy
modeling – framework neuron functions for adaptive networks – neuro fuzzy
spectru m.
Unit v applications of computational intelligence 8
printed character recognition – inverse kinematics problems – automobile fuel
efficiency prediction – soft computing for color recipe prediction.
Total = 45 periods
text books:
1. J.s.r.jang, c.t.sun and e.mizutani, “neuro-fuzzy and soft computing”, phi, 2004,
pearson education 2004.
2. N.p.padhy, “artificial intelligence and intelligent systems”, oxford university press,
2006.
References:
1. Elaine rich & kevin knight, artificial intelligence, second edition, tata mcgraw hill
publishing comp., 2006, new delhi.
2. Timothy j.ross, “fuzzy logic with engineering applications”, mcgraw-hill, 1997.
3. Davis e.goldberg, “genetic algorithms: search, optimization and machine learning”,
addison wesley, n.y., 1989.
4. S. Rajasekaran and g.a.v.pai, “neural networks, fuzzy logic and genetic
algorithms”, phi, 2003.
5. R.eberhart, p.simpson and r.dobbins, “computational intelligence - pc tools”, ap
professional, boston, 1996.
6. Amit konar, “artificial intelligence and soft computing behaviour and cognitive model
of the human brain”, crc press, 2008.
Ge2022 total quality management l t p c
3 0 0 3
unit i introduction 9
introduction - need for quality - evolution of quality - definition of quality - dimensions of
manufacturing and service quality - basic concepts of tqm - definition of tqm – tqm
framework - contributions of deming, juran and crosby – barriers to tqm.
Unit ii tqm principles 9
leadership – strategic quality planning, quality statements - customer focus –
customer orientation, customer satisfaction, customer complaints, customer retention -
employee involvement – motivation, empowerment, team and teamwork, recognition
and reward, performance appraisal - continuous process improvement – pdsa cycle,
5s, kaizen - supplier partnership – partnering, supplier selection, supplier rating.
40
unit iii tqm tools & techniques i 9
the seven traditional tools of quality – new management tools – six-sigma: concepts,
methodology, applications to manufacturing, service sector including it – bench marking
– reason to bench mark, bench marking process – fmea – stages, types.
Unit iv tqm tools & techniques ii 9
quality circles – quality function deployment (qfd) – taguchi quality loss function –
tpm – concepts, improvement needs – cost of quality – performance measures.
Unit v quality systems 9
need for iso 9000- iso 9000-2000 quality system – elements, documentation, quality
auditing- qs 9000 – iso 14000 – concepts, requirements and benefits – case studies
of tqm implementation in manufacturing and service sectors including it.
Total = 45 periods
text book:
1. Dale h.besterfiled, et at., “total quality management”, pearson education asia, 3rd
edition, indian reprint (2006).
References:
1. James r. Evans and william m. Lindsay, “the management and control of quality”,
6th edition, south-western (thomson learning), 2005.
2. Oakland, j.s., “tqm – text with cases”, butterworth – heinemann ltd., oxford, 3rd
edition, 2003.
3. Suganthi,l and anand samuel, “total quality management”, prentice hall (india)
pvt. Ltd.,2006.
4. Janakiraman, b and gopal, r.k, “total quality management – text and cases”,
prentice hall (india) pvt. Ltd., 2006.
Ge2072 indian constitution and society l t p c
3 0 0 3
unit i 9
historical background – constituent assembly of india – philosophical foundations of
the indian constitution – preamble – fundamental rights – directive principles of state
policy – fundamental duties – citizenship – constitutional remedies for citizens.
Unit ii 9
union government – structures of the union government and functions – president –
vice president – prime minister – cabinet – parliament – supreme court of india –
judicial review.
Unit iii 9
state government – structure and functions – governor – chief minister – cabinet –
state legislature – judicial system in states – high courts and other subordinate
courts.
41
unit iv 9
indian federal system – center – state relations – president’s rule – constitutional
amendments – constitutional functionaries - assessment of working of the
parliamentary system in india.
Unit v 9
society : nature, meaning and definition; indian social structure; caste, religion,
language in india; constitutional remedies for citizens – political parties and pressure
groups; right of women, children and scheduled castes and scheduled tribes and
other weaker sections.
Total: 45 periods
text books:
1. Durga das basu, “ introduction to the constitution of india “, prentice hall of india,
new delhi.
2. R.c.agarwal, (1997) “indian political system”, s.chand and company, new delhi.
3. Maciver and page, “ society: an introduction analysis “, mac milan india ltd., new
delhi.
4. K.l.sharma, (1997) “social stratification in india: issues and themes”, jawaharlal
nehru university, new delhi.
References:
1. Sharma, brij kishore, “ introduction to the constitution of india:, prentice hall of
india, new delhi.
2. U.r.gahai, “indian political system “, new academic publishing house, jalaendhar.
3. R.n. Sharma, “indian social problems “, media promoters and publishers pvt. Ltd.
It2061 system modeling and simulation l t p c
3 0 0 3
unit i introduction to simulation 9
introduction – simulation terminologies- application areas – model classification –
types of simulation- steps in a simulation study- concepts in discrete event simulation
- simulation examples
unit ii mathematical models 9
statistical models - concepts – discrete distribution- continuous distribution – poisson
process- empirical distributions- queueing models – characteristics- notation –
queueing systems – markovian models- properties of random numbers- generation of
pseudo random numbers- techniques for generating random numbers-testing random
number generators- generating random-variates- inverse transform technique –
acceptance- rejection technique – composition & convolution method.
Unit iii analysis of simulation data 9
input modeling - data collection - assessing sample independence - hypothesizing
distribution family with data - parameter estimation - goodness-of-fit tests - selecting
input models in absence of data- output analysis for a single system – terminating
simulations – steady state simulations.
42
unit iv verification and validation 9
model building – verification of simulation models – calibration and validation of
models – validation of model assumptions – validating input – output transformations.
Unit v simulation of computer systems and case studies 9
simulation tools – model input – high level computer system simulation – cpu –
memory simulation – comparison of systems via simulation – simulation programming
techniques - development of simulation models.
Total = 45 periods
text books:
1. Jerry banks and john carson, “ discrete event system simulation”, fourth edition,
phi, 2005.
2. Geoffrey gordon, “system simulation”, second edition, phi, 2006 (unit – v).
References:
1. Frank l. Severance, “ system modeling and simulation”, wiley, 2001.
2. Averill m. Law and w.david kelton, “ simulation modeling and analysis,
third edition, mcgraw hill, 2006.
3. Jerry banks, “handbook of simulation: principles, methodology, advances,
applications and practice”, wiley, 1998.
Cs2035 natural language processing l t p c
3 0 0 3
unit i 9
introduction – models -and algorithms - the turing test -regular expressions
basic regular expression patterns -finite state automata -regular languages and
fsas – morphology -inflectional morphology - derivational morphology -finite-state
morphological parsing - combining an fst lexicon and rules -porter stemmer
unit ii 9
n-grams models of syntax - counting words - unsmoothed n-grams – smoothing-
backoff - deleted interpolation – entropy - english word classes - tagsets for english -
part of speech tagging -rule-based part of speech tagging - stochastic part of
speech tagging - transformation-based tagging -
unit iii 9
context free grammars for english syntax- context-free rules and trees - sentence-
level constructions –agreement – sub categorization – parsing – top-down – earley
parsing -feature structures - probabilistic context-free grammars
unit iv 9
representing meaning - meaning structure of language - first order predicate calculus
- representing linguistically relevant concepts -syntax-driven semantic analysis -
semantic attachments - syntax-driven analyzer - robust analysis - lexemes and their
senses - internal structure - word sense disambiguation -information retrieval
43
unit v 9
discourse -reference resolution - text coherence -discourse structure - dialog and
conversational agents - dialog acts – interpretation – coherence -conversational
agents - language generation – architecture -surface realizations - discourse
planning – machine translation -transfer metaphor – interlingua – statistical
approaches
total = 45 periods
text books:
1. D. Jurafsky and j. Martin “speech and language processing: an introduction to
natural language processing, computational linguistics, and speech recognition”,
2. C. Manning and h. Schutze, “foundations of statistical natural language
processing”,
reference:
1. James allen. “natural language understanding”, addison wesley, 1994.
Cs2056 distributed systems l t p c
3 0 0 3
unit i 9
characterization of distributed systems-introduction-examples-resource sharing and
the web-challenges. System models-architectural-fundamental.
Interprocess communication-introduction-api for internet protocols-external data
representation and marshalling--client-server communication-group communication-
case study: interprocess communication in unix.
Unit ii 9
distributed objects and remote invocation-introduction-communication between
distributed objects-remote procedure calls-events and notifications-case study: java
rmi. Operating system support-introduction-os layer-protection-processes and
threads-communication and invocation os architecture.
Unit iii 9
distributed file systems-introduction-file service architecture-case study:sun network
file system-enhancements and further developments.
Name services-introduction-name services and the domain name system-directory
services-case study: global name service.
Unit iv 9
time and global states-introduction-clocks, events and process states-synchronizing
physical clocks-logical time and logical clocks-global states-distributed debugging.
Coordination and agreement-introduction-distributed mutual exclusion-elections-
multicast communication-consensus and related problems.
Unit v 9
distributed shared memory-introduction-design and implementation issues-sequential
consistency and ivy case study release consistency and munin case study-other
consistency models.corba case study- introduction-corba rmi-corba services.
Total = 45 periods
44
text book:
1. George coulouris, jean dollimore, tim kindberg, , "distributed systems: concepts
and design", 4th edition, pearson education, 2005.
References:
1. A.ts. Tanenbaum and m. V. Steen, "distributed systems: principles and paradigms",
second edition, prentice hall, 2006.
2. M.l.liu, “distributed computing principles and applications”, pearson addison
wesley, 2004.
3. Mukesh singhal, “advanced concepts in operating systems”, mcgrawhill series in
computer science, 1994.
4. Nancy a. Lynch, "distributed algorithms", the morgan kaufmann series in data
management system, morgan kaufmann publishers, 2000.
Ge2023 fundamentals of nanoscience l t p c
3 0 0 3
unit i introduction 9
nanoscale science and technology- implications for physics, chemistry, biology and
engineering-classifications of nanostructured materials- nano particles- quantum dots,
nanowires-ultra-thinfilms-multilayered materials. Length scales involved and effect on
properties: mechanical, electronic, optical, magnetic and thermal properties.
Introduction to properties and motivation for study (qualitative only).
Unit ii preparation methods 10
bottom-up synthesis-top-down approach: precipitation, mechanical milling, colloidal
routes, self-assembly, vapour phase deposition, mocvd, sputtering, evaporation,
molecular beam epitaxy, atomic layer epitaxy, mombe.
Unit iii patterning and lithography for nanoscale devices 7
introduction to optical/uv electron beam and x-ray lithography systems and processes,
wet etching, dry (plasma /reactive ion) etching, etch resists-dip pen lithography
unit iv preparation environments 9
clean rooms: specifications and design, air and water purity, requirements for particular
processes, vibration free environments: services and facilities required. Working
practices, sample cleaning, chemical purification, chemical and biological
contamination, safety issues, flammable and toxic hazards, biohazards.
Unit v charecterisation techniques 10
x-ray diffraction technique, scanning electron microscopy - environmental techniques,
transmission electron microscopy including high-resolution imaging, surface analysis
techniques- afm, spm, stm, snom, esca, sims-nanoindentation
total = 45 periods
text books:
1. A.s. Edelstein and r.c. Cammearata, eds., nanomaterials: synthesis, properties and
applications, (institute of physics publishing, bristol and philadelphia, 1996)
2. N john dinardo, nanoscale charecterisation of surfaces & interfaces, second edition,
weinheim cambridge, wiley-vch, 2000
45
references:
1. G timp (editor), nanotechnology, aip press/springer, 1999
2. Akhlesh lakhtakia (editor) the hand book of nano technology, “nanometer
structure”, theory, modeling and simulations. Prentice-hall of india (p) ltd, new
delhi, 2007.
It2064 speech signal processing l t p c
3 0 0 3
unit i mechanics of speech 9
speech production: mechanism of speech production, acoustic phonetics - digital
models for speech signals - representations of speech waveform: sampling speech
signals, basics of quantization, delta modulation, and differential pcm - auditory
perception: psycho acoustics.
Unit ii time domain methods for speech processing 9
time domain parameters of speech signal – methods for extracting the parameters
energy, average magnitude, zero crossing rate – silence discrimination using zcr
and energy – short time auto correlation function – pitch period estimation using auto
correlation function.
Unit iii frequency domain method for speech processing 9
short time fourier analysis: fourier transform and linear filtering interpretations,
sampling rates - spectrographic displays - pitch and formant extraction - analysis by
synthesis - analysis synthesis systems: phase vocoder, channel vocoder -
homomorphic speech analysis: cepstral analysis of speech, formant and pitch
estimation, homomorphic vocoders.
Unit iv linear predictive analysis of speech 9
basic principles of linear predictive analysis – auto correlation method – covariance
method – solution of lpc equations – cholesky method – durbin’s recursive algorithm
– application of lpc parameters – pitch detection using lpc parameters – formant
analysis – velp – celp.
Unit v application of speech & audio signal processing 9
algorithms: dynamic time warping, k-means clustering and vector quantization,
gaussian mixture modeling, hidden markov modeling - automatic speech recognition:
feature extraction for asr, deterministic sequence recognition, statistical sequence
recognition, language models - speaker identification and verification – voice response
system – speech synthesis: basics of articulatory, source-filter, and concatenative
synthesis – voip
total = 45 periods
text books:
1. L. R. Rabiner and r. W. Schaffer, “digital processing of speech signals”, prentice
hall, 1978.
2. Ben gold and nelson morgan, “speech and audio signal processing”, john wiley
and sons inc., singapore, 2004.
References:
1. Quatieri, “discrete-time speech signal processing”, prentice hall, 2001.
2. L.r. Rabiner and b. H. Juang, “fundamentals of speech recognition”, prentice hall,
1993.

New Update : Oracle placement papers | Oracle placement papers 2010 with answers | Oracle placement papers with solutions | Oracle MNC Company placement papers | Oracle Freshers Interview Questions

2010-11-05T14:55:00.000+05:30

1.There are six steps that lead from the first to the second floor. No two people can be on the same step
Mr. A is two steps below Mr. C
Mr. B is a step next to Mr. D
Only one step is vacant ( No one standing on that step )
Denote the first step as step1 and second step as step2 etc.

Which of the following is false

i. B&D can be both on odd-numbered steps in one configuration
ii. In a particular configuration A and C must either both an odd numbered steps or both an even-numbered steps
iii. A person E can be on a step next to the vacant step.

(A) i only
(B) ii only
(C) iii only
(D) both i and iii

2. If a boat is moving in upstream with velocity of 14 km/hr and goes downstream with a velocity of 40 km/hr, then what is the speed of the stream ?

(A) 13 km/hr
(B) 26 km/hr
(C) 34 km/hr
(D) none of these

3. Find the value of ( 0.75 * 0.75 * 0.75 – 0.001 ) / ( 0.75 * 0.75 – 0.075 + 0.01)

(A) 0.845
(B) 1.908
(C) 2.312
(D) 0.001

4. A can have a piece of work done in 8 days, B can work three times faster than the A, C can work five times faster than A. How many days will they take to do the work together ?

(A) 3 days
(B) 8/9 days
(C) 4 days
(D) can’t say

5. A car travels a certain distance taking 7 hrs in forward journey, during the return journey increased speed 12km/hr takes the times 5 hrs.What is the distance travelled

(A) 210 kms
(B) 30 kms
(C) 20 kms
(D) none of these

6. Find (7x + 4y ) / (x-2y) if x/2y = 3/2 ?

(A) 6
(B) 8
(C) 7
(D) data insufficient

7. If on an item a company gives 25% discount, they earn 25% profit. If they now give 10% discount then what is the profit percentage.

(A) 40%
(B) 55%
(C) 35%
(D) 30%

8. What does the following piece of code do ?
sprintf(retbuf, “%d”, n);

(A) Print the Integer value of n
(B) Copy the string representation of the integer variable n into the buffer retbuf
(C) Print the Float value of n.
(D) Print the string representation of the integer variable n.

9. What is wrong with the program
double d;
scanf(“%f”, &d);

(A) Instead of %f , %lf should be used for formatting
(B) Instead of %f , %d should be used for formatting
(C) Instead of %f , %D should be used for formatting
(D) Instead of %f , %n should be used for formatting

10. What fucntion will read a specified number of elements from a file?

(A) readfile()
(B) fread()
(C) fileread()
(D) getline()

11.
#include
void func()
{
int x = 0;
static int y = 0;
x++; y++;
printf( “%d — %d\n”, x, y );
}
int main()
{
func();
func();
return 0;
}

What will the code above print when it is executed?
(A) 1– 1
1 – 1
(B) 1 — 1
1 — 2
(C) 1 — 1
2 — 1
(D) 1 — 0
1 — 0

12. What is the output of the following loop:
for(I=0, j=I++; j>I; j++, I++)
{
printf(“%d%d”, I, j);
}

(A) 0,1
(B) 0,0
(C) Infinite loop
(D) No output

13. Consider the following structure
struct
{
int data;
struct node *prev;
struct node *next;
}node;

NULL ß 5 à 8 à 10 à NULL
ß ß
p q r

What will be the value of r à prev à next à data ?

(A) 10
(B) 8
(C) 5
(D) NULL

14. What is the output :
void main()
{
int a,b=5,c=10;
a = (b-c) > (c-b) ? b : c;
printf(“%d”,a);
}
(A) 10
(B) 5
(C) 0
(D) Error

15. Which section of a PL/SQL block would most likely contain a RAISE statement?

(A) Header
(B) Declarative
(C) Executable
(D) Exception

16. Select the VALID trigger type(s)?

(A) AFTER statement trigger
(B) INSERT row trigger
(C) DELETE row trigger
(D) All of the above

17. Which section of a PL/SQL block would most likely contain a RETURN statement?

(A) Header
(B) Declarative
(C) Executable
(D) Exception

18. Select the non valid PL/SQL Data Type(s)?

(A) BOOLEAN
(B) LONG
(C) STRING
(D) DATE

19. Which function below can best be categorized as similar in function to an IF-THEN-ELSE statement?

(A) SQRT
(B) DECODE
(C) NEW_TIME
(D) ROWIDTOCHAR

20. Which one of the following does not require a number parameter?

(A) sinh
(B) to_number
(C) SQRT
(D) round

21. The user issues the following statement. What will be displayed if the EMPID selected is 60494?

SELECT DECODE(empid,38475, “Terminated”,60494, “Recruited”,
“Not Recruited”) FROM emp;

(A) 60494
(B) 38475
(C) Terminated
(D) Recruited

22. In order to perform an inner join, which criteria must be true?

(A) The common columns in the join do not need to have shared values.
(B) The tables in the join need to have common columns.
(C) The common columns in the join may or may not have shared values.
(D) The common columns in the join must have shared values.

23. Once defined, how long will a variable remain so in SQL*Plus?

(A) Until the database is shut down
(B) Until the instance is shut down
(C) Until the statement completes
(D) Until the session completes

24. The default character for specifying runtime variables in SELECT statements is

(A) Ampersand
(B) Colon
(C) Hash
(D) Astreik

25. A user is setting up a join operation between tables EMP and DEPT. There are some employees in the EMP table that the user wants returned by the query, but the employees are not assigned to departments yet. Which SELECT statement is most appropriate for this user?

(A) select e.empid, d.head from emp e, dept d;
(B) select e.empid, d.head from emp e, dept d where e.dept# = d.dept#;
(C) select e.empid, d.head from emp e, dept d where e.dept# = d.dept# (+);
(D) select e.empid, d.head from emp e, dept d where e.dept# (+) = d.dept#;

26. For avoiding a Cartesian product of 4 tables, the minimum no: of Joins required after WHERE clause is:

(A) 2
(B) 3
(C) 4
(D) 5

27. Which one of the following uses of the HAVING clause is inappropriate?

(A) To put returned data into sorted order
(B) To exclude certain data based on known criteria
(C) To include certain data based on unknown criteria
(D) To include certain data based on known criteria

28. The “emp” table contains 14 rows. How many rows will the following query return?
SQL> Select * from Emp where rownum > 5;

(A) 9
(B) 10
(C) 0
(D) Error

29. Which line in the following SELECT statement will produce an error?

Line1: SELECT dept, AVG(salary)
Line2: FROM emp
Line3: GROUP BY empid;

(A) Line 1 and Line 2
(B) Line 3
(C) Only Line 1
(D) There are no errors in this statement.

30. Which of the following integrity constraints automatically create an index when defined?

(A) Foreign keys
(B) Unique constraints and Primary Keys
(C) NOT NULL constraints
(D) Both a and b.

—————————————————————————

1. Which of the following is not similar with the others?

(A) cube
(B) sphere
(C) pyramid
(D) circle

2. Consider the following flow chart for a customer:

The person in No.1 is:

(A) Married, with children
(B) Married, with at least one son
(C) Unmarried, with at least one daughter
(D) Unmarried, with at least one son

3. Susan can type 10 pages in 5 minutes. Mary can type 5 pages in 10 minutes. Working together, how many pages can they type in 30 minutes?

(A) 15
(B) 20
(C) 65
(D) 75

4. Consider the following series:
4, 6, 9, 13, ____ What comes next?

(A) 15
(B) 16
(C) 17
(D) 18

There are six steps that lead from the first to the second floor. No two people can be on the same step
Mr. A is two steps below Mr. C
Mr. B is a step next to Mr. D
Only one step is vacant ( No one standing on that step )
Denote the first step by step 1 and second step by step 2 etc.

5. If Mr. A is on the first step, Which of the following is true?

(A) Mr. B is on the second step
(B) Mr. C is on the fourth step.
(C) A person Mr. E, could be on the third step
(D) Mr. D is on higher step than Mr. C.

6. If Mr. E was on the third step & Mr. B was on a higher step than Mr. E which step must be vacant

(A) step 1
(B) step 2
(C) step 4
(D) step 5

7. If Mr. B was on step 1, which step could A be on?

(A) 2&3 only
(B) 3&5 only
(C) 3&4 only
(D) 4&5 only

8. If there were two steps between the step that A was standing and the step that B was standing on, and A was on a higher step than D , A must be on step

(A) 2
(B) 3
(C) 4
(D) 5

9. int z;
int x = 5;
int y = -10;
int a = 4;
int b = 2;

z = x++ – –y * b /a;

What number will z in the sample code above contains
(A) 5
(B) 6
(C) 10
(D) 11

10. f = fopen( fileName, “r” );
if( ???? )
{
fprintf( stderr, “Cound not open file!” );
exit( -1 );
}

What should replace the ???? in the code above to determine if the file could not be opened?

(A) f == NULL
(B) f == EOF
(C) f != 0;
(D) f == -1

11. int x[] = { 1, 4, 8, 5, 1, 4 };
int *ptr, y;
ptr = x + 4;
y = ptr – x;
What does y in the sample code above equal?

(A) -3
(B) 0
(C) 4
(D) 4 + sizeof( int )

12. #include
void func()
{
int x = 0;
static int y = 0;
+; y++;
printf( “%d — %d\n”, x, y );
}
int main()
{
func();
func();
return 0;
}

printf(“%d\n”, 64>>3);
What will the sample code above produce when executed?

(A) 8
(B) 16
(C) 32
(D) 256

13. What is the output of the following code:
char str[20] = “ENIGMA”;
char *p, *q, *r;
q=p++;
r=p+3 – (p-q);
printf(“%3s%5s”, (++p)+3, r);

(A) ENIGMA
(B) GMA
(C) No output
(D) Error.

14. #include
void inc_count(int count)
{
count ++;
}
int main()
{
int count = 0; /* number of times through */
while (count < 10)
inc_count(count);
return count ;
}
What will be the value returned by the function main?

(A) 0
(B) 10
(C) 9
(D) Null

15. What is the correct way to define a constant pointer?

(A) const char *name_ptr = “TEST”;
(B) char *const name_ptr = “TEST”;
(C) Both
(D) None of Above.

16. Which one of the following are parts of an entity relationship diagram?
(A) Referential integrity constraints
(B) Entities and Relationships
(C) Triggers
(D) Both a and b

17. The transaction control that prevents more than one user from updating data in a table is called
(A) Locks
(B) Commits
(C) Rollbacks
(D) Savepoints

18. Any locks placed in a session can be released issuing which of the following statements

(A) commit
(B) rollback
(C) Both a and b
(D) By a savepoint

19. Which of the following statements are true about roles?

(A) Roles can be granted to other roles and/or users.
(B) Privileges can be granted to roles.
(C) Roles can be granted to synonyms.
(D) Both a and b.

20. The limit for the number of parameters for a pl/sql procedure is

(A) 256
(B) No Limit at all
(C) Depends on the type of parameters passed to the procedure
(D) Depends on Positional Parameters passed.

21. The exact content and the storage representation of a column in database can be found out using the function

(A) translate
(B) to_char
(C) dump
(D) substr

22. A view is a

(A) A Table in the database belonging to different schema.
(B) A query stored in the database in the form of an object.
(C) A part of a table
(D) All the above.

23. The key word used in sql for string searching is

(A) LIKE
(B) NVL
(C) GROUP BY
(D) HAVING

24. For referrential integrity to be maintained.

(A) Every foreign key value must have a corresponding primary/unique key value
(B) No Forein key should have a corresponding primary key value.
(C) There should be an index on the tables.
(D) The tables should be in different schemas of the database.

25. A ddl statment in a pl/sql can be issued in a pl/sql block using the package

(A) dbms_output
(B) dbms_sql
(C) UTL_FILE
(D) dbms_job

26. Choose the result of the following sql statement.

SELECT hire_date
FROM emp
where to_char(hire_date) > ‘01-FEB-00’;

(A) 01-APR-00
(B) 01-OCT-00
(C) 01-APR-99
(D) 01-DEC-00

27. Purity level of a function can be checked using

(A) PRAGMA EXCEPTION_INIT.
(B) PRAGMA RESTRICT REFERENCES
(C) DBMS_OUTPUT.
(D) DBMS_SQL.

28. The __________ Statement is used to run the pl/sql block.

(A) Get filename
(B) start filename
(C) run filename
(D) None of the above

29. Difference between %TYPE and %ROWTYPE

——————————————————————

1. A certain number of men can finish a piece of work in 10 days. If however there were 10 men less it will take 10 days more for the work to be finished. How many men were there originally?

(A) 110 men
(B) 130 men
(C) 100 men
(D) none of these

2. In simple interest what sum amounts of Rs.1120/- in 4 years and Rs.1200/- in 5 years ?

(A) Rs. 500
(B) Rs. 600
(C) Rs. 800
(D) Rs. 900

3. If a sum of money compound annually amounts of thrice itself in 3 years. In how many years will it become 9 times itself.

(A) 6
(B) 8
(C) 10
(D) 12

4. Two trains move in the same direction at 50 kmph and 32 kmph respectively. A man in the slower train observes the 15 seconds elapse before the faster train completely passes by him.
What is the length of faster train ?

(A) 100m
(B) 75m
(C) 120m
(D) 50m

5. How many mashes are there in 1 squrare meter of wire gauge if each mesh is 8mm long and 5mm wide ?

(A) 2500
(B) 25000
(C) 250
(D) 250000

6. x% of y is y% of ?

(A) x/y
(B) 2y
(C) x
(D) can’t be determined

7. The price of sugar increases by 20%, by what % should a housewife reduce the consumption of sugar so that expenditure on sugar can be same as before ?

(A) 15%
(B) 16.66%
(C) 12%
(D) 9%

8. A man spends half of his salary on household expenses, 1/4th for rent, 1/5th for travel expenses, the man deposits the rest in a bank. If his monthly deposits in the bank amount 50, what is his monthly salary ?

(A) Rs.500
(B) Rs.1500
(C) Rs.1000
(D) Rs. 900

9. What is the difference between the two declaration ?

#include
&
#include “stdio.h”

(A) No Difference
(B) The 2nd declaration will not compile
(C) First case Compiler looks in all default location and in 2nd case only in the working directory
(D) Depends on the Compiler

10. How can I print a “%” character in a in between the string foo and the value held in the variable foo using printf format string?

(A) fprintf(“foo ” “%” “%d\n”, foo);
(B) fprintf(“foo ‘%’ %d\n”, foo);
(C) fprintf(“foo \% %d\n”, foo);
(D) fprintf(“foo ” “%d\n”, foo);

11. What is the output of the following program
#include
#define FIRST_PART 7
#define LAST_PART 5
#define ALL_PARTS FIRST_PART + LAST_PART

int main() {

printf (“The Square root of all parts is %d\n , ALL_PARTS * ALL_PARTS) ;
return(0);
}

(A) 35
(B) 144
(C) 49
(D) 47

12. What is the use of a make file

(A) Do detect memory leakage
(B) To optimise the code
(C) To link and compile source code to exe
(D) To disassemble the exe to source code

13. What is the difference between calloc and malloc

(A) calloc allocates memory in contiguous bytes, malloc does not ensure contiguous memory allocation
(B) Memory allocated through calloc need not be freed explicitly, While memory allocated through malloc needs to be freed explicitly.
(C) calloc initialises the memory by setting all-bits-zero, malloc does not does any zero fill.
(D) all of the above

14. What is the output :
void main()
{
int a,b=5,c=10;
a = (b-c) > (c-b) ? b : c;
printf(“%d”,a);
}

(A) 10
(B) 5
(C) 0
(D) Error

15. What is the value of *second_ptr

int *first_ptr;
int *second_ptr;

*second_ptr = 30;
ptr value = 1;
first_ptr = &value
second_ptr = first_ptr;

(A) 30
(B) 1
(C) first_ptr
(D) None of the above

16. How many columns are retrieved from this query:
SELECT address1||’,'||address2||’,'||address2 “Adress” FROM employee;

(A) 1
(B) 2
(C) 3
(D) 0

17. To produce a meaningful result set without any cartesian products, what is the minimum number of conditions that should appear in the WHERE clause of a four-table join?

(A) 8
(B) 3
(C) 4
(D) 5

18. Assuming today is Monday, 10 July 2000, what is returned by this statement:

SELECT to_char(NEXT_DAY(sysdate, ‘MONDAY’), ‘DD-MON-RR’) FROM dual;

(A) 10-JUL-00
(B) 12-JUL-00
(C) 11-JUL-00
(D) 17-JUL-00

19. Which character is used to continue a statement in SQL*Plus?

(A) *
(B) /
(C) -
(D) @

20. When a user creates an object without a TABLESPACE clause, where will Oracle store the segment?

(A) System tablespace
(B) Users tablespace
(C) Default tablespace for the user
(D) Oracle will give an error

21. The primary key on table EMP is the EMPNO column. Which of the following statements will not use the associated index on EMPNO?

(A) select * from EMP where nvl(EMPNO, ’00000′) = ’59384′;
(B) select * from EMP where EMPNO = ’59384′;
(C) select EMPNO, LASTNAME from EMP where EMPNO = ’59384′;
(D) select 1 from EMP where EMPNO = ’59834′;

22. Which character function can be used to return a specified portion of a character string?

(A) INSTR
(B) SUBSTRING
(C) SUBSTR
(D) POS

23. Which command will delete all data from a table and will not write to the rollback segment?

(A) DROP
(B) DELETE
(C) CASCADE
(D) TRUNCATE

24. Which of the following can be a valid column name?

(A) Column
(B) 1966_Invoices
(C) Catch_#22
(D) #Invoices

25. Which Oracle access method is the fastest way for Oracle to retrieve a single row?

(A) Primary key access.
(B) Access via unique index
(C) Table access by ROWID
(D) Full table scan

26. In this PL/SQL statement, which of the following lines will produce an error?

(A) cursor CAPITALS is select CITY, STATE
(B) into my_city, my_state
(C) from CITIES
(D) where CAPITAL = ‘Y’;

27. In a PL/SQL block, a variable is declared as NUMBER without an initial value. What will its value be when it is used in the executable section of the PL/SQL block?

(A) NULL
(B) 0
(C) Results in a compilation error
(D) An exception will be raised

28. PL/SQL raises an exception, in which TWO of the following cases:

(A) When a SELECT statement returns one row
(B) When a SELECT statement returns more than one row
(C) When the datatypes of SELECT clause and INTO clause do not match
(D) When INTO statement is missing in the SELECT statement

29. What is the result if two NULL values are compared to each other?

(A) TRUE
(B) FALSE
(C) Undefined
(D) NULL

30. Functions for error trapping are contained in which section of a PL/SQL block?

(A) Header
(B) Declarative
(C) Executable
(D) Exception

Nested INNER JOIN Statements May be Ineffective or inefficient | SAP Programming | ABAP

2010-08-05T06:46:00.000+05:30

"Using several nested INNER JOIN statements can be inefficient and cause time out if the tables become too big in the future."

Joins here (in ABAP) are not those Native SQL Joins. If you are talking about the Core RDBMS, which mean Oracle or SQL Server, then Undoubtedly Joins are the best.

In ABAP, these joins are first split by the ABAP processor and then sent to the database, with the increase in DATA in production system, these joins tend to give way if your database keeps growing larger and larger.

You should rather used "FOR ALL ENTRIES IN" (Tabular conditions), which is a much effecient way as far as performance is concerned.

For example :

DATA: BEGIN OF LINE,
        CARRID   TYPE SPFLI-CARRID,
        CONNID   TYPE SPFLI-CONNID,
        CITYFROM TYPE SPFLI-CITYFROM,
        CITYTO   TYPE SPFLI-CITYTO,
      END OF LINE,
      ITAB LIKE TABLE OF LINE.

LINE-CITYFROM = 'FRANKFURT'.
LINE-CITYTO   = 'BERLIN'.
APPEND LINE TO ITAB.

LINE-CITYFROM = 'NEW YORK'.
LINE-CITYTO   = 'SAN FRANCISCO'.
APPEND LINE TO ITAB.

SELECT CARRID CONNID CITYFROM CITYTO
INTO   CORRESPONDING FIELDS OF LINE
FROM   SPFLI
FOR ALL ENTRIES IN ITAB
WHERE CITYFROM = ITAB-CITYFROM AND CITYTO = ITAB-CITYTO.

WRITE: / LINE-CARRID, LINE-CONNID, LINE-CITYFROM, LINE-CITYTO.

ENDSELECT.

Purpose of Using PACKAGE SIZE in Select Statement in SAP ABAP Programming

2010-08-05T06:44:00.000+05:30

Package size can be used if you for example only want to finish processing a limited amount of data at a time due to lack of memory.

The example below read 50 records at a time from VBAK into an internal table, and selects the corresponding entries from vbap into an internal table. Then the two internal tables can be processed, and the next 50 records from VBAk can be read. Remember to reinitialize tha tables before the next read.

REPORT z_test.

TYPES:
BEGIN OF t_vbak,
vbeln LIKE vbak-vbeln,
erdat LIKE vbak-erdat,
END OF t_vbak,

BEGIN OF t_vbap,
posnr LIKE vbap-posnr,
matnr LIKE vbap-matnr,
meins LIKE vbap-meins,
END OF t_vbap,

BEGIN OF t_report,
vbeln LIKE vbak-vbeln,
erdat LIKE vbak-erdat,
posnr LIKE vbap-posnr,
matnr LIKE vbap-matnr,
meins LIKE vbap-meins,
END OF t_report.

DATA:
li_vbak TYPE t_vbak OCCURS 0,
l_vbak TYPE t_vbak,
li_vbap TYPE t_vbap OCCURS 0,
l_vbap TYPE t_vbap,
li_report TYPE t_report OCCURS 0,
l_report TYPE t_report.

START-OF-SELECTION.
SELECT vbeln erdat
FROM vbak
INTO TABLE li_vbak PACKAGE SIZE 50.
SELECT posnr matnr meins
FROM vbap
INTO TABLE li_vbap
FOR ALL ENTRIES IN li_vbak
WHERE vbeln = li_vbak-vbeln.
IF sy-subrc = 0.
* Now you have the two internal tables li_vbak and li_vbap filled
* with data.
* Do something with the data - remember to reinitialize internal
* tables
ENDIF.
ENDSELECT.

Usage of 'for all entries' in Select Statement | SAP ABAP Programming

2010-08-05T06:43:00.000+05:30

FORM data_retrieval.

DATA: ld_color(1) TYPE c.

DATA: BEGIN OF T_VBAP OCCURS 0,
VBELN LIKE VBAP-VBELN,
MATNR LIKE VBAP-MATNR,
POSNR LIKE VBAP-POSNR,
END OF T_VBAP.

DATA: BEGIN OF T_VBFA OCCURS 0,
VBELV LIKE VBFA-VBELV,
VBELN LIKE VBFA-VBELN,
VBTYP_N LIKE VBFA-VBTYP_N,

END OF T_VBFA.

DATA: BEGIN OF T_VBAK OCCURS 0,
VBELN LIKE VBAK-VBELN,
IHREZ LIKE VBAK-IHREZ,
END OF T_VBAK.

DATA: BEGIN OF T_KNA1 OCCURS 0,
KUNNR LIKE KNA1-KUNNR,
NAME1 LIKE KNA1-NAME1,
END OF T_KNA1.

DATA: BEGIN OF T_MAKT OCCURS 0,
MATNR LIKE MAKT-MATNR,
MAKTX LIKE MAKT-MAKTX,
END OF T_MAKT.

SELECT likp~vbeln likp~lifex likp~bldat likp~wadat likp~wadat_ist likp~kodat likp~lfart
likp~kunnr likp~vstel lips~posnv lips~lfimg lips~vrkme lips~lgmng lips~meins
lips~werks lips~lgort lips~charg lips~vbelv lips~posnr lips~matnr
lips~vbeln LIPS~VGBEL LIPS~VGPOS vbup~kosta vbup~wbsta vbup~posnr vbup~vbeln
* VBAK~IHREZ VBAK~VBELN VBAP~VBELN
INTO CORRESPONDING FIELDS OF TABLE it_itab
FROM ( likp
INNER JOIN lips
ON lips~vbeln = likp~vbeln
INNER JOIN vbup
ON vbup~posnr = lips~posnr
and VBUP~VBELN = LIPS~VBELN )
* left outer join VBAK
* on VBAK~VBELN = LIPS~VGBEL
* inner join VBAP
* on VBAP~VBELN = VBAK~VBELN )
WHERE likp~vbeln IN so_vbeln
AND likp~lifex IN so_lifex
AND likp~lfart IN so_lfart
AND likp~kunnr IN so_kunnr
AND likp~vstel IN so_vstel
AND likp~bldat IN so_bldat
AND likp~wadat_ist IN so_wadat
AND vbup~kosta IN so_kosta
AND vbup~wbsta IN so_wbsta
AND LIPS~LFIMG NE 0.

SELECT VBELN IHREZ INTO TABLE T_VBAK
FROM VBAK
FOR ALL ENTRIES IN IT_ITAB
WHERE VBELN = IT_ITAB-VGBEL.
* APPEND T_VBAK.
* ENDSELECT.

SELECT VBELN MATNR POSNR INTO TABLE T_VBAP
FROM VBAP
FOR ALL ENTRIES IN IT_ITAB
WHERE VBELN = IT_ITAB-VGBEL AND
MATNR = IT_ITAB-MATNR AND
POSNR = IT_ITAB-VGPOS.
* APPEND T_VBAP.
* ENDSELECT.

SELECT VBELV VBELN VBTYP_N INTO TABLE T_VBFA
FROM VBFA
FOR ALL ENTRIES IN IT_ITAB
WHERE VBELV = IT_ITAB-VBELN AND
VBTYP_N = 'M' .

SELECT KUNNR NAME1 INTO TABLE T_KNA1
FROM KNA1
FOR ALL ENTRIES IN IT_ITAB
WHERE KUNNR = IT_ITAB-KUNNR.
* APPEND T_KNA1.
* ENDSELECT.

SELECT MATNR MAKTX INTO TABLE T_MAKT
FROM MAKT
FOR ALL ENTRIES IN IT_ITAB
WHERE MATNR = IT_ITAB-MATNR.
* APPEND T_MAKT.
* ENDSELECT.

*Populate field with color attributes

LOOP AT it_itab INTO wa_ITAB.

* Populate color variable with colour properties

* Char 1 = C (This is a color property)

* Char 2 = 3 (Color codes: 1 - 7)

* Char 3 = Intensified on/off ( 1 or 0 )

* Char 4 = Inverse display on/off ( 1 or 0 )

* i.e. wa_ekko-line_color = 'C410'
REFRESH color.
colourize 'VBELN' 0. " .
WA_ITAB-farbe = color[].

ld_color = ld_color + 1.

* Only 7 colours so need to reset color value

IF ld_color = 3. "8

ld_color = 1.

ENDIF.

CONCATENATE 'C' ld_color '10' INTO wa_ITAB-line_color.
WA_ITAB-NAME1 = ''.
WA_ITAB-MAKTX = ''.
WA_ITAB-IHREZ = ''.
WA_ITAB-VBELV = ''.
READ TABLE T_KNA1 WITH KEY KUNNR = WA_ITAB-KUNNR.
IF SY-SUBRC = 0.
WA_ITAB-NAME1 = T_KNA1-NAME1.
ENDIF.
READ TABLE T_MAKT WITH KEY MATNR = WA_ITAB-MATNR.
IF SY-SUBRC = 0.
WA_ITAB-MAKTX = T_MAKT-MAKTX.
ENDIF.
READ TABLE T_VBAK WITH KEY VBELN = WA_ITAB-VGBEL.
IF SY-SUBRC = 0.
WA_ITAB-IHREZ = T_VBAK-IHREZ.
ENDIF.
READ TABLE T_VBFA WITH KEY VBELV = WA_ITAB-VBELN.
IF SY-SUBRC = 0.
WA_ITAB-VBELVA = T_VBFA-VBELN.
ENDIF.
* READ TABLE T_VBAP WITH KEY VBELN = WA_ITAB-VGBEL
* POSNR = WA_ITAB-VGPOS
* MATNR = WA_ITAB-MATNR.
* IF SY-SUBRC = 0.
* WA_ITAB-IHREZ = T_VBAK-IHREZ.
* ENDIF.

* wa_ekko-line_color = 'C410'.

MODIFY it_itab FROM wa_itab.

ENDLOOP.

ENDFORM. " data_retrieval

"SY-UCOMM and OK_CODE in Dialog Program | SAP ABAP Programming

2010-07-19T22:17:00.000+05:30

What is the difference between SY-UCOMM and OK_CODE in Dialog Program?

sy-ucomm is for doing the functions what the user wishes to do at that particular event. You use it in menus and other place . this mainly in using

ok_code is generally used in screen as of I have used. You will define the function in the screen. and you can use it in the main program.

ok_code acts just as a temporary variable that stores the value of sy-ucomm.

When user interacts with the screen elements, the function code that you have assigned is filled in the sy-ucomm field which is turn gets reflected in OK_CODE.

In your ABAP programs, you should work with the OK_CODE field instead of SY-UCOMM. There are two reasons for this: Firstly, the ABAP program has full control over fields declared within it, and secondly, you should never change the value of an ABAP system field. However, you should also always initialize the OK_CODE field in an ABAP program for the following reason:

In the same way that the OK_CODE field in the ABAP program and the system field SY-UCOMM receive the contents of the corresponding screen fields in the PAI event, their contents are also assigned to the OK_CODE screen field and system field SYST-UCOMM in the PBO event. Therefore, you must clear the OK_CODE field in the ABAP program to ensure that the function code of a screen is not already filled in the PBO event with an unwanted value. This is particularly important when the next PAI event can be triggered with an empty function code (for example, using ENTER). Empty function codes do not affect SY-UCOMM or the OK_CODE field, and consequently, the old field contents are transported.

Asset Master Data Upload | SAP FICO | Financial Modules | The Financial Statement Closing Tcodes | LSMW

2010-07-19T22:15:00.000+05:30

1. If the change of the field can be put into an algorithm (e.g., enter XYZ as a super number for all assets in class 1234), you can use a mass change rule. You first define the mass change rule in the same way as you would define an asset substitution (IF something, THEN something else), then you go into the mass change transaction, select the right assets, the proper change rule ... and hit Execute.

2. Very often, it is easier to prepare the data in Excel and use transaction AS02 for the upload. Here, I can recommend transaction LSMW - you simulate (and record) the AS02 transaction on one fixed asset master, then follow all the steps proposed by the system (define fixed values, variables, etc.) and finally upload the Excel (.csv). System will automatically generate a batch input for all assets. It may take some time for you if you do it for the first time, but it is the best way if you would otherwise need to define complex algorithms.

So - use option 1 if you have a simple algorithm for many assets, and option 2 if "each case is different" or if you feel more comfortable in Excel than ABAP. Option 2 is simple, but of course takes some time to generate the upload and then run the batch sessions (while option 1 changes everything instantly in a matter of seconds).

Here are the details:

I. To use mass change:

1. First, define a mass change rule in transaction OA02 (Accounting - Financial accounting - Fixed assets - Environment - Mass change rule). For each company code, you can define one rule (or a sequence of them). However, all of them will always be executed at the same time. Therefore, if you need to define different rules for different assets, you will have to do this repeatedly. Technically, this is done in the same way as AA substititution.

2. Once the rule is defined, you need to select assets for mass change. Go to transaction AR01 (Accounting - Financial accounting - Fixed assets - Environment - Worklist - Generate). Enter selection criteria like on any standard AA report, and run Execute. I cannot simulate this now on my system (we do not have AA), but it should ask what you want to do (mass change, mass retirement, etc.) and ask for a name of the worklist (write anything - e.g., Super number change). The system will show you a list of selected assets in a report format. Check it and make sure that it is correct. You may add or remove single assets from this (now cannot tell you how, but it is possible). If you are happy with the list, save it.

3. The last step is execution of the change. Go to transaction AR31 (same path as above), execute the report and if you are happy with the list (same as in step 2), press Save. System will show you a log of change (what went through, which errors occured). You are done.

II. LSMW
LSMW is a transaction, which will let you mass upload almost any other transaction (FB01, FD01, AS91, etc.). You do it in the following way:
1. Enter into transaction LSMW (no menu path), possibly in a development / test system
2. First, define a project, subproject and object (relatively formal task).
3. On the horizontal menu, go to Goto -> Recordings. Click on "Create recording".
4. Enter the name and description of recording (freely definable).
5. I cannot simulate this now in my system, but SAP will ask you about transaction code (AS02) and will take you into the AS02 transaction. In this step, do the change manually. Make sure you "touch" (change / write something) in all fields which you want to update.
6. Once you are done, save the recording and return on the start page of LSMW. Click "Execute".
7. You will see a list of tasks. Do them one by one. They should be relatively simple (and I cannot help you with them). Important is step 3 (maintain source fields) - here you define the columns of your excel (csv) file in the particular order. In step 5 (field mapping and conversion rule), you assign file columns to SAP fields (note that you will see only those fields which you "touched" during recording). You need to go through all the steps. In the end, you get (and run) a batch session.
8. If you did this in a development system, transport the LSMW object (menu Extras - Export project, Extras - Import project). You have to do it via file, not via standard transports of configuration (it is perhaps more simple).

Make sure you test it first in development or quality system!

Fiscal Year Variant

Assuming that you are newly implemention with go live date of Sept 1st 2006 and Fiscal year January - December, what will be the best way?
Would it be better to define a Shortened Fiscal year for Sept-Dec 2006 and then regular Fiscal years OR Define a full Fiscal year for the entire 2006 and future FYs

Normally, the best way is to keep it simple and leave the first year "normal" (12 + 4 months starting January). You convert old data as of August 31 (unless the client requests opening balance as of December 31, 2005 and then monthly movements - I have experienced both options) and then start normal bookings in month 9 on September 1.

We never tried shortened fiscal year in this context and it is surely not needed here. It just adds complexity.

If we create the normal Jan-Dec Fiscal Year for 2006 also, how will we handle the assets when we go live in Oct 2006? Do we load the book value at that time or we load the book value for January 2006 and depreciate in the system for January to September

The ordinary way is to load fixed assets which exist on September 30 (if you go live with AA module on October 1) with trans. AS91.
- First, you need to set in configuration that the last closed fiscal year for legacy data upload is 31.12.2005 and the last period for depreciation will be 9/2006. (Do it in IMG: Financial accounting - Asset accounting - Asset data transfer - Parameters for data transfer - Date specifications)

Within trans. AS91, you enter the following values:
- acquisition value and accummulated depreciation as of 01 January 2006
- all asset movements (acquisitions, retirements, but not ordinary depreciations) between January 1 and September 30 with their respective dates
- already posted depreciation in 2006 until September 30

Then you enter GL movements per month (either you temporarily change the asset reconciliation accounts for direct booking with trans. OAMK, then book with FB01 and finally reset with OAK5, or you book there directly with trans. OASV). This way, your asset accounts (acquisition value and accummulated depreciation) are the same as asset module as of September 30.

You can also let the system recalculate the depreciation from the beginning of the year, but then you may end up with a different value as of September 30 than your legacy system calculated. So, I would not recommend it unless there is no reliable source data.

Process Fixed Asset Depreciation | Forecast | Financial Modules | FICO SAP

2010-07-19T22:13:00.000+05:30

Every asset transaction immediately causes a change of the forecasted depreciation. However, it does not immediately cause an update of the depreciation and value adjustment accounts for the balance sheet and profit and loss statements. The planned depreciation is posted to the general ledger when you run the periodic depreciation posting run. This posting run uses a batch input session to post the planned depreciation for each posting level for each individual asset as a lump sum amount.

The calculation and scheduling of depreciation, interest and revaluation are automatically controlled by keys in the system, or you can control them manually using a special posting transaction. In both cases, planned depreciation from Asset Accounting must be periodically posted to the corresponding asset and expense accounts of the general ledger. You carry out this posting using a batch input session. In addition to the various depreciation types, interest and revaluation, this batch input session also posts the allocation and writing off of special reserves.

When the system posts depreciation, it creates collective documents. It does not create separate documents for each asset.

Depreciation Posting Run is done via transaction code 'AFAB'.

The program creates batch input sessions for posting depreciation and interest to the G/L accounts in Financial Accounting and/or to Controlling.

Fields Description :-

Company code : Your Company Code

Fiscal Year : Your fiscal year

Posting period : Your depreciation period

Reason for posting run (choose one)

Planned posting run : X (default)

List assets : (tick if you want to see the detail)

Test run : (tick if you run in test mode else untick for production run)

Main asset number : (you can specify certain asset number if you click repeat run or test run)

Note :
Click the execute button if this is a test run.
Click the menu bar -> Program -> Execute in background if this is a production run.

You should get this message :
Background job was scheduled for program RABUCH00 and print out the output.

Release and Process the Batch Input Session in transaction code 'SM35'.

Process Session RABUCH00
X - Display errors only
Additional functions
X - Dynpro standard size

Click the Process button

If there is error, the system will pop up the error message.

Correct the error and recreate the session in transaction 'AFBD'.

PP - Controlling data for your Bill of Materials

2010-07-11T19:14:00.001+05:30

You define the default values for BOM in OS28. - Based quantity - BOM Status - Size Unit - Var-size item unit You control the Material type allowed for the BOM header in transaction OS24. In transaction OS27, you define the central settings for your BOM management system. This are one-time settings for BOM management, which should not be change after production.

Low date When you create or process BOMs, the default date is the date defined in your system as the earliest processing date (01/01/1900 in the standard system). BOM validity maintenance Tick if want the user to specify a valid-from date when maintaining BOMs. If not tick the BOM created as of the current date or the system low date (1/1/1990). EC management active Tick if you want to make historical changes to BOMs with reference to a change number. (This means that the status of the BOM both before and after the change is stored in the system.) In this step, you only specify whether engineering change management can be used for maintaining bills of material. In transaction OS25, Configure history requirement for BOMs, you define whether you want to make the use of engineering change management a requirement in certain cases. Hist. reqmt variant Use this indicator to control when history requirement applies to new variants or alternatives in a BOM group. Sub-item documentn You use the Sub-item documentation indicator to define whether changes to sub-items are documented. Header Create BOM header with parameter validity TECHINCAL TYPE Mult. BOM inactive Tick if no multiple BOMs can be maintained in this R/3 system. Variant BOM inactive Tick if no variant BOMs can be maintained in this R/3 system BILL OF MATERIAL ITEM BOM item explosion type If you create a BOM item with reference to a change number and change the valid-from date (in the change header or alternative date), then this can change the sequence of validity periods of a BOM item. The indicator BOM item explosion type specifies whether and according to what rules, the system determines a unique change status, when you display, evaluate or change a BOM to a date in the overlap period. Description variable-sized item This indicator controls which text is displayed in BOM processing for a variable-sized item. Repeated effectivity via external item ID This indicator ensures that an item that already exists under an external item ID can be used. General settings Unit 'piece' In the standard system, this field contains a unit of measure for "piece". You can change this unit. This unit is the base unit of measure (BOM header) or the component unit of measure. Base unit of measure for: Equipment BOM Functional location BOM Document structure Standard BOM Component unit of measure for: Text item Document item Non-stock item without material master record CAD active If you want to maintain BOMs from a CAD system, set this indicator. This activates an additional field in the BOM header and BOM item, which tells you whether the BOM header or BOM item was maintained from a CAD system. If you deactivate engineering change management, changes to bills of material are not recorded. The modification parameters defined here apply to all BOM categories. The following settings are made in the standard R/3 System: 1. Validity date maintenance and engineering change management are active. 2. The current system date is the default valid-from date. 3. CAD is active. 4. Explosion type for BOM item: blank.

When is a Material BOM Not Exploded?

2010-07-11T19:13:00.002+05:30

A BOM is not exploded in the following situations:

- No BOM is effective:
-- On the explosion date and in the given area of validity For the given effectivity parameters

- The BOM has a deletion indicator.

- The BOM is a multiple BOM, and has no alternative that matches the lot size for your required quantity.

- No BOM matches the selection criteria of the BOM application you selected.

- This is possible in the following situations, for example:

-- The application does not take all BOM usages into account.
For example, the application only takes BOMs that are relevant to production into account, so a BOM that is relevant to sales and distribution is not exploded.

-- The application selects a specific alternative on the explosion date you require. The material master record supports alternative determination by Explosion date.
If the specified alternative is not valid on the explosion date, the BOM is not exploded.

-- The application takes production versions in the material master record into account, but no production version has a BOM that is valid on the explosion date you require. The material master record supports alternative determination by Production version.
The system only explodes the BOM defined for the production version that matches the alternative and/or usage entered on the explosion date required.

-- The application only takes BOMs with certain status indicators into account.
For example, the application for MRP only explodes BOMs that have at least the status Explosion for MRP.

Further checks:
- Do the proper Scheduling in Routing (Backward/forward). In md61 give the requirement in next month.check your in-house production, planned delivery time in md02 give MRP Control parameter Rexplode BOM and Routing.

- Check BOM explosion data in MRP4 view of material master view ( Individual/Coll data).

How to link BOM component to storage location? | SAP Production Systems

2010-07-11T19:12:00.002+05:30

If you have to issue a component for production order of main item always from a specific storage location (component is stored in multiple storage locations but for production of a top item reservations should be created only on a specific storage loc), where can you provide the link between BOM component and storage Loc??

Is it possible to provide that link in BOM? or while allocating BOM components to routing operations or else where?

You can use the issue storage location field on the MRP 2 screen in the material master

or

You have 3 ways of doing it - not including the material master since the components are stored in multiple locations.

1. BOM item - very flexible but very time consuming to maintain if you have lots of BOM's. In CS02 you can set st. loc. on each component, and SAP will take this st. loc. first.

2. from level above - you can set it up so that whatever st. loc. is the default prod. st. loc on the material master for the level above will be the issue st. loc for the components you choose, if the component exists in that st. loc. - kind of a champagne waterfall effect. If the st. loc. is not maintained on the component, it will take the material master default of the component.

3. using supply area and work center. create supply areas and link them to st. loc's. - then link the supply area to the work center on CR02. Then allocate components to operations going through those work centers.

Note:
Supply Areas are meant to be used in conjunction with Kanban. However you can just use them to link the work center to a storage location. You will never see an inventory balance in MMBE in a supply area. With Kanban you can set up automatic triggers to replenish stock to the supply areas from a main stock location.

SAP QM in Procurement - An Introduction

2010-07-11T19:09:00.000+05:30

The QM component is integrated in crucial phases of the procurement process. It supports the

procurement activities by means of functions such as:

    * Vendor Evaluation
    * Vendor block
    * Vendor Release for requests for quotation and purchase orders
    * Assigning technical delivery terms and quality assurance agreements
    * Certificate processing
    * Status administration of the supply relationships
    * Incoming inspections
    * Goods receipt inspections

If your company purchases materials from external vendors, you can implement the QM in Procurement (QM-PT-RP-PRC) component to support your procurement processes for quality assurance purposes.

If you want to implement the QM in Procurement component, your company must also use the Purchasing (MM-PUR) component. If you require functions for processing goods movements, you must also install the Inventory Management (MM-IM) component.

You can implement the QM in Procurement component as a stand-alone component or together with the Quality Inspection (QM-IM) component. As a stand-alone component, you can use all procurement functions except those for processing goods receipt inspections. To process such inspections, you need the Quality Inspection component. Using the functions of the QM in Procurement component, you can:

Manage quality-related information for materials, vendors, and manufacturers in quality info records
Release or block vendors and manufacturers
Monitor the QM systems of vendors and manufacturers
Supply quality documents with requests for quotations and purchase orders
Evaluate vendors on the basis of quality
Certify vendors or manufacturers that have QM systems implemented, to reduce the inspection requirement
Manage and release supply relationships
Request that quality certificates be submitted with the delivered goods and monitor the receipt of these certificates
Inspect vendor goods at vendor sites (source inspections)
Inspect vendor goods upon receipt (goods receipt inspections)
Manage the posted goods in inspection stock
Block the payment of invoices until the goods have been inspected and accepted
Process goods receipt inspections for manufacturer-specific materials
Inspect goods that have been externally processed when they are returned in a goods receipt

SAP ABAP File Processing | Downloading Directly to Microsoft Excel Workbook | Sheet

2010-03-21T20:29:00.002+05:30

TABLES: USR03,DD02L.
DATA: ZX030L LIKE X030L.
DATA BEGIN OF ZDFIES OCCURS 0.
INCLUDE STRUCTURE DFIES.
DATA END OF ZDFIES.
DATA: BEGIN OF FLDITAB OCCURS 0,
FLDNAME(11) TYPE C,
END OF FLDITAB.

DATA ITABUSR03 LIKE USR03 OCCURS 0 WITH HEADER LINE.
DATA TNAME LIKE DD02L-TABNAME.
SELECT * FROM USR03 INTO TABLE ITABUSR03.
TNAME = 'USR03'.
PERFORM GETFIELEDS.
PERFORM SHOW123.

FORM GETFIELEDS.

CALL FUNCTION 'GET_FIELDTAB'
EXPORTING
LANGU = SY-LANGU
ONLY = SPACE
TABNAME = TNAME
WITHTEXT = 'X' IMPORTING
HEADER = ZX030L
TABLES
FIELDTAB = ZDFIES
EXCEPTIONS
INTERNAL_ERROR = 01
NO_TEXTS_FOUND = 02
TABLE_HAS_NO_FIELDS = 03
TABLE_NOT_ACTIV = 04.
CASE SY-SUBRC.
WHEN 0.
LOOP AT ZDFIES.
FLDITAB-FLDNAME = ZDFIES-FIELDNAME.
APPEND FLDITAB.
ENDLOOP.
WHEN OTHERS.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
with SY-SUBRC.
ENDCASE.

ENDFORM.

FORM SHOW123.

CALL FUNCTION 'EXCEL_OLE_STANDARD_DAT'
EXPORTING
FILE_NAME = 'C:\USR03.XLS'
DATA_SHEET_NAME = 'USER LIST'
TABLES
DATA_TAB = ITABUSR03
FIELDNAMES = FLDITAB
EXCEPTIONS
FILE_NOT_EXIST = 1
FILENAME_EXPECTED = 2
COMMUNICATION_ERROR = 3
OLE_OBJECT_METHOD_ERROR = 4
OLE_OBJECT_PROPERTY_ERROR = 5
INVALID_FILENAME = 6
INVALID_PIVOT_FIELDS = 7
DOWNLOAD_PROBLEM = 8
OTHERS = 9.
IF SY-SUBRC <> 0.
MESSAGE ID SY-MSGID TYPE SY-MSGTY NUMBER SY-MSGNO
WITH SY-MSGV1 SY-MSGV2 SY-MSGV3 SY-MSGV4.
ENDIF.

ENDFORM.

What is the difference between SY-UCOMM and OK_CODE in Dialog Program? | SAP ABAP Programming

2010-03-21T20:26:00.000+05:30

sy-ucomm is for doing the functions what the user wishes to do at that particular event. You use it in menus and other place . this mainly in using

ok_code is generally used in screen as of I have used. You will define the function in the screen. and you can use it in the main program.

ok_code acts just as a temporary variable that stores the value of sy-ucomm.

When user interacts with the screen elements, the function code that you have assigned is filled in the sy-ucomm field which is turn gets reflected in OK_CODE.

In your ABAP programs, you should work with the OK_CODE field instead of SY-UCOMM. There are two reasons for this: Firstly, the ABAP program has full control over fields declared within it, and secondly, you should never change the value of an ABAP system field. However, you should also always initialize the OK_CODE field in an ABAP program for the following reason:

In the same way that the OK_CODE field in the ABAP program and the system field SY-UCOMM receive the contents of the corresponding screen fields in the PAI event, their contents are also assigned to the OK_CODE screen field and system field SYST-UCOMM in the PBO event. Therefore, you must clear the OK_CODE field in the ABAP program to ensure that the function code of a screen is not already filled in the PBO event with an unwanted value. This is particularly important when the next PAI event can be triggered with an empty function code (for example, using ENTER). Empty function codes do not affect SY-UCOMM or the OK_CODE field, and consequently, the old field contents are transported.

Capacity Planning in PS module | Calendar like in MS Projects

2010-02-28T21:03:00.000+05:30

With Pool Capacity we can generally define capacity for a group of expertise in a given Work Center. Meaning that if I have 10 peoples working at 40 hours a week each, my total capacity on a weekly basis is 400 hours.

If the demands from activities in my various projects using that Work Center exceeds the 400 hours then I'll be under capacity and Gantt's in Planning Board will show in red !!!!!

However if I decide to go for Individual Capacity planning using HR module; then from what I read the individuals already defined in HR as employee number; will be tied to the Work Center and automatically taken and represented in Gantt's chart individually.

The link is to tie them as employee number to the Work Center in HR.

My question is; likewise in MS Projects; where we can define availability via the calendar; we can grey out days when an individual is on vacation or not available.

And that will reflect in the overall availability...

In PS is there a way to get an ''equivalent'' calendar !!!!

I did not see anything in PS itself to lock individual's dates !!!!!

Would this be in HR ???

Mainly when I want to reserve vacation time ahead for indivial labour resources..!!!!

I am not an expert in this area but I know a bit about it (I made it in a customer, but at the end I had to undo it). Actually I cannot work with networks so all I have it is my memory.

The pool capacity works as you say, but it seems that you are using the capacity availabality feature. I understood that if you use that, the system only checks if there is capacity avalibale, but not makes a capacity "commitment", it means, other networks can plan that capacity as own (this is made in the "levelling" section). At last, I only used the first feature so only had a look on the second.

I do not know how to plan people from HR module but:
- In CMP9 you can assign people to networks in basis to its Work Center in individual days (but it is very boring for the user).
- In the activity tag "Personal Assignment" you can assign people to an activity. This uses the HR information (working start time, absences, substitutions...). But this is not a capacity check or plan (at the end, I used that information to make a customer-specific report).
- The function "HR_PERSON_READ_WORK_SCHEDULE" can be used to know the exact avilabilty of a person (it will show you working hours, if that day is holiday, if there is a planned absence or substitution... everything). But you need to report previously that data to the system. (if you use it, take a look to the HR_PERSON_INIT_WORK_SCHEDULE too).
- The working factory calendar of the activity it is used to plan the capacity ==> maybe you would need to make a calendar for each employee (too much work I think).

Note that in MS project when you "gray" days is for all the activities, to make that in PS you should make a factory calendar with those days as no working days. I have talking to "gray" those days for each activity.

Sorry if this is not very clear (it has taken me an hour with several interrupts).

I very much agree with Guillermo, and I would suggest to go for his ideea. In my opinion using personal capacity planing in PS-HR is very inflexible and deficitary.

However, the link PS-HR you are asking for,

1. In work center (Transsaction: change work center) you will have to assign the persons from HR, you will have to be carefull as in the transaction there are 2 methods/buttons to assign persons to a work center. now I cannot tell you by heart which one is effectively linking the HR with PS, as only one works, you will have to try both of them (swich to capacity view and you'll see one button sth. "Link to HR" and then the other option is in the menu bar)

2. In HR - you will have to work with your HR colleagues maybe, should be maintained some HR Infotypes: Transaction PA61,
Infotype 0007 - planned working time (e.g. 8 hr. a day)
Infotype 0005 - vacation
Infotype 2001, type pf Infotype 0100 - absences

For the infotype 0007 - you will have alreadythe Arbeitszeitplanregel "rule to plan the working time", if I translate correct from german, which will set the calender for you. This is made with another HR transaction for the HR calender ....this calender(e.g. factory calender) has to be then generated/activated for every month (separate transaction). I do not remember all the transactions codes now, but is pretty much intuitiv, as the system will give you the steps while maintaining the Infotypes.

3. Then you plan the persons in the Activities for a determined period of time. In CMP9 you'll see the availability with the standard working hours (8Hr/day, as set in HR in calender) and the absences (as planed in HR in infotypes) with empty cells (Nota Bene: these cells have in transactions CMP2 and CMP3 a change modus, are not grey or inactive !!!!!) You can change the planing then with the transactions CMP2 or CMP3, one is from project, the other from workcenter point of view . If you make changes in CMP2 or 3 you will not see the changes in Project builder for example. With CMP9 you can only view the personals planing for a workcenter, a project...

I remember there is another transaction to see the personal availability somewhere in the Infosystem> PS>capacity. You'll have to look for it and generate it from Mandant 000.

Sequence Of Operations To Get EVA | SAP Project System

2010-02-28T21:01:00.000+05:30

In my project system I want project progress analysis on the basis of only time proportionality. Cost will not be consider for progress andtheir are different units used like m, m3, km & hr for work in internal & external activities, so is it possible to do such setting on the basis of confirmation in customisation?

Yes it is possible do through activity confirmation. It all depends on EV basis, their you need to set time proportionality.

You need to perform sequence of operations to get EVA. for time prop. you need to maintain scheduling, activity confirmation etc.

Define default meas method as Time prop for objects in customising.

You need to do customization settings for EVA for progress version, statistical key figures, value catagories, progress cost element etc.

You can go the following customizing steps... this will help you to configure as per your needs. This is not as per your need, as only you can understand what all the customizations you need to do........

1. Create Progress Version 101 with exclusive use 'Progress Analysis'. I have selected Plan & Actual check boxes.
2. Settings for Progress Version-
a) Plan version - '0'
b) EV basis - Cost plan (active project, annual values)
c) POC weighting - Cost plan (active project, annual values)
d) Planning type - Basic dates
e) Early / Late - earliest possible
f) Both reference boxes selected

3. SKFs- I created three SKFs 10 (Non-Aggregated POC), 20 (Aggregated POC) and 30 (POC for RA) with unit of measure '%' and selected the Key value category 'Total values'.

4. I need to assign these SKFs to different value categories. I created three value category 10, 20 & 30 with selection 'SKF with total values' and unit of measure '%'. Then I assigned SKF 10 to VC 10, SKF 20 to VC 20, SKF 30 to VC 30

5. I assigned measurement method as default value:
a) WBS (Plan) - Cost Proportional
b) WBS (Actual) - Cost Proportional
c) Internal Activity (Plan) - Cost Proportional
d) Internal Activity (Actual) - Degree of Processing
c) Exernal activity(Plan) - Cost Proportional
d) Exernal Activity (Actual) - Degree of Processing

6. I made progress cost element '6511100' (Secondary cost element) with Cost element category as 61.

7. I maintain a value catagory 6511100 with Cost radio button selected.
And assigned the progress cost element to the value catagory. i.e Cost element 6511100 to value catagory 6511100.

8. I maintain the assignment of cost element group. ie. I assigned progress cost elemnt to cost element group with default radio button selected. In the cost element group, I have selected certain cost elements which we regularly used (cost elements for project materials, project manhours, project contracts, spares etc)

Run CJEN first then CNE1 and CNE5.

SAP Logistics : PS Substitutions

2010-02-28T20:59:00.000+05:30

Project Substitutions

We have configured Partner funcitons to used at PD and WBS element level. We want to enter the 'customer number' as partner at the PD level and then want to copy it automatically in all the WBS elements under the project.

Is it possible to do such a thing? We are unable to use substitutions coz Partner fields do not occur in the substitution fields.

This is reasonably easy to achieve with substitution exit, where you can retrieve data from any logically linked objects and use these as substitution source data. This is described in note 440186, chapter 4.

However, with this technique you can only maintain the fields of PRPS, e.g. user fields USR*.

If your intention is to substitute corresponding Partner role in each level of WBS, I think that will not be possible with this technique directly.

You should additionally check if there is a user exit at partner maintenance to complete the scenario.

Normally you can use user exit RGGBS00 to insert a user specific into subsititution.

But in your case, it's a little complex, because the partner is in another table (not in PRPS). however you can try to insert your own field into table GB01 and regenerate with program RGUGBR00 (note 42615).

Object Orientation | Its Uses

2010-02-09T21:39:00.000+05:30

What is Object Orientation?

In the past, information systems used to be defined primarily by their functionality: data and functions were kept separate and linked together by means of input and output relations.

The object-oriented approach, however, focuses on objects that represent abstract or concrete things of the real world. These objects are first defined by their character and their properties which are represented by their internal structure and their attributes (data). The behaviour of these objects is described by methods (functionality).

Objects form a capsule which combines the character to the respective behaviour. Objects should enable programmers to map a real problem and its proposed software solution on a one-to-one basis. Typical objects in a business environment are, for example, ‘Customer’, ‘Order’, or ‘Invoice’. From Release 3.1 onwards, the Business Object Repository (BOR) of SAP Web Applicaton Server ABAP has contained examples of such objects. The BOR object model will be integrated into ABAP Objects in the next Release by migrating the BOR object types to the ABAP class library. A comprehensive introduction to object orientation as a whole would go far beyond the limits of this introduction to ABAP Objects. This documentation introduces a selection of terms that are used universally in object orientation and also occur in ABAP Objects. In subsequent sections, it goes on to discuss in more detail how these terms are used in ABAP Objects. The end of this section contains a list of further reading, with a selection of titles about object orientation.

Objects

Objects are instances of classes. They contain data and provides services. The data forms the attributes of the object. The services are known as methods (also known as operations or functions). Typically, methods operate on private data (the attributes, or state of the object), which is only visible to the methods of the object. Thus the attributes of an object cannot be changed directly by the user, but only by the methods of the object. This guarantees the internal consistency of the object.
Classes

Classes describe objects. From a technical point of view, objects are runtime instances of a class. In theory, you can create any number of objects based on a single class. Each instance (object) of a class has a unique identity and its own set of values for its attributes.

Object References

In a program, you identify and address objects using unique object references. Object references allow you to access the attributes and methods of an object. In object-oriented programming, objects usually have the following properties:
Encapsulation

Objects restrict the visibility of their resources (attributes and methods) to other users. Every object has an interface, which determines how other objects can interact with it. The implementation of the object is encapsulated, that is, invisible outside the object itself. Inheritance You can use an existing class to derive a new class. Derived classes inherit the data and methods of the superclass. However, they can overwrite existing methods, and also add new ones.
Polymorphism

Identical (identically-named) methods behave differently in different classes. In ABAP Objects, polymorphism is implemented by redefining methods during inheritance and by using constructs called interfaces.
Uses of Object Orientation

Below are some of the advantages of object-oriented programming: · Complex software systems become easier to understand, since object-oriented structuring provides a closer representation of reality than other programming techniques. · In a well-designed object-oriented system, it should be possible to implement changes at class level, without having to make alterations at other points in the system. This reduces the overall amount of maintenance required. · Through polymorphism and inheritance, object-oriented programming allows you to reuse individual components. · In an object-oriented system, the amount of work involved in revising and maintaining the system is reduced, since many problems can be detected and corrected in the design phase.
Achieving these goals requires:

· Object-oriented programming languages

Object-oriented programming techniques do not necessarily depend on object-oriented programming languages. However, the efficiency of object-oriented programming depends directly on how object-oriented language techniques are implemented in the system kernel.

· Object-oriented tools

Object-oriented tools allow you to create object-oriented programs in object-oriented languages. They allow you to model and store development objects and the relationships between them.

· Object-oriented modeling

The object-orientation modeling of a software system is the most important, most time-consuming, and most difficult requirement for attaining the above goals. Object-oriented design involves more than just object-oriented programming, and provides logical advantages that are independent of the actual implementation.

SAP Object and Properties | Polymorphism | Inheritance | Encapsulation

2010-02-09T21:36:00.000+05:30

Object Introduction

ABAP Objects has appeared with the version 4.0. of R/3 and has never stopped maturing since that time. It has now reached a level that makes it a real object oriented programming language that is worth learning. So if you are ready to see what this great technology is about, take a big breath and go on reading.
What is ABAP Objects

ABAP Objects stands for Object oriented ABAP. Compared to the traditional ABAP programming language, ABAP Objects represents an extension of ABAP that provides the language with the tools to support the object oriented programming paradigm.

What is object oriented programming?

To anyone who doesn’t know what object oriented programming is, the object orientation terminology might sound like it is yet another fancy concept that doesn’t serve any real purpose nor provide any real added value just like too many other concepts in computer sciences. More recent than the traditional procedural programming model in which the source code is arranged in procedures to help achieve some level of modularity, the object oriented programming builds on the basics of the existing procedural programming model to propose a radically more sophisticated and comprehensive programming model.

This model lets the analyst-programmer implement complex systems made up of numerous objects linked together or not and control the interactions between these objects. This characteristic of the object programming language constitutes a definitive advantage other traditional programming techniques as it becomes much easier to solve complex problems. As you have already understood, the notion of Object is at the center of the model. It is voluntarily a very general notion as its aim is to describe anything that has properties and functions. In this sense, the terminology object is not yet abstract enough because it bears some idea of concreteness while an object in the sense of object oriented programming might very well represent abstract things. In fact the notion of Object could have been advantageously replaced with the notion of Concept as the programming model we are going to see is able to manipulate any kinds of concepts and to make actual representations of them.
The object oriented programming model has three major characteristics. It assumes support for:
1. Encapsulation
2. Inheritence
3. Polymorphism

We are going to see in more details what these terms mean but keep in mind that these characteristics of object programming represent only the minimum key features that any object oriented programming language must implement. The object oriented programming is not limited to these characteristics. Also we are going to see here what these terms mean in a rather abstract way. We will become more concrete in the next sections of this article when you will have a better understanding of the key concepts of object programming.
1. Encapsulation

Encapsulation is the ability that an object has to contain and restrict the access to its members. We will see later that objects members may be either properties (data) or methods (functions) of the objects. Encapsulation is a key concept of object programming that ensures the autonomy and integrity of the objects.
2. Inheritance

Inheritance is the ability of an object to inherit the properties and methods of an other object. We will come back to this later as you need to have a good understanding of what an object really is if you want to apprehend this concept. Keep in mind for the moment that inheritence is the ability offered to objects to inherit properties from other objects and to form hierarchies. This characteristic leads to the creation of families of objects (just like families exist for humans) with parent objects and child objects. In this configuration, it is clear that child objects inherit some characteristics from their parent object.
3. Polymorphism

This somewhat barbaric term designates the ability of objects to redefine properties inherited from their parents. In other words, a method of an object may have different implementations (behaviours or forms) depending on the object that implements it. This characteristic of the object oriented languages is an important asset to implement abstract concepts which often make sense only in specific contexts.

SAP HR | ALE | EDI | PP | MM | ABAP | ERP Interview Questions and Answers

2010-01-27T07:59:00.000+05:30

In the below links there are few questions and answers faced by my colleagues and friends in SAP Interview.

SAP HR Interview Questions
SAP MM Interview Questions
SAP ABAP Interview Questions
SAP Interview Questions
SAP ERP Interview Questions

Keep Watching this space for more resources.Leave me a comment on this page on any specific resource if you need..

Cost Component Split In FICO

2010-01-27T07:33:00.000+05:30

Can someone brief what is cost component split? What config is to be done?

In addition to standard iteration, price calculation enables you to calculate prices as a cost component split. This means that the output price of an activity type can be split into a maximum of 40 cost components. These cost components represent either:

Individual cost components (such as wages, salaries, or operating supplies) or the costs of complete cost centers (such as energy or maintenance cost centers).

The cost component split enables you to analyze which cost components are contained in the output prices of the activity types.

You can then control cost elements, cost element groups, and also entire cost centers in cost component splits. The corresponding cost center costs and the costs of the cost centers providing the activity are channeled into this cost component split. For example, if you have assigned the salary cost element to component 1 (salaries), then the system displays the salaries (for example, for a production cost center) in this cost component. If a plant maintenance cost center provides services to the production center, then the salaries for the plant maintenance cost center are assigned to this cost component.

Cost center splitting apportions activity independent costs to the activity types of the cost center. It does this by multiplying the total of the activity independent costs by the equivalence number of the activity type, and then dividing by the sum of the equivalence numbers. So if there are two activities, one with equivalence number 1 and the second activity has an eqivalence number of 2, then 1/3 of the activity independent costs will be apportioned to activity one, and 2/3 will be apportioned to activity two.

Activity independent costs are always fixed, so any variable costs will need to be planned as activity dependent costs.

Planned cost center splitting happens automatically when calculating the activity price. You can view what costs will be apportioned during activity price calculation by clicking on the Splitting menu item.

I've ran cost splitting against one cost centre. For this cost centre I know the planned activity rate (per hour) and the planned quantity (in hours) but the target cost calculated for the activity is slightly different to the result of these two multiplied together.

Is this calculation correct please?

Planned act. qty in period @ planned act. rate for period = target costs

If you have only one Activity for the cost center, then you do not need to run splitting. Just run activity price calculation. Splitting is required only if you are allocating the same costs to 2 or more activities.

The calculation is generally right. The other thing to check will be rounding of the time (mins/hours) and value.

SAP Controlling FAQ

2010-01-27T07:32:00.000+05:30

CONTROLLING

Controlling: Controlling provides you with information for management decision-making. If facilitates co-ordination, monitoring and optimization of all process in an organization.

Features of Controlling: Cost Center Accounting, Activity Based Accounting, Internal Orders, Product Costing, & Profitability Analysis.

Controlling Area: Organization unit that represents a closed system Used for accounting purposes.

You can assign one or more company codes to one controlling area.

If you assign more than one company code to one controlling area, then you need to note the following.

1) Consistent Chart of a/c’s (Treat each cost element in all company codes in same way).
2) The Operative fiscal year variants in the company codes must match the fiscal year variant in controlling area.
3) You should execute period end closing in controlling for all company codes at same time.
4) The system only post reconciliation posting across company codes without taxes, which means that it cannot automatically create invoice.
5) Maintain controlling area - OKKP .
6) Maintain no. ranges for controlling documents - KANK
7) Maintain versions - OKEQ

COST ELEMENT ACCOUNTING

Cost Elements: Cost Elements Describe the origin of costs. Cost element classifies the organization valuated consumption of production factors within a controlling area.

Primary Cost Elements: These arise through the consumption of productions factors that are sourced externally. Primary cost elements are used for direct posting and must be accompanied in GL a/c’s in FI.

T-code : KA02 : The categories are follows 1) General primary cost element, 03 - Imputed cost element percentage method 4 - Imputed cost element, target = Actual Method, 11- Revenue elements, & 12 - sales deductions.

Secondary Cost Elements: Cost elements arise through the consumption of production factor’s that are provided internally i.e., by enterprise itself. Secondary cost elements are used strictly for internal controlling posting like assessments and settlements. T-code - ka06

Category: 12 - internal settlements, 31 - Result analyses, 41 - overhead’s, 42 - assessments etc. Cost Element Group - kah1

COST CENTER’S

Cost Center’s: Organizational Unit within a controlling area that represents a defined location of cost incurrence. The definition can be based on 1) Functional Requirement, 2) Allocation criteria, 3) Physical location and 4) Responsibilities for cost.

Change Cost center hierarchy - OKEON
Creation of Cost Center - KS01

Distribution: Was created to transfer primary costs from a sender cost center to receiving controlling objects. Distribution is primary cost elements.
Define Distribution - KSV1
Execute “” - KSV5

Assessment: Was created to transfer primary and secondary costs from a sender cost center to receiving controlling objects.
During assessment, the original cost elements are summarized into assessment cost elements (secondary cost element, category=42).

Define Assessment - KSU1
Execute Assessment - KSU5

Activity Types: Categorizes productions and services activities provided by a cost center to the organization and used for allocating costs for internal activities to the originates of the costs.

Creation of Allocation Cost elements - KA06
Creating/Maintaining the Activity types - KL01

Statistical key figures: Are used as the basis (tracing factor) on which to make allocations (assessments & distributions) and to analyze structural key figures.

Difference Between Primary and Secondary Cost Element | Travel Expense | Booking | Examples | Operational Costs

2010-01-27T07:31:00.000+05:30

Explain the difference between primary and secondary cost element? With an example.

Primary cost elements are like materail costs, personnel costs, energy costs... where a corresponding GL account exists in FI..to allow costs to flow...

Secondary cost elements are like production costs, material overheads, production overheads, they can be created and administered in only CO. These are used in internal cost allocation, overhead calculation, settlement transactions., it does not flow to FI...

General - Cost Element
----------------------------------
Basically, cost element are carriers of costs.

Primary Cost Element
--------------------------------
When cost element carriers cost between FI and CO they are called Primary, the link is established GL A/c = Cost element(Primary). A question may arise as to whether all GL accounts are cost element, it again depends upon the business requirement, where COPA is active then revenue account (GL) are also cost elements, where COPA is not active then revenue account (GL) should not be made as an cost element.

Example....
Again cost of goods sold particularly in VAX (make to stock) is not an cost element, where the same COGS in VAY (make to order) is a cost element. Price Difference account should not be made as cost element.

Entry while booking expenses
Travel Expenses A/c - with Cost Centre Dr. Rs.YY
(will be a GL A/c and cost element) - entries flows to CO thru FI
To Cash A/c Cr. Rs.YY

Secondary Cost Element
-------------------------------------
When cost element carries cost with in CO, then they are called secondary cost element.

Example.... - Take Product Costing
---------------------------------------------------
On manufacture of the goods the cost of the above product (production order) is arrived at accumulating material cost + operational cost + overheads (%), additive cost if any.

The cost of operation is accumulated in cost centre be it production / production service / service cost centres, while booking FI entries.

Those operational cost has to be allocated to production order based on operational activities carried on and its cost involved in it. Those operation activities in CO are termed as activity types and has to link the same in KP26 with rates and cost centre (ie., sender cost centre and receiver production order).

In order to find the production order cost, the allocation of cost from sender cost centre to production order for the operational activities carried on and its cost associated with it, have to be loaded, hence in CO the cost centre allocate that portion of operational cost to production order, and this cost is carried by a cost element (since there are no FI involvement and entries are flowing within CO by crediting sender cost centre and debiting receiver production order a cost element has to be created.... say "Operational Cost - Activity" the entry will be

Operational Cost - Activity (Production Order) Dr Rs.XX
To Operational Cost - Activity (Cost Centre) Cr Rs.XX
The entries are with in CO. And the cost element created is secondary since it does not has an link with GL Account in FI correspondingly.

In CO the production order and cost centre are co object including but not limited to.

Requires an Assignment to a CO Object | Diagnosis |

2010-01-27T07:29:00.000+05:30

The first time Account 820290 was only created in FI as a primary expense. After that this account was created in CO too as a secondary expense and any posting will appear an error: Account 820290 requires an assignment to a CO object

Question : How to correct this account back to FI only and not to appear in co?

Note :
Account 820290 requires an assignment to a CO object
Message no. KI 235

Diagnosis
You have not defined a CO account assignment for an account that is relevant to cost accounting.

System Response
Account 820290 is defined as a cost element.
This means that you must always specify a CO account assignment.

Procedure
Enter one of the following CO account assignments

Order
Cost center / cost center/ activity type
Sales order item (for a project or cost relevant)
Project / WBS element
Cost object (Process manufacturing)
Network/ Network activities
Business process
Profitability segment
Real estate object
The posting row affected is 000, account 820290.

First, if G/L account was created in FI, you can only create primary cost element in CO.

Secondary cost element can only be created if no account exists in FI.

Second, if you created the primary or secondary cost element in CO, you have to assign CO account assignment.

You can delete cost element in CO (KO04) if dependent objects found.

Third, when you create cost element in CO, documents would be also created in ‘Cost center accounting’ and ‘Profit center accounting’ when posing in FI. If no cost element exists in CO, no related documents would be created in CCA and PCA.