|
Pages (4) : « 1 [2] 3 4 »
Question Paper Of CS-14 Intelligent Systems June-2005
Q.l (a)What are the three basic characteristic of Al problems?
(b) Define an associative network. Describe this with the help of an example.
© Write the value of each of the following LISP expressions:
(i) (* 3 2 (+ 5 6))
(ii) (set q y «(+ 5 6 7))
(iii) (lessp 13 5 12 9)
(iv) (equal ‘a (cdr ‘(a a)))
(d) Define the distance function for a set E = {x, y, z}. Also define the Euclidean distance.
(e) Convert the following statement into a well-formed formula (wff) :
“Any person who is respected by every person is a king".
(f) Draw a conceptual indexing tree structure based on the HAM model of memory for the following sentence :
“Drink the water”
(g) How does heuristic search reduce the search space? Propose a good heuristic function for the tie-tac-toe problem.
(h) List two distinguishing features between procedural knowledge and declarative knowledge. And give an example of each type of knowledge.
Question Paper Of CS-14 Intelligent Systems Dec-2004
Q .l(a) Briefly describe two areas of application of Artificial Intelligence.
(b) Write the output of the following LISP code
(i) member ‘b ‘(123))
(ii) member ‘b (abc))
(iii) member’(12) ‘(123))
(iv) (cond ((member ‘b ‘(abc)) ‘yes) (t ‘no))
© Define a mapping function and a lambda function.
Give an example of each.
(d) Indicate which of the following are valid wff’ s and which are not Justify your answer.
(i) VP PW → Q(x)
(ii) Man (John)
(iii) V x number (x) → 3 y greater than (y, x)
(iv) father _of (Q(x))
(e) Make a semantic net representation of the statement ‘Jasvinder gave the book to Mariam’
(f) Transform the following into an equivalent conceptual graph.
(i) Vx NORMAL(x)&GROWN(x) →WALK(x)
(ii) Rajni is eating her soup with a spoon.
(g) Write the algorithm for breadth first search.
(h) Give an example each, with justification, of a class of classes and a super class of a class.
(i) Define incompleteness and inconsistency with respect to the nature of AI problems.
Question Paper Of CS-14 Intelligent Systems July- 2004
Q.l(a) Can a system engaged in purely numeric computation be called an intelligent system? Explain with suitable arguments.
(b) What is the output of the following LISP code?
(setq A ‘(BCD))
(car( cdr (cons *A A)))
© What is the output of the following function when invoked with n = 5, and n = 6?
(defun myfun (n)
(cond (( zerop n) -1)
(t
(*(-0 n)
(myfun)
(-n 1)))
)))
(d) Use a truth table to check whether P→Q and ~ P u Q are equivalent formulas or not.
(e) Using an example, show how the technic of “means"-end analysis” helps in achieving a goal state in a problem space.
(f) Given two strings A and B of length n and m, respectively, (M < N). Write an algorithm to find whether B is a substring of A.
(g) Distinguish between “Inductive” and “abductive” forms of reasoning with respect to knowledge-based computing. Give an example of abductive reasoning. Clearly showing why it is not inducthe reasoning
Question Paper Of CS-14 Intelligent Systems Dec-2003
Q.1(a) Describe briefly “Hill Climbing” search strategy.
(b) What are deductive and inductive learning schemes?
© Explain Frame Problem with the help of an example.
(d) Construct the truth-table for the expression:
(P→Q)a(P→Q)
(e) Discuss the relative merits of ATN and RTN based parsing.
(f) Convert the following statement into the Well Formed Formula: “Any person who is respected by every person is a king.”
(g) Convert the following WFF into set of clauses:
(h) What is a production system? Explain briefly.
(i) Name six component areas of Artificial Intelligence.
(j) Explain Expert system in brief.
Question Paper Of CS-14 Intelligent Systems June-2003
Q.1(a) For each of the statements given below, tell whether it is TRUE or FALSE.
(i) Computers are better than human beings in the matter of non-numeric symbolic processing.
(ii) Knowledge is food for intelligence.
(iii) AI does not overlap with any of the disciplines : linguistics, psychology or philosophy.
(b) For the following logical expression, construct truth table
(C v~ D)→(D→C)
© Represent the following English, sentence as a conceptual graph :
A cow has four legs and eats grass.
(d) Write a LISP program to convert Centigrade temperatures to Fahrenheit.
(e) Name various informed search methods used in AI. What do you understand by ‘Heuristics’? What is the role of’ Heuristics’ in informed search?
(f) Briefly write about the role played by each of the following concepts in Object-Oriented approach to knowledge representation :
(i) Class
(ii) Message
(g) Enumerate at least six knowledge represent schemes.
(h) Evaluate the following LISP expressions:
(i)(greaterp 18 151 76)
(ii) (reverse ((p q) r (s t)))
(iii) (+ (/ 9 5) 50)
(i) Write the following syntactic inference methods in symbolic form :
(i) Abductive Inference
(ii) Modus Ponen in FOPL
(iii) Simplification
Question Paper Of CS-14 Intelligent Systems Dec-2002
Q.1(a) Construct a truth-table for the logical expression
(B → A) & (~ B v ~ A)
(b) Name at least six component areas of Artificial Intelligence.
© Evaluate the following LISP expressions:
(i) (member’x'(y (x) (z u)))
(ii) (setq s ‘(p q r))
(iii) (reverse ‘((* b) c (d h)))
(d) Write the following syntactic inference methods in symbolic form;
(i) Abductive Inference
(ii) Modus Ponen in FOPL
(iii) Simplification
(e) In context of Object-Oriented Environment, define
(i) Class
(ii) Polymorphism
(iii) Object
(f) Express the folio-wing statement as a conceptual graph: Mohan takes soup with a spoon.
(g) Describe briefly the Best-First Search algorithm..
(h) Explain the Frame Problem with a suitable example.
(i) Enumerate important characteristics that a computer memory organisation system should possess.
(j) Identify the following variables as nominal, ordinal, binary or interval:
(i) temperature
(ii) sex
(iii) wavelength
(iv) intelligence
(v) population
(vi) quality of food
Question Paper of CS-14 Intelligent Systems June-2002
Q.1(a) Define and describe the difference between knowledge, belief, hypotheses and data.
(b) Evaluate the LISP expressions
(i) (lessp 45 40 76)
(ii)(*(+ 9 5)(*(/10 3) 5))
(iii) ( defun factorial (n)
(cond ((zerop n) 1)
(t ( * n (factorial ( - n 1 ) ) ) ) ) )
© For each of the following statements, tell whether it is true or false:
(i) Frames and Scripts are two knowledge representation mechanisms.
(ii) The work of logicians such as Church, Godel, Post and Turing did not play any role in the development of AI later on.
(iii) The field of linguistics shares an interest in the theory of grammars and language with AI.
(d) Write a LISP program to convert number of miles into number of kilometers (you may assume 5 miles = 8 kilometers).
(e) Construct a truth-table for the following logical expression :
~(C→D) v (C a D)
(f) What do you mean by ‘Heuristics’ ? Describe the role of ‘Heuristics* in solving problems.
(g) What is resolution principle? What is the resolution of (~ P v Q) and (~Q v R)?
(h) Give conceptual dependency structure for the following :
(i) Write the ‘Best-First Search’ algorithm.
Question Paper Of CS-14 Intelligent Systems Dec-2001
Q.1(a) Evaluate the following LISP expressions:
(i) (greaterp 57 75 105)
(ii) (mapcar ‘ + ‘(2468 10) *(1 2 3 4))
(iii)(setq y’(a b 15))
(b) For each of the following statements, tell whether it is true or false:
(i) Artificial Intelligence (AI) is the study of mind,
(ii) Knowledge consists of concepts, facts, procedures and rules,
(iii) The inference rule modus ponens states:
From P→8 and 8 → R infer P→R
© Enumerate at least six knowledge representation schemes.
(d) Write a LISP program that converts temperature in centigrades to equivalent temperature in Farnheit.
(e) Construct a truth-table for the following logical expression
~(P v  → (Pa
(f) Describe briefly about potential problems with the Hill-Climbing methods.
(g) State which variable bindings, if any, will make the following pairs match within each of the following lists:
(h) What is resolution Principle? Find the resolvant of P v ~ (Q a R) and P v Q.
(i) Write the main steps of A* search algorithm.
Question Paper Of CS-I4 Intelligent Systems June -2001
Q.1(a) For each of the statements given below, tell whether it is TRUE or FALSE.
(i) Computers are better than human beings in the matter of non-numeric symbolic processing.
(ii) Knowledge is food for intelligence.
(iii) AI does not overlap with any of the disciplines:
Linguistics, psychology or philosophy.
(b) Enumerate at least six knowledge representation schemes.
© Evaluate the following LISP expression:
(i) (greaterp 18 151 76)
(ii) (reverse ((p q) r (s t)))
(iii) (+( *(/ 9 5) 50) 32)
(d) Write a LISP program to convert Centigrade temperatures to Fahrenheit.
(e) Construct a truth-table for the following logical expression ;
(~P ^ Q)v(Q→P)
(iv) (~P ^ Q)v(Q→P)
(f) Express the following description of a vehicle as a frame structure :
Mohan has a red Maruti car of 1986 model. It has 4 doors, weighs 125 kgs. Its mileage at any time may be computed be a procedure ‘find-mileage’.
(g) What is the fundamental principle of the object oriented approach to knowledge representation? Explain two important concepts from the domain of object oriented representation scheme.
(h) Describe briefly how the operation ’search’ helps in solving problems.
(i) Name at least two structures used in matching techniques.
(j) Enumerate important characteristics that a computer memory organization system should possess.
Question paper of CS-14 Intelligent Systems Jan- 2001
Q.1(a) For each of the following statements, tell whether it is True/False:
(i) The goal of A.I. is to develop working computer systems that are truly capable of performing intelligent tasks effectively and efficiently.
(ii) Computers are better than human beings in the matter of recognizing relative importance of various elements in a scene/situation.
(iii)LISP and PROLOG are two most popular artificial intelligence programming languages.
(b) Explain the difference between declarative and procedural knowledge.
© Evaluate the following LISP expressions:
(i) (append ((a)) (b c))
(ii) (print “hello there”
(iii) defun nonsence ( ) (terpri))’
(d) Define a function called rotate that takes a list and rotates and elements by one position as in (rotate ( a b c d)) (returns( d a b c)
(e) For the following logical expression, construct truth-table.
(C v ~ D)→ (D→C)
(f) Represent the following English sentence as a conceptual graph:
A cow has four legs and eats grass
(g) Briefly write about the played by each of the following concepts in Object-Oriented approach to knowledge representation:
(i) Class (ii) Message .
(h) Enumerate various informed search methods used in AI. What do you understand by ‘Heuristics’? What is the role of ‘Heuristics’ in informed search?
(j) Why is ‘matching’ operation required in some programs in AI?
(k) Enumerate important characteristics that a computer memory organization system should possess.
Question Paper of CS -12 Computer Architecture Dec-2004
Q.I (a) What is mean by inclusion, coherence, and locality in a memory hierarchy? Explain through diagram and examples.
Q.I (b) What is meant by superscalar processor? Explain the concept of pipelining in superscalar processors with diagram. :
Q.I © Shnv the pipelined execution of successive instructions in two unierpipelined cases and explain each case.
Q-l (d) Derive the speedup execution for S(m, 1) to compare the relative performance of a superscalar processor with that of a scalar base machine with the following assumptions:
(i) Kpipeline stage
(ii) N no. of independent instructions through the pipeline.
(iii) m where m is the missing processor.
Also explain every stageof the derivation.
Q.I (e) What is the purpose of prefetch buffers in instruction pipelining? Discuss various kinds of buffers used.
Q.2 Describe the following in the context of system interconnection architecture, with appropriate diagrams:
(i) Ring and Chorda I Ring
Q.2 (ii) Hypercube
Q.2 (iii) Multistage Networks
Question Paper of CS -12 Computer Architecture June-2004
Q.I (a) Analyze the data depedendes among the following statements in a given program fragment:
S1,: Load R,, M(242) / R, r - M(242) /
S2: Load R,, M(240) / R, r- M(240) /
S3;MULTY R3,R1,R2/R3?(R1)x (R2) /
S4: ADDR…R1, R3/R1-(R1)x (R3) /
Ss: STORE M(240), R/M(248)?(R2) /
Draw a dependency graph to show all the three types of dependencies and explain them.
Q.I (b) Consider the main memory of a computer which has 128 blocks, where the size of each block is 16 words. The cache memory has 16-block-frames.
Sketch the fully associative mapping scheme. Also design the address format showing a tag field, block number and word number.
Q.I © What is a hot spot problem? Why does it occur?
Q.I (d) What is the cache coherence problem? Descrive two protocol approaches, with the help of a suitable diagram.
Q.I (e) Explain the applicability and restrictions involved in using Amdahl’s law to estimate the speed-up performance of n processor systems compared with that of a single processor.
Q-I (f) Show the pipelined execution of successive instructions in two underpipclined cases, and explain each case.
Question Paper of CS -12 Computer Architecture Dec-2003
Q.I (a) Analyze the data dependence among the following statements in a given program fragment
Load R1, M (100) /R1, { - M (100)/
Load R2, M (104) /!R2 { - M(104)/
Multi R1, R2 /R1? (r1)* (R2)/
INCR, /R1,?(R1)+1/
Store M (110), R, /M (11) < -(R1,)/
Also
i. Draw a dependence graph to show all the dependence.
ii. Are there any resource dependences if only one copy of each functional unit is a available in the CPU?
Ql(b) What makes the design of pipeline processors challenging? What are exception conditions? Briefly discuss the procedure to be followed when exceptions occur. What are the other issues which complicate the problem?
Ql© Discuss the following terms in the context of the performance of a memory heirarchy:
i) Hit ratio
ii) Memory hierarchy optimization subject to a cost constraint.
Question Paper of CS -12 Computer Architecture June-2003
Q.1(i) The SPARC architecture can be implemented with two to eight registe windows, for a total 40 to 132 General Purpose Registers in the intege unit. Explain how general purpose Registers (GPRs) are organized ini overlapping windows in each of the following designs:
a) Use 40 GPRs to construct two windows.
b) Use 72 G PRs to construct 4 windows.
c) In what sense is the SPARC considered a scalable architecture?
Q 1 (ii) Answer the following questions:
a) Plot the graph showing the speed-up factor and optimal numbers of pipeline stages for a linear pipeline unit. What ae the pros & cons?
b) What are the differences between string reduction and graph reduction
machines?
c) What are the problems encountered in scaling up a computer to massively parallel systems?
d) What are the cahracteristics of CISC and RISC architectures?
Question Paper of CS-12 Computer Architecture Dec-2002
Ql(i) The SPARC architecture can be implemented with two to eight register windows for a total of 40 to 130 GPRs (General Purposed Registers) in the integer unit. Explain how the following designs.
(a) Use 10 GPRs to construct two windows.
(b) Use 72 registers (GPRs) to construct four windows.
© In what sense is the SPARC considered a scalable architecture?
(d) Explain how to use the overlapped windows for parameter passing between the calling procedure and the called procedure.
Ql(ii) Answer the following question:
(a) Comment on the advantages in using SIMD computers as compared with the use of pipelined supercomputers for vector processing.
(b) Describe the language features of parallelism.
© Describe the basic metrics affecting the scalability of a computer system for a given application.
(d) Make diagrams of mesh and torus interconnection network and describe its characteristics.
Question Paper of CS-12 Computer Architecture June - 2002
Ql(i) Consider the execution of the following code segment.
Use Bernstein’s condition to detect the maximum parallelism embedded in this code. Justify the portion that can be executed is parallel and the remaining portion that must be executed sequentially.
S1,:A = B + C
S2,: C = D + E
S3:F = G + E
S4: C = A + F
S5: M - G + G
S6:A = L + C
S7: A = E+A
(ii) Draw a dependence graph to show all the dependences for the above code segment.
(iii) Answer the following questions:
(a) Distinguish between single threaded and multithreaded processor architecture.
(b) What difficulties will arise when a computer is scaled to become a-massively-parallel processing (MPP) system.
© Explain the differences between super scalar and very large instruction word (VLIW) architectures in terms of hardware and s/w requirements.
(d) Describe the advantages and shortcomings of daisy chaining scheme for bus arbitration in a multiprocessor system.
(e) Plot the graph showing the speedup factors and optimal number of pipeline stages for a linear pipeline unit. What are the pros and cons?
Question Paper of CS -12 Computer Architecture Dec -2001
Q.I (i) What are the design parameters for pipeline processors? Discuss them briefly with examples.
(ii) Discuss the structure of super scalar pipelines and the factors causing pipeline stalling.
(iii) Consider the execution of an object code with 2,00,000 instructions on a 40 MHz processor. The program consists of four major types of instructions. The instruction mix and the number of cycles (CPI) needed for each instruction type are given below based on the result of a program
trace experiment:
Instruction type CPI Instruction Mix
Arithmetic and logic 1 60%
Load/store with cache hit 2 18%
Branch 4 12%
Memory reference with 8 10%
cache misses
(a) Calculate the average CPI when the program is executed on a uni processor with the above trace results.
(b) Calculate the corresponding MIPS rate based on the CPI obtained in part (a).
(iv) What is the architectural distinction between RISC and CISC processors? Explain the concept of overlapping register windows in the SPARC architecture diagrammatically.
h1>Question Paper of CS -12 Computer Architecture June -2001
Q.I (i) Consider a cache (M(1) and memory (M2) hierarchy with the following characteristics: M1,: 16 K words, 50 ns access time
M2: 1 M words, 400 ns access time
Assume 8 words cache blocks and a set size of 256 words with set associative mapping.
(a) Show the mapping between M2 and M1,.
(b) Calculate the effective memory access time with a cache hit ratio of h = 0.95.
a) Number of Blocks per set
256 /8 =32 blocks
Cache has
16k /256= 214 / 28
= 26
= 64 sets
No. of Blocks in memory
=1MB/8
_ 1024x1024 / 8
__1048576 / 8
= 131072
Image no.1
b)Teff = h1.t1.+(1-h)t2
= .95t1,=(l-.95)t2
=.95x50+ .05x400
= 47.5+20
= 67.5 n.sec.
(ii) Answer the following questions with reference to processors and memory hierarchy: (a) Explain the relationship between the integer unit and the floating point unit in most RISC processors with scalar or Superscalar organization.
(b) Explain the difference between superscalar and VL1W architectures in terms of H/W and SAW requirements-
© What are the design tradeoffs between a large register file and a large D-cache?
(iii) Define five important characteristics of parallel algorithms, which are machine implemental.
Question Paper of CS -12 Computer Architecture Jan -2001
Q.I (i) The execution times (in seconds) of four programs on three computers are given below:
Execution Time (in seconds)
Program ComputerA ComputerB Computer C
P1 1 10 20
P2 1000 100 40
P3 500 1000 50
P4 100 500 100
Assume that 100,000,000 instructions were executed in each of the four programs. Calculate the MIPS rating of each program on each of the three machines. Based on these ratings. Can you draw a clear conclusion regarding the relative performance of the three computers?
(ii) Answer the following questions:
(a) What causes a processor pipeline to be under pipelined?
(b) What are the factors limiting the degree of superscalar design?
© Compare the instruction set architecture in RISC and CISC processors in terms of instruction formats and addressing modes.
(d) Factors affecting cache hit ratio.
Question Paper of CS-12 Computer ArchitectureDec-2000
Q.I (i) Consider a catch (M1,) and memory (M2:) hierarchy with the following characteristics: M1: 16 K words, 50 ns access time
M2: 1 M words, 400 ns access time
Assume eight word cache blocks and a set size of 256 word with set-associative mapping
Show the mapping between M2 and M1.
Calculate the effective memory access time with a catch bit ratio of h = 0.95.
(ii) What causes a processor pipeline to be underpipelined?
(iii) What is meant by a hierarchical bus system for multiprocessing system?
|
|