Saturday, 4 January 2014

How to perform in an interview for job

Interview - How to attend an interview - interview tips - interview tricks - How to perform an interview
interview tips
interview tips
Here we have collected some tips to do while attending an interview in any company.Many peoples will go for an interview with new dresses and full make up.If you go like this 95% you will not get a job.So,go naturally with neat you will get a job.

1. SMILE :-
This is the essential prerequisite to any communication in the professional world as in everyday life.

2. BE SHORT :-
All recruiters will ask you to summarize your profile and experiences. Present your point briefly and in relation to the proposed position.

3. START FROM THE BEGINNING :-
Speak about your initial education, it is a small but important point. Then talk about your experience from past to present.

4. EXPLAIN YOUR CHOICES :-
Why you chose your university education, your first job. For each change, explain "why you left" and "why you chose your new employer".

5. SPEAK OPENLY :-
About what you have gained from each experience, project, … both personally and professionally.

6. BE SPECIFIC :-
About what motivates you. The situations, products, environments, personalities, etc. And explain why.

7. UNDERSTAND :-
About the position that is to be filled. Ask the key questions in the first interview. Ask the more detailed questions in the following interviews.

8. BE NATURAL AND SINCERE :-
And Smile again at the end of the interview..!!

SE7103 FORMAL MODELS OF SOFTWARE SYSTEMS - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
SE7103 FORMAL MODELS OF SOFTWARE SYSTEMS
OBJECTIVES:
 To understand the basic elements of Z
 To understand relations, functions, and logical structures in Z
 To understand Z schemas and schema calculus
 To learn selected Z case studies
 To understand Z schema refinement

UNIT I FOUNDATIONS OF Z
Understanding formal methods – motivation for formal methods – informal requirements to formal specifications – validating formal specifications – Overview of Z specification – basic elements of Z – sets and types – declarations – variables – expressions – operators – predicates and equations

UNIT II STRUCTURES IN Z
Tuples and records – relations, tables, databases – pairs and binary relations – functions – sequences – propositional logic in Z – predicate logic in Z – Z and boolean types – set comprehension – lambda calculus in Z – simple formal specifications – modeling systems and change

UNIT III Z SCHEMAS AND SCHEMA CALCULUS
Z schemas – schema calculus – schema conjunction and disjunction – other schema calculus
operators – schema types and bindings – generic definitions – free types – formal reasoning –
checking specifications – precondition calculation – machine-checked proofs

UNIT IV Z CASE STUDIES
Case Study: Text processing system – Case Study: Eight Queens – Case Study: Graphical User Interface – Case Study: Safety critical protection system – Case Study: Concurrency and real time systems

UNIT V Z REFINEMENT

Refinement of Z specification – generalizing refinements – refinement strategies – program
derivation and verification – refinement calculus – data structures – state schemas – functions and relations – operation schemas – schema expressions – refinement case study

TOTAL : 45 PERIODS

OUTCOMES:

Upon Completion of the course,the students will be able to
 Apply the basic elements of Z
 Develop relational, functional, and logical Z structures
 Develop Z schema as models of software systems
 Perform verifications and conduct proofs using Z models
 Refine Z models towards implementing software systems

REFERENCES:
1. Jonathan Jacky, “The way of Z: Practical programming with formal methods”, Cambridge
University Press, 1996.
2. Antoni Diller, “Z: An introduction to formal methods”, Second Edition, Wiley, 1994.
3. Jim Woodcock and Jim Davies, “Using Z – Specification, Refinement, and Proof”, Prentice
Hall, 1996.
4. J. M. Spivey, “The Z notation: A reference manual”, Second Edition, Prentice Hall, 1992.
5. M. Ben-Ari, “Mathematical logic for computer science”, Second Edition, Springer, 2003.
6. M. Huth and M. Ryan, “Logic in Computer Science – Modeling and Reasoning about
systems”, Second Edition, Cambridge University Press, 2004.

Thursday, 2 January 2014

ANNA UNIVERSITY NEW REVALUATION PROCEDURE - RELEASED ON 02-01-2014

