Nov 2010
Nov 2010
Nov 2009
Follow me on Linkedin
Showing posts with label Question Paper. Show all posts
Showing posts with label Question Paper. Show all posts
DBMS | Previous Year Semester Question Paper
Nov 2010
Digital Electronics | Semester Question Paper - Nov 2012
SASTRA UNIVERSITY
Year : Nov 2012 Semester : Third Semester
Subject : Digital Electronics Time : 3 Hrs.
Year : Nov 2012 Semester : Third Semester
Subject : Digital Electronics Time : 3 Hrs.
Answer all the questions [20*2=40 Marks]
1. State DeMorgans theorems.
2. Using the distributive property,prove that A+BC=(A+B)(A+C)
3. What are dont care combinations?
4. Realize AND function using only the NOR gates.
5. Give the basic circuit of a DTL NAND gate.
6. Draw the logic diagram of an equality comparator.
7. What is a binary decoder?
8. Explain EEPROM.
9. What is Flash Memory?
10.Explain GAL.
11.State the necessary rules in drawing the ASM charts.
12.Draw the state diagram for sequence detector.
13.Give the state diagram for the Mealy sequential network.
14.Draw the Mealy model of a clocked synchronous sequential network.
15.What are ASM charts? Give their basic components.
16.Draw the symbols of state and decision boxes.
17.Give the diagram of a 4-bit synchronous binary counter.
18.Illustrate the SIPO unidirectional shift register.
19.Draw the logic diagram of SR latch.
20.Give the general structure of PLDs.
Part-B
Answer all the questions [4*15=60 Marks]
21.Reduce using mapping the expression m(0,1,2,3,5,7,8,9,10,12,13)and implement the same in universal logic.
(OR)
22.(a) Explain CMOS logic gates. [3]
(b) With necessary diagrams diagrams describe the working of CMOS inverter and CMOS NAND gates[12]
Answer all the questions [4*15=60 Marks]
21.Reduce using mapping the expression m(0,1,2,3,5,7,8,9,10,12,13)and implement the same in universal logic.
(OR)
22.(a) Explain CMOS logic gates. [3]
(b) With necessary diagrams diagrams describe the working of CMOS inverter and CMOS NAND gates[12]
23. (a) What is a priority encoder? [2]
(b) Giving the truth table of a 4-bit priority encoder use K-map simplification and draw the logic diagram. [13]
(OR)
24. (a) Give the classification of memories. [3]
(b) Explain the architecture of FPGA. [6]
(c) Draw the circuit of a module with 3 interconnected 2 to 1 multiplexers and an OR gate.
25. (a) What are ASM charts? [3]
(b) Construct an ASM chart for a synchronous sequential network to recognize the input sequence of pairs x1x2=01,01,11,00. [12]
(OR)
26. Give the design of a 3-bitup/down synchronous counter and describe its function in detail.
(b) Construct an ASM chart for a synchronous sequential network to recognize the input sequence of pairs x1x2=01,01,11,00. [12]
(OR)
26. Give the design of a 3-bitup/down synchronous counter and describe its function in detail.
27. Realize Trigger Flip-flop using S-R Flip-flop.
(OR)
28. (a) What is a register? [2]
(b) Bring out the difference between a register and a counter. [3]
(c) Draw the logic diagram of the 74194 4-bit universal sift register and explain its function.[10]
(OR)
28. (a) What is a register? [2]
(b) Bring out the difference between a register and a counter. [3]
(c) Draw the logic diagram of the 74194 4-bit universal sift register and explain its function.[10]
Tags : Sastra University Digital Electronics question Papers , Sastra University Digital Electronics previous year question Papers , Sastra University Digital Electronics old question Papers , Sastra University Digital Electronics question Papers , Sastra University Digital Electronics previous year question Papers , Sastra University Digital Electronics old question Papers , Sastra Digital Electronics question Papers , Sastra Digital Electronics previous year question Papers , Sastra Digital Electronics old question Papers , Sastra Digital Electronics question Papers , Sastra Digital Electronics previous year question Papers , Sastra Digital Electronics old question Papers , Anna University Digital Electronics question Papers , Anna University Digital Electronics previous year question Papers , Anna University Digital Electronics old question Papers , Anna University Digital Electronics question Papers , Anna University Digital Electronics previous year question Papers , Anna University Digital Electronics old question Papers
.jpg)
.jpg)
Data Structure | Semester Question Paper - Nov 2012
SASTRA UNIVERSITY
Year : Nov 2012 Semester : Third Semester
Subject : Data Structure Time : 3 Hrs.
Year : Nov 2012 Semester : Third Semester
Subject : Data Structure Time : 3 Hrs.
PART-A
Answer all the questions.
1.What are the three programming constructs available?
2.What is a data structure?
3.Write the algorithm recursiveFactorial(n).
4.Write the Euclidean algorithm for GCD.
5.Write the algorithm InsertNode(list,pPre,dataIN).
6.Write the algorithm pushStacktop(stack,data).
7.Write the C code for stacktop.
8.Write the algorithm createQueue for creating a queue.
9.Write the algorithm dequeue(queue,item).
10.What is a sparse matrix?
11.What is the use of tree datastructure?
12.Write the algorithm postorder(root).
13.Draw the expression tree for a*(b+c)+d.
14.Write the algorithm FindLargestBST(root).
15.What is AVL tree?
16.State the properties of heap.
17.State the address of leftchild and rightchild in a heap.
18.What is an Eulerian walk?
19.What is an adjacency matrix?
20.What are the constraints for the solution of mincost spanning trees?
PART-B
Answers all the questions.
21.Describe the Abstract Data Type(ADT) model and ADT implementations.
(OR)
22.Write the C code for solving towers of Hanoi.
23.Write the algorithm (infix to postfix) inToPostFix(formula) and explain.
(OR)
24.Write the algorithms insertDbl(list,dataIn) and deleteDbl(list,deleteNode) of the doubly linked list.
25.Explain the insertion into and deletion of a General Tree.
(OR)
26.Write algorithms SearchBST,addBST(searching a Binary Search Tree and insert into a BST) and explain with example.
27.Write the C code for Priority queue implementation.
(OR)
28.Write the Kruskals algorithm and explain with example
Tags : Sastra University Data Structure question Papers , Sastra University Data Structure previous year question Papers , Sastra University Data Structure old question Papers , Sastra University Data Structure question Papers , Sastra University Data Structure previous year question Papers , Sastra University Data Structure old question Papers , Sastra Data Structure question Papers , Sastra Data Structure previous year question Papers , Sastra Data Structure old question Papers , Sastra Data Structure question Papers , Sastra Data Structure previous year question Papers , Sastra Data Structure old question Papers , Anna University Data Structure question Papers , Anna University Data Structure previous year question Papers , Anna University Data Structure old question Papers , Anna University Data Structure question Papers , Anna University Data Structure previous year question Papers , Anna University Data Structure old question Papers
.jpg)
Linux Programming | Semester Question Paper - Nov 2012
SASTRA UNIVERSITY
Year : Nov 2012 Semester : Third Semester
Subject : Linux Programming Time : 3 Hrs.
Part-A
Answer all the questions [20*2=40 Marks]
1. List the various types of variable used in Linux.
2. How to check, if number 1 is numerically greater than or equal to number 2 using [] operator?
3. What is the purpose of using \t,\s in regular expression syntax elements?
4. What is the use of C-x k key combinations in Emacs editor?
5. What is use of character class in regular expression? Give example.
6. What is file mode?
7. List the two ways of opening files that have associated with file names.
8. How to change a files access permission modifiers? Write its syntax.
9. What is pages and page aligned?
10.List two methods of locking files.
11.What is meant by signal mask?
12.Which method is suitable to find which signals are currently pending? Write its syntax.
13.Draw a clear sketch for establishing socket connections.
14.What is network byte order?
15.What is Domain Name system?
16.List the two databases that describe terminals in terms of capabilities.
17.What is the use of SLmg_init_smg()?
18.What is the use of file descriptor in database?
19.Why we syncing the database in Linux?
20.List the three types of databases provided by db.
Part-B
Answer all the questions [4*15=60 Marks]
21.Write a shell script to find all the prime numbers between 1 and 1000 using function.
(OR)
22.Discuss the following in detail:
(a)egrep with example [7]
(b)sed with example [8]
23.Discuss the following in detail
(a)File access permissions [5]
(b)Removing and renaming files [10]
(OR)
24.Write detailed notes on Non-blocking I/O with simple example.
25.Discuss the following:
(a)Finding the set of pending signals. [4]
(b)Waiting for signals [6]
(c)Sending signals. [5]
(OR)
26.Explain in detail about the basic socket operations.
27.Explain in detail the concepts of terminal input handling.
(OR)
28.Write detailed notes on basic operations of database.
Tags : Sastra University Linux question Papers , Sastra University Linux previous year question Papers , Sastra University Linux old question Papers , Sastra University Linux Programming question Papers , Sastra University Linux Programming previous year question Papers , Sastra University Linux Programming old question Papers , Sastra Linux question Papers , Sastra Linux previous year question Papers , Sastra Linux old question Papers , Sastra Linux Programming question Papers , Sastra Linux Programming previous year question Papers , Sastra Linux Programming old question Papers , Anna University Linux question Papers , Anna University Linux previous year question Papers , Anna University Linux old question Papers , Anna University Linux Programming question Papers , Anna University Linux Programming previous year question Papers , Anna University Linux Programming old question Papers
.jpg)
Year : Nov 2012 Semester : Third Semester
Subject : Linux Programming Time : 3 Hrs.
Part-A
Answer all the questions [20*2=40 Marks]
1. List the various types of variable used in Linux.
2. How to check, if number 1 is numerically greater than or equal to number 2 using [] operator?
3. What is the purpose of using \t,\s in regular expression syntax elements?
4. What is the use of C-x k key combinations in Emacs editor?
5. What is use of character class in regular expression? Give example.
6. What is file mode?
7. List the two ways of opening files that have associated with file names.
8. How to change a files access permission modifiers? Write its syntax.
9. What is pages and page aligned?
10.List two methods of locking files.
11.What is meant by signal mask?
12.Which method is suitable to find which signals are currently pending? Write its syntax.
13.Draw a clear sketch for establishing socket connections.
14.What is network byte order?
15.What is Domain Name system?
16.List the two databases that describe terminals in terms of capabilities.
17.What is the use of SLmg_init_smg()?
18.What is the use of file descriptor in database?
19.Why we syncing the database in Linux?
20.List the three types of databases provided by db.
Part-B
Answer all the questions [4*15=60 Marks]
21.Write a shell script to find all the prime numbers between 1 and 1000 using function.
(OR)
22.Discuss the following in detail:
(a)egrep with example [7]
(b)sed with example [8]
23.Discuss the following in detail
(a)File access permissions [5]
(b)Removing and renaming files [10]
(OR)
24.Write detailed notes on Non-blocking I/O with simple example.
25.Discuss the following:
(a)Finding the set of pending signals. [4]
(b)Waiting for signals [6]
(c)Sending signals. [5]
(OR)
26.Explain in detail about the basic socket operations.
27.Explain in detail the concepts of terminal input handling.
(OR)
28.Write detailed notes on basic operations of database.
Tags : Sastra University Linux question Papers , Sastra University Linux previous year question Papers , Sastra University Linux old question Papers , Sastra University Linux Programming question Papers , Sastra University Linux Programming previous year question Papers , Sastra University Linux Programming old question Papers , Sastra Linux question Papers , Sastra Linux previous year question Papers , Sastra Linux old question Papers , Sastra Linux Programming question Papers , Sastra Linux Programming previous year question Papers , Sastra Linux Programming old question Papers , Anna University Linux question Papers , Anna University Linux previous year question Papers , Anna University Linux old question Papers , Anna University Linux Programming question Papers , Anna University Linux Programming previous year question Papers , Anna University Linux Programming old question Papers
.jpg)
Theory of Computing | Semester Question Paper - Nov 2012
SASTRA UNIVERSITY
23.Explain the steps in SLR(1) parsing with an example.
(OR)
24.Explain the steps to convert to chomsky normal for for the following grammar
s->ASA|aB,A->B|S,B->b|epsilon.
Year : Nov 2012 Semester : Third Semester
Subject : Theory of Computing Time : 3 Hrs.
Part-A
Answer all the questions [20*2=40 Marks]
1. Define and give an example of a transition function.
2. Sketch an FSA M with two states and work out the language generated by M.
3. Write down the production rules to generate binary palindromes.
4. True or False: Every finite language is regular. Why?
5. If L is regular and M is a subset of L, is M regular? Give reasons.
6. Define the notion epsilon-production. How is it used?
7. Distinguish between determinism and non-determinism in the class of context-free languages.
8. Sketch an FSA generating the language L={0^2,0^5,0^7,0^11,.......}.
9. What is minimization of a FSA?
10.Explain left-most derivation.
11.Define and give an example for the concept of a syntax tree.
12.Give an example of a homomorphism and inverse homomorphism.
13.What is meant by "Inherent ambiguity"?
14.True or False: Every context free language is regular. Give reasons.
15. Explain LL(k).
16.Explain the idea of a push down automaton.
17.State the Halting problem.
18.Define the notion of a computable function.
19.Give two examples of complexity classes.
20.Briefly describe the chomsky hierarchy of languages.
Part-B
Answer all the questions [4*15=60 Marks]
21.Using NDFAs, show that the class of regular languages are closed under unions, concatenation, Kleen closures and reversals.
(OR)
22.Construct a deterministic FSA for the following NFSA with starting state 1, accepting state 3 and transition table as given below.
State/alphabet a b
1 2 -
2 - 3
3 1 -
Answer all the questions [20*2=40 Marks]
1. Define and give an example of a transition function.
2. Sketch an FSA M with two states and work out the language generated by M.
3. Write down the production rules to generate binary palindromes.
4. True or False: Every finite language is regular. Why?
5. If L is regular and M is a subset of L, is M regular? Give reasons.
6. Define the notion epsilon-production. How is it used?
7. Distinguish between determinism and non-determinism in the class of context-free languages.
8. Sketch an FSA generating the language L={0^2,0^5,0^7,0^11,.......}.
9. What is minimization of a FSA?
10.Explain left-most derivation.
11.Define and give an example for the concept of a syntax tree.
12.Give an example of a homomorphism and inverse homomorphism.
13.What is meant by "Inherent ambiguity"?
14.True or False: Every context free language is regular. Give reasons.
15. Explain LL(k).
16.Explain the idea of a push down automaton.
17.State the Halting problem.
18.Define the notion of a computable function.
19.Give two examples of complexity classes.
20.Briefly describe the chomsky hierarchy of languages.
Part-B
Answer all the questions [4*15=60 Marks]
21.Using NDFAs, show that the class of regular languages are closed under unions, concatenation, Kleen closures and reversals.
(OR)
22.Construct a deterministic FSA for the following NFSA with starting state 1, accepting state 3 and transition table as given below.
State/alphabet a b
1 2 -
2 - 3
3 1 -
23.Explain the steps in SLR(1) parsing with an example.
(OR)
24.Explain the steps to convert to chomsky normal for for the following grammar
s->ASA|aB,A->B|S,B->b|epsilon.
25.Explain pumping Lemma for regular languages and prove that L={0^n|n is a square|is not regular.
(OR)
26.Explain pumping lemma for context free languages and use it to prove that L={ww|w a binary string} is not context free.
(OR)
26.Explain pumping lemma for context free languages and use it to prove that L={ww|w a binary string} is not context free.
27.Define the complexity classes P, NP, NP complete and give examples.
(OR)
28.Define a Turing machine and construct a Tm that recognized the language L of balanced parentheses.
(OR)
28.Define a Turing machine and construct a Tm that recognized the language L of balanced parentheses.
Tags : Sastra University Theory of computing question paper , Sastra University TOC question paper , Sastra University question paper , Sastra question paper , Sastra Theory of computing question paper , Sastra TOC question paper , Sastra University Theory of computing previous year question paper , Sastra University Theory of computing old question paper ,Theory of computing question paper , Sastra University Theory of computing semester question paper , sastra previous year question paper , anna university question paper , anna university semester question paper , anna university TOC question paper
.jpg)
.jpg)
Digital Image Processing | Previous Year Semester Question Paper
Tags : DIP Semester Question Paper , Image Processing Semester Question Paper , anna university semester question paper , sastra university question paper , Digital Image Processing model question paper , Digital Image Processing semester question paper , Digital Image Processing old question paper , Digital Image Processing exam question paper , Digital Image Processing previous year question paper , sastra Digital Image Processing model question paper , sastra university Digital Image Processing model question paper , sastra university Digital Image Processing previous question paper , anna university Digital Image Processing model question paper , Digital Image Processing engineering question paper , Digital Image Processing important 2 marks , sastra university question paper , anna university question paper , sastra university previous year question paper , sastra university old question paper , sastra university old question paper , sastra question paper , anna university question paper , sastra previous year question paper , sastra university question paper , sastra old question paper , sastra DIP question paper
Data Structure | Previous Year Semester Question Paper
Tags : Sastra University Semester Question Paper , Data Structure Model Question Papers , Anna University Model Question Papers , Anna University DS Model Question Papers , Anna University Data Structure Model Question Paper , Data Structure Question paper.
OOAD Mid Sem Question Paper - All Departments
SASTRA UNIVERSITY OOAD MID SEM QUESTION PAPER
SRC SASTRA - Kumbakonam CAMPUS - CSE Department
First ( 1st ) CIA
SRC SASTRA - Kumbakonam CAMPUS - CSE Department
Second ( 2nd ) CIA
SRC SASTRA - Kumbakonam CAMPUS - CSE Department
Third ( 3rd ) CIA
SASTRA UNIVERSITY MAIN CAMPUS - CSE Department
First ( 1st ) Mid Sem
SASTRA UNIVERSITY MAIN CAMPUS - CSE Department
Second ( 2nd ) Mid Sem
SASTRA UNIVERSITY MAIN CAMPUS - IT Department
First ( 1st ) Mid Sem
SASTRA UNIVERSITY MAIN CAMPUS - IT Department
Second ( 2nd ) Mid Sem
SASTRA UNIVERSITY MAIN CAMPUS - IT Department
Third ( 3rd ) Mid Sem
Tag : ooad important questions, OOAD Question papers, SASTRA university OOAD Question papers, sastra university previous year questions, object oriented analysis and design , sastra IT ooad syllabus , sastra CSE ooad syllabus. sastra OOAD e book
Engineering Mathematics II Question Paper
Sastra University .. Engineering Mathematics II Question Paper
May 2007
May 2009 (Arrear Paper)
May 2009 (Common to All Department)
Tags : sastra maths 2 questions, sastra question paper, sastra university, sastra university previous year questions, SASTRA University Semester Question Paper, sastra mathematics 4 question paper , sastra mathematics 2 question paper , sastra maths question paper , sastra maths question bank , anna university maths 2 question paper , anna university maths II question paper
Basic Civil Question Paper
Tags : sastra basic civil question paper, sastra university previous year questions, Sastra university question papers, SASTRA University Semester Question Paper, anna university basic civil question paper , anna university basic civil engineering , sastra university first year question paper , anna university first year question paper , semester question paper
SASTRA University Previous Year C++ Question Paper
SASTRA University Previous Year C++ Question Paper
Tags : new way of engineering, sastra first year C++ question paper, sastra university previous year questions, Sastra university question papers, SASTRA University Semester Question Paper, anna university previous year question paper , anna university semester question papers , anna university C++ question papers , anna university cse question papers
SASTRA University Previous Year ED Question Paper
Tags : new way of engineering, sastra ed question papers, sastra university, sastra university previous year questions, Sastra university question papers, SASTRA University Semester Question Paper, engineering drawing question papers , anna university engineering drawing question papers , ssn engineering drawing question papers , ED question papers
Subscribe to:
Posts (Atom)
