Notice for 7th sem students

NOTICE

All the 7th Semester students are informed that they must have to remain present tomorrow. Check below details.

Date	Time	Subject	Venue
24/9/15	02.00 PM	Meeting for upcoming Workshop	Computer Department Seminar Hall

Soft Computing Practical List for 7th semester.

COMPUTER SCIENCE & ENGINEERING

B. E. SEMESTER: VII

Subject Name: Soft Computing

Subject Code: 173101

Sr. No.	Topic
1	Write a program to implement Back-propagation Learning Algorithm.
2	Write a program to implement basic fuzzy set operations union, intersection, complement.
3	Write a program to implement roulette wheel selection.
4	Write a program to implement single point crossover.
5	Write a program to implement single bit, point mutation.
6	Write a program to generate a new population from previous population.
7	Write a program to solve the nonlinear optimization problem.
8	Write a program to implement GA based weight determination.
9	Write a program to implement Travelling Salesman Problem for n cities using Genetic Algorithm.

Soft Computing Assignment Of 7th Semester

Government Engineering College Patan

Computer Department

B.E. SEM VII (Computer Science & Engineering)

Subject: Soft Computing                                                        Subject code: 173101

Assignment

1.     Give the differences between Supervised Learning and    Unsupervised learning.

2.  List feature of fuzzy NN. Justify the use of fuzzy logic in soft computing.

      3.  Compare Single Layer Vs. Multilayer Perceptron.

4.  Describe Mamdani FIS with its advantages. Differentiate between           

      Mamdani FIS and Sugeno FIS.                                                                               

      5.  Discuss various operations of fuzzy sets with example.

6.  Explain the various learning steps of back propagation network.

7.  Describe learning vector quantization with suitable example.

      8. What are limitations of single layer perception model? How it can be    

           Overcome.

      9.  Discuss the following terms:

               -Perceptron

               - Membership Function

    10.  Discuss the following terms of fuzzy set theory in brief with example:

                - Fuzzy Relation

             - Linguistic Variable

    11.  Describ e the different activation functions in neural network.

    12. What do you mean by activation function, bias, and delta rule?

Seminar on 21 and 22 Sep 2015 for 7th sem students

Seminar for 7^th Semester students 

Date	Time	Subject	Venue
21/9/15	12.00 PM	Overseas employment and career information	Computer Department Seminar Hall
22/9/15	11.30 PM	“Why GATE” By Nitin Rakesh Prasad	Computer Department Seminar Hall

Dear Students,

Please fill the following survey, this is for understanding engineering exam preparation process and analyzing how internet can be helpful to students.

Survey link: http://goo.gl/forms/Q0ssMTV34K

<<<

B.E 3rd Sem Data Structure Assignment-1

Government Engineering College, Patan

B.E 3^rd SEM CSE Department

DATA STRUCTURE (2130702)

Assignment:-1

Stack:

1)      Define Data Structure and classify it.

2)      What do you mean by Data Structure? Give the difference between Primitive and Non-primitive data structures.

3)  Define array and give its representation.

4)  Discuss applications of an array.

5)  Discuss sparse matrix and its representation.

6)  What is Stack? Write down algorithms for performing PUSH and POP operations on a stack.

7)  Write user-defined functions in C to perform four stack operations.

8)  Define the concept of recursion with suitable example.

9)  Discuss a stack application "Tower of Hanoi" with algorithm.

10) Write a 'C’ program for followings using recursion:

·         Factorial

11)  Explain Postfix Notation in detail with suitable example.

12)  Convert following infix expression into postfix format showing stack status after every step in tabular form.

A. A+ (B*C-(D/E^F)*G)*H

B. (A*B+ (C/D))-F

C. A*B/C/D-E*F*G*(H-2)

E. A + B*(C+ D/E*F* (G + H) * I)-K

F. (A + B*C/D-E + F/G/ (H + I))

            G. (A + B) * C + D / (B + A * C) + D

H. A*(B+C/D*E)/ (F+G*H/ (I+J))

I. A+B*C-D/E*H

J. ((A+B)*C-(D-E)) $(F+G)

K. P * (Q - R/S * T) / (A + B * C/D + E)) + F

13)  Convert following infix expressions to polish (prefix) notation.

a. A+B*C-D/E*H

 b. A*(B+C/D*E)/(F+G*H/(I+J))

14)  Convert following Infix expression into Postfix expression. Show each step.

A + B ^ C^ D - E * F / G

15)  Evaluate the following expression showing status of stack in tabular Form:

            a. 546+*493/+*

b. 7 5 2 + * 4 1 1 + / -

c. 3 5 * 6 2 / +

d. 12, 7, 3, -, /, 2, 1, 5, +, *, +

16)  Evaluate the following postfix expression using stack

        AB+CD/*GH*+ ((where A=2, B=4, C=6, D=3, G=8, H=7))

Queue:

17) State the difference between LIFO and FIFO.

18) Discuss representation of Queue and operations on Queue.

19) Write an algorithm to insert an element into and delete an element from singly queue.

20) What is the drawback of the simple queue? How can we overcome it? (State the advantages of circular queue over normal queue.)

21) Write an algorithm to insert an element into and delete an element from circular queue.

22) Define following terms:

a. Priority Queue

 b. Dequeue

23) What is the difference between simple queue, circular queue, double ended queue (dequeue) and priority queue?

24) Discuss applications of queue with example.

Linked List:

25) Explain: Linear linked list. .

26) State the advantage of circular linked list over singly linked list.

27) Write algorithm to insert and delete element at the beginning, ending, Middle & Sorted of singly linked list.

28) Explain circular linked list, doubly linked list.

29) Explain the applications of linked list.

30) State advantages and disadvantages.         

31) Write down advantages of linked list over array and explain it in detail.

B.E 3rd Sem Data Structure Practical List-2015

GOVERNMENT ENGINEERING COLLEGE, PATAN

COMPUTER & SCIENCE DEPARTMENT

DATA STRUCTURE (2130702)

PRACTICAL LIST-2015

1.      Introduction to pointer. Call by Value and Call by reference.

2.      Write a program for stack that performs following operations using array.

(a)    PUSH (b) POP (c) PEEP (d) CHANGE

3.      Write a program to solve Tower of Hanoi Problem using recursion.

4.      Write a program to convert infix notation to postfix notation using stack.

5.      Write a program to implement QUEUE using array that performs following operations (a) INSERT (b) DELETE

6.      Write a program to implement Circular Queue using array.

7.      Write a menu driven program to implement following operations on the singly linked list.

(a) Insert a node at the front of the linked list.

(b) Insert a node at the end of the linked list.

(c) Delete a first node of the linked list.

(d) Delete a node before specified position.

8.      Write a program to implement stack using linked list.

9.      Write a program to implement operations on the doubly linked list.

10.   Write a program to implement Quick Sort.

11.  Write a program to implement Merge Sort.

12.  Write a program to implement Bubble Sort.

13.            Write a program to implement Binary Search.