NEW REVALUATION PROCEDURE - LATEST REVALUATION PROCEDURE RELEASED ON 02-01-2014 - NEWS ABOUT FEES INCREMENT OF ANNA UNIVERSITY REVALUATION
REVISED REVALUATION PROCEDURE TO BE FOLLOWED FROM NOV/DEC 2013 UNIVERSITY EXAMINATIONS ONWARDS 
ANNA UNIVERSITY NEW REVALUATION PROCEDURE
ANNA UNIVERSITY NEW REVALUATION PROCEDURE
INITIAL STEPS TO BE FOLLOWED
  • After results came, If you need to apply for revaluation ,At first you need to pay Rs.300 per paper on or before the last date for applying photocopy. 
  • After receiving the photocopy,the student can check their paper along with the help of local college staff.
  • If their is any mistake in the valuation, then the student need to apply for revaluation on or before the last date for applying revaluation.
  • The fee for applying revaluation is Rs.400 per paper.
  • Even after the revaluation result, if the student is still not satisfied with that, then he/she can opt for review of his/her answer script by paying the prescribed fee. The review procedure will be intimated along with the revaluation result. 
  • So Total revaluation fees is Rs 300 + Rs 400 = Rs 700
REVALUATION METHOD AFTER RECEIVING PHOTOCOPY

  • To get details of revaluation method after receiving photocopy of answer scripts --> Click here
Official Announcement copy
ANNA UNIVERSITY NEW REVALUATION PROCEDURE - RELEASED ON 02-01-2014
ANNA UNIVERSITY NEW REVALUATION PROCEDURE - RELEASED ON 02-01-2014
REVALUATION METHOD AFTER RECEIVING PHOTOCOPY

  • To get details of revaluation method after receiving photocopy of answer scripts --> Click here

Wednesday, 1 January 2014

CP7002 PROBABILISTIC REASONING SYSTEMS - ANNA UNIVERSITY 1ST SEM CSE SYLLABUS REG-2013

ANNA UNIVERSITY, CHENNAI
REGULATIONS - 2013
M.E. COMPUTER SCIENCE AND ENGINEERING
CP7002 PROBABILISTIC REASONING SYSTEMS

OBJECTIVES: 
 To construct and reason with Bayesian networks
 To reason with temporal models
 To make exact and approximate inferences with graphical models
 To understand learning of parameters for probabilistic graphical models
 To understand actions and decisions with probabilistic graphical models

UNIT I REPRESENTATION
Probability Theory, Graphs, Bayesian network representation: Bayes networks, Independence in graphs – Undirected graphical models: Parameterization, Markov Network independencies – Conditional Bayesian networks.

UNIT II TEMPLATE BASED REPRESENTATION
Temporal models (Dynamic Bayesian networks , Hidden Markov Models) – Directed probabilistic models for object-relational domains – Inference in temporal models: Kalman filters.

UNIT III INFERENCE
Exact inference: Variable elimination – Exact inference: Clique trees (Junction trees) – Approximate inference: Forward sampling, Importance sampling, MCMC – MAP inference:
Variable elimination for MAP, Max-product in clique trees.

UNIT IV LEARNING
Learning graphical models – Parameter estimation: maximum-likelihood estimation, MLE for
Bayesian networks, Bayesian parameter estimation – Structure learning in Bayesian networks:
Constraint based, structure scores, structure search – Partially observed data: Parameter
estimation, Learning models with hidden variables – Learning undirected models: Maximum
likelihood

UNIT V ACTIONS AND DECISIONS
Causality – Utilities and decisions – Structured decision problems

TOTAL: 45 PERIODS

OUTCOMES:
Upon Completion of the course, the students will be able to
 Construct Bayesian networks
 Reason with Bayesian networks
 Reason with Dynamic networks and Hidden Markov Models
 Conduct inferences with Bayesian networks
 Implement algorithms to learn probabilistic graphical models
 Explain actions and decisions with probabilistic graphical models

REFERENCES:
1. Daphne Koller and Nir Friedman, “Probabilistic Graphical Models: Principles and Techniques”,MIT Press, 2009.
2. David Barber, “Bayesian Reasoning and Machine Learning”, Cambridge University Press,
2012.27
3. Adnan Darwiche, “Modeling and Reasoning with Bayesian networks”, Cambridge University
Press, 2009.
4. Kevin P. Murphy, “Machine Learning: A Probabilistic Perspective”, MIT Press, 2012.
5. Stuart Russel and Peter Norvig, “Artificial Intelligence: A Modern Approach”, Third Edition,
Prentice Hall, 2009.