Design an algorithm, draw a corresponding flow chart and write a ‘C’ program for Binary Search, to search a given number among the list of numbers. 10m Dec2007 Algorithm Step 1: Declare an array ‘k’ of size ‘n’ i.e. k(n) is an array which stores all the keys of a file containing ‘n’ records… Read More »
Design and draw a master-slave flip flop using JK flipflops. What are the advantages it offers over other flip flops? 10m Jun2007 Master Slave Flip Flop Master-slave flip flop consists of two flip-flops. One is the master flip-flop & other is called the slave flip-flop. The figure shows implementation of master-slave flipflop using J-K flip-flop.… Read More »
Design a circuit to interface four RAMs of 128 x 8 size and a ROM of 512 x 8 size. Draw the memory map for the same. 8m Jun2007 Address lines:- 128 = 128 = 27 512 = 29 Address lines = 16
Decoder converts one type of coded information to another form. A decoder has ‘n’ inputs and an enable line (a sort of selection line) and 2n output lines. Let us see diagram of 3×8 decoder which decodes a 3 bit information and there is only one output line which gets the value 1 or in… Read More »
Simplify the following Boolean function using Karnaugh map method F( A ,B , C , D ) = Σ ( 1, 2 , 5 , 6 , 7 , 8 , 9 , 11 , 12 ,15 ) Also, draw the corresponding logic circuit diagram. 8m Jun2007 K-Map for F is: Thus, the simplified equations for F (A,… Read More »
Draw the logic diagram of a full adder. Create a 2-bit adder-subtractor circuit using the block diagram of the full adder 6m Jun2006 A combinational circuit which performs addition of two bits is called a half adder, while the combinational circuit which performs arithmetic addition of three bits (the third bit is the previous carry bit)… Read More »
Simplify the following boolean function in POS form using K-maps : F (A, B, C, D) = Σ (0, 2, 4, 5, 6, 8, 10, 13, 15) Also draw a logic diagram using only NAND gates. 5m Dec2005 K-Map for F is: Thus, the simplified equations for F (A, B, C, D) =… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-014 Course Title : Systems Analysis and Design Assignment Number : MCA(1)/014/Assign/13 Assignment 2013 ER Diagram Notations for the components of ERD: Entities: An entity is something about which the business needs to store data. An entity is a class of persons, places, objects, events or concepts about… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code : MCS-014 Course Title : Systems Analysis and Design Assignment Number : MCA(1)/014/Assign/13 Assignment 2013 Data Flow Diagrams A DFD can be categorized in the following forms: Context diagram: An overview of an organizational system that shows the system boundaries, external entities that interact with the system and… Read More »
MASTER OF COMPUTER APPLICATIONS Course Code: MCS-011 Course Title : Problem Solving and Programming Assignment Number : MCA(1)/011/Assign/2014-15 Maximum Marks : 100 Weightage : 25% Write an algorithm, draw a corresponding flowchart and write an interactive C program to prompt the user to input 3 integer values and print these values in forward and… Read More »